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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [eval_speedFails1_bb1_in/5,eval_speedFails1_bb2_in/5]
1. non_recursive  : [eval_speedFails1_stop/5]
2. non_recursive  : [eval_speedFails1_bb3_in/5]
3. non_recursive  : [exit_location/1]
4. non_recursive  : [eval_speedFails1_bb1_in_loop_cont/6]
5. non_recursive  : [eval_speedFails1_4/5]
6. non_recursive  : [eval_speedFails1_3/5]
7. non_recursive  : [eval_speedFails1_2/5]
8. non_recursive  : [eval_speedFails1_1/5]
9. non_recursive  : [eval_speedFails1_0/5]
10. non_recursive  : [eval_speedFails1_bb0_in/5]
11. non_recursive  : [eval_speedFails1_start/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_speedFails1_bb1_in/5
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into eval_speedFails1_bb1_in_loop_cont/6
5. SCC is partially evaluated into eval_speedFails1_4/5
6. SCC is completely evaluated into other SCCs
7. SCC is completely evaluated into other SCCs
8. SCC is completely evaluated into other SCCs
9. SCC is completely evaluated into other SCCs
10. SCC is completely evaluated into other SCCs
11. SCC is partially evaluated into eval_speedFails1_start/5

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

### Specialization of cost equations eval_speedFails1_bb1_in/5 
* 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 eval_speedFails1_bb1_in/5 
* CEs [10] --> Loop 8 
* CEs [8] --> Loop 9 
* CEs [9] --> Loop 10 

### Ranking functions of CR eval_speedFails1_bb1_in(V__0,V_m,V_n,B,C) 

#### Partial ranking functions of CR eval_speedFails1_bb1_in(V__0,V_m,V_n,B,C) 


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


### Cost equations --> "Loop" of eval_speedFails1_bb1_in_loop_cont/6 
* CEs [11] --> Loop 11 
* CEs [12] --> Loop 12 

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

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


### Specialization of cost equations eval_speedFails1_4/5 
* CE 2 is refined into CE [13,14,15,16,17,18] 


### Cost equations --> "Loop" of eval_speedFails1_4/5 
* CEs [17,18] --> Loop 13 
* CEs [13] --> Loop 14 
* CEs [16] --> Loop 15 
* CEs [14] --> Loop 16 
* CEs [15] --> Loop 17 

### Ranking functions of CR eval_speedFails1_4(V__0,V_i,V_m,V_n,B) 

#### Partial ranking functions of CR eval_speedFails1_4(V__0,V_i,V_m,V_n,B) 


### Specialization of cost equations eval_speedFails1_start/5 
* CE 1 is refined into CE [19,20,21,22,23] 


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

### Ranking functions of CR eval_speedFails1_start(V__0,V_i,V_m,V_n,B) 

#### Partial ranking functions of CR eval_speedFails1_start(V__0,V_i,V_m,V_n,B) 


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

#### Cost of chains of eval_speedFails1_bb1_in(V__0,V_m,V_n,B,C):
* Chain [[8]]...: 1*it(8)+0
  with precondition: [V_n>=V__0] 

* Chain [[8],10]: 1*it(8)+0
  with precondition: [B=2,C>=V_n+1,C>=V__0+V_m,V_m+V_n>=C] 

* Chain [[8],9]: 1*it(8)+0
  with precondition: [B=3,V_n>=V__0] 

* Chain [10]: 0
  with precondition: [B=2,V__0=C,V__0>=V_n+1] 

* Chain [9]: 0
  with precondition: [B=3] 


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

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


#### Cost of chains of eval_speedFails1_4(V__0,V_i,V_m,V_n,B):
* Chain [17]: 0
  with precondition: [] 

* Chain [16]: 1*s(1)+0
  with precondition: [V_m>=1,V_n>=V_i] 

* Chain [15]: 1*s(2)+0
  with precondition: [V_n>=V_i] 

* Chain [14]: 0
  with precondition: [V_i>=V_n+1] 

* Chain [13]...: 1*aux(1)+0
  with precondition: [V_n>=V_i] 


#### Cost of chains of eval_speedFails1_start(V__0,V_i,V_m,V_n,B):
* Chain [22]: 0
  with precondition: [] 

* Chain [21]: 1*s(5)+0
  with precondition: [V_m>=1,V_n>=V_i] 

* Chain [20]: 1*s(6)+0
  with precondition: [V_n>=V_i] 

* Chain [19]: 0
  with precondition: [V_i>=V_n+1] 

* Chain [18]...: 1*s(7)+0
  with precondition: [V_n>=V_i] 


Closed-form bounds of eval_speedFails1_start(V__0,V_i,V_m,V_n,B): 
-------------------------------------
* Chain [22] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [21] with precondition: [V_m>=1,V_n>=V_i] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [20] with precondition: [V_n>=V_i] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [19] with precondition: [V_i>=V_n+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [18]... with precondition: [V_n>=V_i] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_speedFails1_start(V__0,V_i,V_m,V_n,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 97 ms.