/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(1))  

Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [f5/7]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f13/8]
3. recursive  : [f17/11]
4. recursive  : [f32/7]
5. non_recursive  : [f32_loop_cont/9]
6. non_recursive  : [f17_loop_cont/9]
7. non_recursive  : [f5_loop_cont/9]
8. non_recursive  : [f0/8]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f5/7
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f17/11
4. SCC is partially evaluated into f32/7
5. SCC is partially evaluated into f32_loop_cont/9
6. SCC is partially evaluated into f17_loop_cont/9
7. SCC is partially evaluated into f5_loop_cont/9
8. SCC is partially evaluated into f0/8

Control-Flow Refinement of Cost Relations
=====================================

### Specialization of cost equations f5/7 
* CE 4 is refined into CE [21] 
* CE 3 is refined into CE [22] 
* CE 2 is refined into CE [23] 


### Cost equations --> "Loop" of f5/7 
* CEs [23] --> Loop 21 
* CEs [21] --> Loop 22 
* CEs [22] --> Loop 23 

### Ranking functions of CR f5(A,B,D,J,K,L,M) 
* RF of phase [21]: [-A+100]

#### Partial ranking functions of CR f5(A,B,D,J,K,L,M) 
* Partial RF of phase [21]:
  - RF of loop [21:1]:
    -A+100


### Specialization of cost equations f17/11 
* CE 9 is discarded (unfeasible) 
* CE 11 is discarded (unfeasible) 
* CE 10 is discarded (unfeasible) 
* CE 7 is discarded (unfeasible) 
* CE 8 is discarded (unfeasible) 


### Cost equations --> "Loop" of f17/11 

### Ranking functions of CR f17(B,C,D,F,G,J,K,L,M,N,O) 

#### Partial ranking functions of CR f17(B,C,D,F,G,J,K,L,M,N,O) 

Warning: no base case found for predicate

### Specialization of cost equations f32/7 
* CE 18 is discarded (unfeasible) 
* CE 17 is discarded (unfeasible) 
* CE 15 is discarded (unfeasible) 
* CE 16 is discarded (unfeasible) 


### Cost equations --> "Loop" of f32/7 

### Ranking functions of CR f32(C,D,E,J,K,L,M) 

#### Partial ranking functions of CR f32(C,D,E,J,K,L,M) 

Warning: no base case found for predicate

### Specialization of cost equations f32_loop_cont/9 
* CE 20 is discarded (unfeasible) 
* CE 19 is discarded (unfeasible) 


### Cost equations --> "Loop" of f32_loop_cont/9 

### Ranking functions of CR f32_loop_cont(A,B,C,D,E,F,G,H,I) 

#### Partial ranking functions of CR f32_loop_cont(A,B,C,D,E,F,G,H,I) 

Warning: no base case found for predicate

### Specialization of cost equations f17_loop_cont/9 
* CE 14 is discarded (unfeasible) 
* CE 13 is discarded (unfeasible) 
* CE 12 is discarded (unfeasible) 


### Cost equations --> "Loop" of f17_loop_cont/9 

### Ranking functions of CR f17_loop_cont(A,B,C,D,E,F,G,H,I) 

#### Partial ranking functions of CR f17_loop_cont(A,B,C,D,E,F,G,H,I) 

Warning: no base case found for predicate

### Specialization of cost equations f5_loop_cont/9 
* CE 6 is refined into CE [24] 
* CE 5 is refined into CE [25] 


### Cost equations --> "Loop" of f5_loop_cont/9 
* CEs [24] --> Loop 24 
* CEs [25] --> Loop 25 

### Ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H,I) 

#### Partial ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H,I) 


### Specialization of cost equations f0/8 
* CE 1 is refined into CE [26,27,28] 


### Cost equations --> "Loop" of f0/8 
* CEs [26,27,28] --> Loop 26 

### Ranking functions of CR f0(A,B,C,D,E,F,G,J) 

#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,J) 


Computing Bounds
=====================================

#### Cost of chains of f5(A,B,D,J,K,L,M):
* Chain [[21],23]: 1*it(21)+0
  Such that:it(21) =< -A+100

  with precondition: [J=2,K=100,M=98,B=L,99>=A,A>=0] 

* Chain [[21],22]: 1*it(21)+0
  Such that:it(21) =< -A+100

  with precondition: [J=3,99>=A,A>=0] 

* Chain [22]: 0
  with precondition: [J=3,A>=0] 


#### Cost of chains of f17(B,C,D,F,G,J,K,L,M,N,O):

#### Cost of chains of f32(C,D,E,J,K,L,M):

#### Cost of chains of f32_loop_cont(A,B,C,D,E,F,G,H,I):

#### Cost of chains of f17_loop_cont(A,B,C,D,E,F,G,H,I):

#### Cost of chains of f5_loop_cont(A,B,C,D,E,F,G,H,I):
* Chain [25]: 0
  with precondition: [A=2] 

* Chain [24]: 0
  with precondition: [A=3] 


#### Cost of chains of f0(A,B,C,D,E,F,G,J):
* Chain [26]: 200
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,J): 
-------------------------------------
* Chain [26] with precondition: [] 
    - Upper bound: 200 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D,E,F,G,J): 200 
Asymptotic class: constant 
* Total analysis performed in 146 ms.