/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  : [f0/3]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f0_loop_cont/2]
3. non_recursive  : [start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f0/3
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into start/3

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

### Specialization of cost equations f0/3 
* CE 4 is refined into CE [5] 
* CE 3 is refined into CE [6] 
* CE 2 is refined into CE [7] 


### Cost equations --> "Loop" of f0/3 
* CEs [6] --> Loop 5 
* CEs [7] --> Loop 6 
* CEs [5] --> Loop 7 

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

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


### Specialization of cost equations start/3 
* CE 1 is refined into CE [8,9,10] 


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

### Ranking functions of CR start(A,B,C) 

#### Partial ranking functions of CR start(A,B,C) 


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

#### Cost of chains of f0(A,B,C):
* Chain [7]: 0
  with precondition: [C=2] 

* Chain [6,7]: 1
  with precondition: [B=0,C=2,0>=A+1] 

* Chain [5,7]: 1
  with precondition: [B=0,C=2,A>=1] 


#### Cost of chains of start(A,B,C):
* Chain [10]: 0
  with precondition: [] 

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

* Chain [8]: 1
  with precondition: [B=0,A>=1] 


Closed-form bounds of start(A,B,C): 
-------------------------------------
* Chain [10] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [9] with precondition: [B=0,0>=A+1] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [8] with precondition: [B=0,A>=1] 
    - Upper bound: 1 
    - Complexity: constant 

### Maximum cost of start(A,B,C): 1 
Asymptotic class: constant 
* Total analysis performed in 35 ms.