/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  : [cut/5,lbl51/5]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [stop/5]
3. non_recursive  : [lbl51_loop_cont/6]
4. non_recursive  : [start/5]
5. non_recursive  : [start0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into lbl51/5
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into lbl51_loop_cont/6
4. SCC is partially evaluated into start/5
5. SCC is partially evaluated into start0/5

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

### Specialization of cost equations lbl51/5 
* CE 7 is refined into CE [10] 
* CE 5 is refined into CE [11] 
* CE 4 is refined into CE [12] 
* CE 6 is refined into CE [13] 
* CE 3 is refined into CE [14] 


### Cost equations --> "Loop" of lbl51/5 
* CEs [14] --> Loop 10 
* CEs [10] --> Loop 11 
* CEs [11] --> Loop 12 
* CEs [12] --> Loop 13 
* CEs [13] --> Loop 14 

### Ranking functions of CR lbl51(A,C,F,G,H) 
* RF of phase [10]: [-C+9]

#### Partial ranking functions of CR lbl51(A,C,F,G,H) 
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    -C+9


### Specialization of cost equations lbl51_loop_cont/6 
* CE 9 is refined into CE [15] 
* CE 8 is refined into CE [16] 


### Cost equations --> "Loop" of lbl51_loop_cont/6 
* CEs [15] --> Loop 15 
* CEs [16] --> Loop 16 

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

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


### Specialization of cost equations start/5 
* CE 2 is refined into CE [17,18,19,20,21,22,23] 


### Cost equations --> "Loop" of start/5 
* CEs [17,18,19,20,21,22,23] --> Loop 17 

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

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


### Specialization of cost equations start0/5 
* CE 1 is refined into CE [24] 


### Cost equations --> "Loop" of start0/5 
* CEs [24] --> Loop 18 

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

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


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

#### Cost of chains of lbl51(A,C,F,G,H):
* Chain [[10],14]: 1*it(10)+0
  Such that:it(10) =< -C+H

  with precondition: [F=2,9>=H,C>=0,G>=10,C+2>=A,H>=A,A>=C+1,H+2>=G] 

* Chain [[10],13]: 1*it(10)+0
  Such that:it(10) =< -C+H

  with precondition: [F=2,9>=H,C>=0,C+2>=A,H>=A,A>=C+1,H>=G] 

* Chain [[10],12]: 1*it(10)+0
  Such that:it(10) =< -C+H

  with precondition: [F=2,9>=H,C>=0,C+2>=A,H>=A,A>=C+1,G>=H+3] 

* Chain [[10],11]: 1*it(10)+0
  Such that:it(10) =< -C+9

  with precondition: [F=3,9>=A,C>=0,C+2>=A,A>=C+1] 

* Chain [13]: 0
  with precondition: [F=2,A=G,C=H,9>=C,C>=0,C>=A] 

* Chain [12]: 0
  with precondition: [F=2,A=G,C=H,9>=C,C>=0,A>=C+3] 

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


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

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


#### Cost of chains of start(A,B,C,D,F):
* Chain [17]: 36
  with precondition: [B=A,D=C] 


#### Cost of chains of start0(A,B,C,D,F):
* Chain [18]: 36
  with precondition: [] 


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

### Maximum cost of start0(A,B,C,D,F): 36 
Asymptotic class: constant 
* Total analysis performed in 144 ms.