/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_speedFails2_bb1_in/4,eval_speedFails2_bb2_in/4]
1. non_recursive  : [eval_speedFails2_stop/4]
2. non_recursive  : [eval_speedFails2_bb3_in/4]
3. non_recursive  : [exit_location/1]
4. non_recursive  : [eval_speedFails2_bb1_in_loop_cont/5]
5. non_recursive  : [eval_speedFails2_4/4]
6. non_recursive  : [eval_speedFails2_3/4]
7. non_recursive  : [eval_speedFails2_2/4]
8. non_recursive  : [eval_speedFails2_1/4]
9. non_recursive  : [eval_speedFails2_0/4]
10. non_recursive  : [eval_speedFails2_bb0_in/4]
11. non_recursive  : [eval_speedFails2_start/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_speedFails2_bb1_in/4
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_speedFails2_bb1_in_loop_cont/5
5. SCC is partially evaluated into eval_speedFails2_4/4
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_speedFails2_start/4

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

### Specialization of cost equations eval_speedFails2_bb1_in/4 
* CE 6 is refined into CE [9] 
* CE 5 is refined into CE [10] 
* CE 3 is refined into CE [11] 
* CE 4 is refined into CE [12] 


### Cost equations --> "Loop" of eval_speedFails2_bb1_in/4 
* CEs [11] --> Loop 9 
* CEs [12] --> Loop 10 
* CEs [9] --> Loop 11 
* CEs [10] --> Loop 12 

### Ranking functions of CR eval_speedFails2_bb1_in(V_i_0,V_n,B,C) 
* RF of phase [10]: [-V_i_0+V_n]

#### Partial ranking functions of CR eval_speedFails2_bb1_in(V_i_0,V_n,B,C) 
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    -V_i_0+V_n


### Specialization of cost equations eval_speedFails2_bb1_in_loop_cont/5 
* CE 8 is refined into CE [13] 
* CE 7 is refined into CE [14] 


### Cost equations --> "Loop" of eval_speedFails2_bb1_in_loop_cont/5 
* CEs [13] --> Loop 13 
* CEs [14] --> Loop 14 

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

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


### Specialization of cost equations eval_speedFails2_4/4 
* CE 2 is refined into CE [15,16,17,18,19,20,21] 


### Cost equations --> "Loop" of eval_speedFails2_4/4 
* CEs [20,21] --> Loop 15 
* CEs [16,18] --> Loop 16 
* CEs [19] --> Loop 17 
* CEs [15] --> Loop 18 
* CEs [17] --> Loop 19 

### Ranking functions of CR eval_speedFails2_4(V_i_0,V_n,V_x,B) 

#### Partial ranking functions of CR eval_speedFails2_4(V_i_0,V_n,V_x,B) 


### Specialization of cost equations eval_speedFails2_start/4 
* CE 1 is refined into CE [22,23,24,25,26] 


### Cost equations --> "Loop" of eval_speedFails2_start/4 
* CEs [26] --> Loop 20 
* CEs [25] --> Loop 21 
* CEs [24] --> Loop 22 
* CEs [23] --> Loop 23 
* CEs [22] --> Loop 24 

### Ranking functions of CR eval_speedFails2_start(V_i_0,V_n,V_x,B) 

#### Partial ranking functions of CR eval_speedFails2_start(V_i_0,V_n,V_x,B) 


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

#### Cost of chains of eval_speedFails2_bb1_in(V_i_0,V_n,B,C):
* Chain [[10],12]: 1*it(10)+0
  Such that:it(10) =< -V_i_0+C

  with precondition: [B=2,V_n=C,V_n>=V_i_0+1] 

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

  with precondition: [B=3,V_n>=V_i_0+1] 

* Chain [[9]]...: 1*it(9)+0
  with precondition: [V_i_0>=V_n+1] 

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

* Chain [12]: 0
  with precondition: [B=2,V_i_0=V_n,V_i_0=C] 

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


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

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


#### Cost of chains of eval_speedFails2_4(V_i_0,V_n,V_x,B):
* Chain [19]: 0
  with precondition: [] 

* Chain [18]: 0
  with precondition: [V_x=V_n] 

* Chain [17]: 1*s(1)+0
  with precondition: [V_x>=V_n+1] 

* Chain [16]: 2*s(2)+0
  Such that:aux(1) =< V_n-V_x
s(2) =< aux(1)

  with precondition: [V_n>=V_x+1] 

* Chain [15]...: 1*aux(2)+0
  with precondition: [V_x>=V_n+1] 


#### Cost of chains of eval_speedFails2_start(V_i_0,V_n,V_x,B):
* Chain [24]: 0
  with precondition: [] 

* Chain [23]: 0
  with precondition: [V_x=V_n] 

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

* Chain [21]: 2*s(8)+0
  Such that:s(7) =< V_n-V_x
s(8) =< s(7)

  with precondition: [V_n>=V_x+1] 

* Chain [20]...: 1*s(9)+0
  with precondition: [V_x>=V_n+1] 


Closed-form bounds of eval_speedFails2_start(V_i_0,V_n,V_x,B): 
-------------------------------------
* Chain [24] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23] with precondition: [V_x=V_n] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22] with precondition: [V_x>=V_n+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [21] with precondition: [V_n>=V_x+1] 
    - Upper bound: 2*V_n-2*V_x 
    - Complexity: n 
* Chain [20]... with precondition: [V_x>=V_n+1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_speedFails2_start(V_i_0,V_n,V_x,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 110 ms.