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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [eval_real2_bb2_in/10,eval_real2_bb3_in/10,eval_real2_bb4_in/10,eval_real2_bb5_in/10]
1. recursive  : [eval_real2_bb1_in/10,eval_real2_bb2_in_loop_cont/11]
2. non_recursive  : [eval_real2_stop/6]
3. non_recursive  : [eval_real2_bb6_in/6]
4. non_recursive  : [exit_location/1]
5. non_recursive  : [eval_real2_bb1_in_loop_cont/7]
6. non_recursive  : [eval_real2_8/6]
7. non_recursive  : [eval_real2_7/6]
8. non_recursive  : [eval_real2_6/6]
9. non_recursive  : [eval_real2_5/6]
10. non_recursive  : [eval_real2_4/6]
11. non_recursive  : [eval_real2_3/6]
12. non_recursive  : [eval_real2_2/6]
13. non_recursive  : [eval_real2_1/6]
14. non_recursive  : [eval_real2_0/6]
15. non_recursive  : [eval_real2_bb0_in/6]
16. non_recursive  : [eval_real2_start/6]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_real2_bb2_in/10
1. SCC is partially evaluated into eval_real2_bb1_in/10
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is completely evaluated into other SCCs
5. SCC is partially evaluated into eval_real2_bb1_in_loop_cont/7
6. SCC is partially evaluated into eval_real2_8/6
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 completely evaluated into other SCCs
12. SCC is completely evaluated into other SCCs
13. SCC is completely evaluated into other SCCs
14. SCC is completely evaluated into other SCCs
15. SCC is completely evaluated into other SCCs
16. SCC is partially evaluated into eval_real2_start/6

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

### Specialization of cost equations eval_real2_bb2_in/10 
* CE 14 is refined into CE [15] 
* CE 13 is refined into CE [16] 
* CE 11 is refined into CE [17] 
* CE 12 is refined into CE [18] 


### Cost equations --> "Loop" of eval_real2_bb2_in/10 
* CEs [17] --> Loop 15 
* CEs [18] --> Loop 16 
* CEs [15] --> Loop 17 
* CEs [16] --> Loop 18 

### Ranking functions of CR eval_real2_bb2_in(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B,C,D,E,F) 
* RF of phase [15,16]: [-V_i_0+V_len-1]

#### Partial ranking functions of CR eval_real2_bb2_in(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B,C,D,E,F) 
* Partial RF of phase [15,16]:
  - RF of loop [15:1,16:1]:
    -V_i_0+V_len-1


### Specialization of cost equations eval_real2_bb1_in/10 
* CE 3 is refined into CE [19,20] 
* CE 4 is refined into CE [21,22] 
* CE 8 is refined into CE [23] 
* CE 7 is refined into CE [24] 
* CE 5 is refined into CE [25,26] 
* CE 6 is refined into CE [27,28] 


### Cost equations --> "Loop" of eval_real2_bb1_in/10 
* CEs [26] --> Loop 19 
* CEs [28] --> Loop 20 
* CEs [25] --> Loop 21 
* CEs [27] --> Loop 22 
* CEs [20] --> Loop 23 
* CEs [19] --> Loop 24 
* CEs [22] --> Loop 25 
* CEs [21] --> Loop 26 
* CEs [23] --> Loop 27 
* CEs [24] --> Loop 28 

### Ranking functions of CR eval_real2_bb1_in(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B,C,D,E,F) 

#### Partial ranking functions of CR eval_real2_bb1_in(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B,C,D,E,F) 


### Specialization of cost equations eval_real2_bb1_in_loop_cont/7 
* CE 9 is refined into CE [29] 
* CE 10 is refined into CE [30] 


### Cost equations --> "Loop" of eval_real2_bb1_in_loop_cont/7 
* CEs [29] --> Loop 29 
* CEs [30] --> Loop 30 

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

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


### Specialization of cost equations eval_real2_8/6 
* CE 2 is refined into CE [31,32,33,34,35,36,37,38] 


### Cost equations --> "Loop" of eval_real2_8/6 
* CEs [37,38] --> Loop 31 
* CEs [35,36] --> Loop 32 
* CEs [31,32] --> Loop 33 
* CEs [33,34] --> Loop 34 

### Ranking functions of CR eval_real2_8(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B) 

#### Partial ranking functions of CR eval_real2_8(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B) 


### Specialization of cost equations eval_real2_start/6 
* CE 1 is refined into CE [39,40,41,42] 


### Cost equations --> "Loop" of eval_real2_start/6 
* CEs [42] --> Loop 35 
* CEs [41] --> Loop 36 
* CEs [40] --> Loop 37 
* CEs [39] --> Loop 38 

### Ranking functions of CR eval_real2_start(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B) 

#### Partial ranking functions of CR eval_real2_start(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B) 


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

#### Cost of chains of eval_real2_bb2_in(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B,C,D,E,F):
* Chain [[15,16],18]: 2*it(15)+0
  Such that:aux(2) =< -V_i_0+F
aux(1) =< -V_i_0+F+1
it(15) =< aux(1)
it(15) =< aux(2)

  with precondition: [B=2,C=D,C=E,V_len=F+1,V_again_1>=0,C>=0,V_i_0>=V_again_1,V_len>=V_i_0+2,V_again_1+V_len>=V_i_0+C+1] 

* Chain [[15,16],17]: 2*it(15)+0
  Such that:aux(3) =< -V_i_0+V_len
it(15) =< aux(3)

  with precondition: [B=3,V_again_1>=0,V_i_0>=V_again_1,V_len>=V_i_0+2] 

* Chain [18]: 0
  with precondition: [B=2,E=V_again_2,V_again_1=C,V_again_1=D,V_i_0=F,V_again_1>=0,V_i_0>=V_again_1,V_i_0+1>=V_len] 

* Chain [17]: 0
  with precondition: [B=3,V_again_1>=0,V_i_0>=V_again_1] 


#### Cost of chains of eval_real2_bb1_in(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B,C,D,E,F):
* Chain [[19]]...: 3*it(19)+0
  with precondition: [V_again_0>=1,V_len>=2] 

* Chain [[19],28]: 3*it(19)+0
  with precondition: [B=4,C=0,D=0,E=0,V_len=F+1,V_again_0>=1,V_len>=2] 

* Chain [[19],27]: 3*it(19)+0
  with precondition: [B=3,V_again_0>=1,V_len>=2] 

* Chain [[19],24]: 3*it(19)+0
  with precondition: [B=3,V_again_0>=1,V_len>=2] 

* Chain [[19],23]: 3*it(19)+2*s(9)+0
  Such that:s(8) =< V_len
s(9) =< s(8)

  with precondition: [B=3,V_again_0>=1,V_len>=2] 

* Chain [27]: 0
  with precondition: [B=3,V_again_0>=0] 

* Chain [24]: 0
  with precondition: [B=3,V_again_0>=1] 

* Chain [23]: 2*s(9)+0
  Such that:s(8) =< V_len
s(9) =< s(8)

  with precondition: [B=3,V_again_0>=1,V_len>=2] 

* Chain [21,28]: 1
  with precondition: [V_again_0=1,B=4,C=0,D=0,F=0,V_again_2=E,1>=V_len] 

* Chain [21,27]: 1
  with precondition: [V_again_0=1,B=3,1>=V_len] 


#### Cost of chains of eval_real2_bb1_in_loop_cont(A,B,C,D,E,F,G):
* Chain [30]: 0
  with precondition: [A=3] 

* Chain [29]: 0
  with precondition: [A=4] 


#### Cost of chains of eval_real2_8(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B):
* Chain [34]: 0
  with precondition: [] 

* Chain [33]: 1
  with precondition: [1>=V_len] 

* Chain [32]: 4*s(18)+12*s(19)+0
  Such that:s(17) =< V_len
s(18) =< s(17)

  with precondition: [V_len>=2] 

* Chain [31]...: 1*aux(7)+0
  with precondition: [V_len>=2] 


#### Cost of chains of eval_real2_start(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B):
* Chain [38]: 0
  with precondition: [] 

* Chain [37]: 1
  with precondition: [1>=V_len] 

* Chain [36]: 4*s(24)+12*s(25)+0
  Such that:s(23) =< V_len
s(24) =< s(23)

  with precondition: [V_len>=2] 

* Chain [35]...: 1*s(26)+0
  with precondition: [V_len>=2] 


Closed-form bounds of eval_real2_start(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B): 
-------------------------------------
* Chain [38] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [37] with precondition: [1>=V_len] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [36] with precondition: [V_len>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [35]... with precondition: [V_len>=2] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_real2_start(V_again_0,V_again_1,V_again_2,V_i_0,V_len,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 420 ms.