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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [f8/9]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f23/5]
3. non_recursive  : [f8_loop_cont/6]
4. non_recursive  : [f0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f8/9
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f8_loop_cont/6
4. SCC is partially evaluated into f0/5

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

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


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

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

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


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


### Cost equations --> "Loop" of f8_loop_cont/6 
* CEs [12] --> Loop 12 
* CEs [13] --> Loop 13 

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

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


### Specialization of cost equations f0/5 
* CE 1 is refined into CE [14,15,16] 


### Cost equations --> "Loop" of f0/5 
* CEs [14,15,16] --> Loop 14 

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

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


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

#### Cost of chains of f8(A,B,C,D,F,G,H,I,J):
* Chain [[8,9],11]: 2*it(8)+0
  Such that:aux(3) =< -A+4
it(8) =< aux(3)

  with precondition: [F=2,G=4,3>=A,A>=0] 

* Chain [[8,9],10]: 2*it(8)+0
  Such that:aux(4) =< -A+4
it(8) =< aux(4)

  with precondition: [F=3,3>=A,A>=0] 

* Chain [10]: 0
  with precondition: [F=3,A>=0] 


#### Cost of chains of f8_loop_cont(A,B,C,D,E,F):
* Chain [13]: 0
  with precondition: [A=2] 

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


#### Cost of chains of f0(A,B,C,D,F):
* Chain [14]: 16
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,F): 
-------------------------------------
* Chain [14] with precondition: [] 
    - Upper bound: 16 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D,F): 16 
Asymptotic class: constant 
* Total analysis performed in 107 ms.