/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. non_recursive  : [f3/6]
1. recursive  : [f300/10]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f300_loop_cont/7]
4. non_recursive  : [f2/6]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f300/10
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f300_loop_cont/7
4. SCC is partially evaluated into f2/6

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

### Specialization of cost equations f300/10 
* CE 5 is refined into CE [8] 
* CE 4 is refined into CE [9] 
* CE 3 is refined into CE [10] 


### Cost equations --> "Loop" of f300/10 
* CEs [10] --> Loop 8 
* CEs [8] --> Loop 9 
* CEs [9] --> Loop 10 

### Ranking functions of CR f300(A,B,C,D,E,F,G,H,I,J) 
* RF of phase [8]: [-A+101]

#### Partial ranking functions of CR f300(A,B,C,D,E,F,G,H,I,J) 
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    -A+101


### Specialization of cost equations f300_loop_cont/7 
* CE 7 is refined into CE [11] 
* CE 6 is refined into CE [12] 


### Cost equations --> "Loop" of f300_loop_cont/7 
* CEs [11] --> Loop 11 
* CEs [12] --> Loop 12 

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

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


### Specialization of cost equations f2/6 
* CE 2 is refined into CE [13,14,15] 
* CE 1 is refined into CE [16] 


### Cost equations --> "Loop" of f2/6 
* CEs [13,14,15] --> Loop 13 
* CEs [16] --> Loop 14 

### Ranking functions of CR f2(A,B,C,D,E,F) 

#### Partial ranking functions of CR f2(A,B,C,D,E,F) 


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

#### Cost of chains of f300(A,B,C,D,E,F,G,H,I,J):
* Chain [[8],10]: 1*it(8)+0
  Such that:it(8) =< -A+101

  with precondition: [F=2,G=101,H=0,I=0,J=0,100>=A,A>=1,B>=1] 

* Chain [[8],9]: 1*it(8)+0
  Such that:it(8) =< -A+101

  with precondition: [F=3,100>=A,A>=1,B>=1] 

* Chain [9]: 0
  with precondition: [F=3,A>=1,B>=1] 


#### Cost of chains of f300_loop_cont(A,B,C,D,E,F,G):
* Chain [12]: 0
  with precondition: [A=2,C>=1] 

* Chain [11]: 0
  with precondition: [A=3,C>=1] 


#### Cost of chains of f2(A,B,C,D,E,F):
* Chain [14]: 0
  with precondition: [0>=B] 

* Chain [13]: 200
  with precondition: [B>=1] 


Closed-form bounds of f2(A,B,C,D,E,F): 
-------------------------------------
* Chain [14] with precondition: [0>=B] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [13] with precondition: [B>=1] 
    - Upper bound: 200 
    - Complexity: constant 

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