/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  : [f7/6]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f19/6]
3. non_recursive  : [f7_loop_cont/7]
4. non_recursive  : [f0/6]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f7/6
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f7_loop_cont/7
4. SCC is partially evaluated into f0/6

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

### Specialization of cost equations f7/6 
* CE 4 is refined into CE [7] 
* CE 3 is refined into CE [8] 
* CE 2 is refined into CE [9] 


### Cost equations --> "Loop" of f7/6 
* CEs [9] --> Loop 7 
* CEs [7] --> Loop 8 
* CEs [8] --> Loop 9 

### Ranking functions of CR f7(C,D,E,G,H,I) 
* RF of phase [7]: [-D+10]

#### Partial ranking functions of CR f7(C,D,E,G,H,I) 
* Partial RF of phase [7]:
  - RF of loop [7:1]:
    -D+10


### Specialization of cost equations f7_loop_cont/7 
* CE 6 is refined into CE [10] 
* CE 5 is refined into CE [11] 


### Cost equations --> "Loop" of f7_loop_cont/7 
* CEs [10] --> Loop 10 
* CEs [11] --> Loop 11 

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

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


### Specialization of cost equations f0/6 
* CE 1 is refined into CE [12,13,14] 


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

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

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


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

#### Cost of chains of f7(C,D,E,G,H,I):
* Chain [[7],9]: 1*it(7)+0
  Such that:it(7) =< -D+10

  with precondition: [C=10,G=2,H=10,9>=D,D>=0] 

* Chain [[7],8]: 1*it(7)+0
  Such that:it(7) =< -D+10

  with precondition: [C=10,G=3,9>=D,D>=0] 

* Chain [8]: 0
  with precondition: [C=10,G=3,D>=0] 


#### Cost of chains of f7_loop_cont(A,B,C,D,E,F,G):
* Chain [11]: 0
  with precondition: [A=2,D=10,C=B] 

* Chain [10]: 0
  with precondition: [A=3,D=10,C=B] 


#### Cost of chains of f0(A,B,C,D,E,G):
* Chain [12]: 20
  with precondition: [] 


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

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