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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_rank2_10/6,eval_rank2_11/6,eval_rank2_bb3_in/6,eval_rank2_bb4_in/6,eval_rank2_bb5_in/6]
1. recursive  : [eval_rank2_15/15,eval_rank2_16/15,eval_rank2_17/15,eval_rank2_18/15,eval_rank2__critedge_in/15,eval_rank2_bb1_in/15,eval_rank2_bb2_in/15,eval_rank2_bb3_in_loop_cont/16]
2. non_recursive  : [eval_rank2_stop/9]
3. non_recursive  : [eval_rank2_bb6_in/9]
4. non_recursive  : [exit_location/1]
5. non_recursive  : [eval_rank2_bb1_in_loop_cont/10]
6. non_recursive  : [eval_rank2_6/9]
7. non_recursive  : [eval_rank2_5/9]
8. non_recursive  : [eval_rank2_4/9]
9. non_recursive  : [eval_rank2_3/9]
10. non_recursive  : [eval_rank2_2/9]
11. non_recursive  : [eval_rank2_1/9]
12. non_recursive  : [eval_rank2_0/9]
13. non_recursive  : [eval_rank2_bb0_in/9]
14. non_recursive  : [eval_rank2_start/9]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_rank2_bb3_in/6
1. SCC is partially evaluated into eval_rank2_bb1_in/15
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_rank2_bb1_in_loop_cont/10
6. SCC is partially evaluated into eval_rank2_6/9
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 partially evaluated into eval_rank2_start/9

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

### Specialization of cost equations eval_rank2_bb3_in/6 
* CE 12 is refined into CE [13] 
* CE 9 is refined into CE [14] 
* CE 11 is refined into CE [15] 
* CE 10 is refined into CE [16] 


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

### Ranking functions of CR eval_rank2_bb3_in(V_1,V_4,V_y_1,B,C,D) 
* RF of phase [13]: [-V_1+V_y_1+1,V_y_1]

#### Partial ranking functions of CR eval_rank2_bb3_in(V_1,V_4,V_y_1,B,C,D) 
* Partial RF of phase [13]:
  - RF of loop [13:1]:
    -V_1+V_y_1+1
    V_y_1


### Specialization of cost equations eval_rank2_bb1_in/15 
* CE 5 is refined into CE [17] 
* CE 3 is refined into CE [18,19] 
* CE 6 is refined into CE [20] 
* CE 4 is refined into CE [21,22,23,24] 


### Cost equations --> "Loop" of eval_rank2_bb1_in/15 
* CEs [24] --> Loop 17 
* CEs [23] --> Loop 18 
* CEs [21] --> Loop 19 
* CEs [22] --> Loop 20 
* CEs [17] --> Loop 21 
* CEs [19] --> Loop 22 
* CEs [18] --> Loop 23 
* CEs [20] --> Loop 24 

### Ranking functions of CR eval_rank2_bb1_in(V_1,V_4,V_7,V_8,V_x_0,V_y_0,V_y_1,B,C,D,E,F,G,H,I) 
* RF of phase [17,18,20]: [V_x_0/2-1/2]

#### Partial ranking functions of CR eval_rank2_bb1_in(V_1,V_4,V_7,V_8,V_x_0,V_y_0,V_y_1,B,C,D,E,F,G,H,I) 
* Partial RF of phase [17,18,20]:
  - RF of loop [17:1,18:1,20:1]:
    V_x_0/2-1/2


### Specialization of cost equations eval_rank2_bb1_in_loop_cont/10 
* CE 7 is refined into CE [25] 
* CE 8 is refined into CE [26] 


### Cost equations --> "Loop" of eval_rank2_bb1_in_loop_cont/10 
* CEs [25] --> Loop 25 
* CEs [26] --> Loop 26 

### Ranking functions of CR eval_rank2_bb1_in_loop_cont(A,B,C,D,E,F,G,H,I,J) 

#### Partial ranking functions of CR eval_rank2_bb1_in_loop_cont(A,B,C,D,E,F,G,H,I,J) 


### Specialization of cost equations eval_rank2_6/9 
* CE 2 is refined into CE [27,28,29,30,31,32] 


### Cost equations --> "Loop" of eval_rank2_6/9 
* CEs [30] --> Loop 27 
* CEs [28,29,32] --> Loop 28 
* CEs [31] --> Loop 29 
* CEs [27] --> Loop 30 

### Ranking functions of CR eval_rank2_6(V_1,V_4,V_7,V_8,V_m,V_x_0,V_y_0,V_y_1,B) 

#### Partial ranking functions of CR eval_rank2_6(V_1,V_4,V_7,V_8,V_m,V_x_0,V_y_0,V_y_1,B) 


### Specialization of cost equations eval_rank2_start/9 
* CE 1 is refined into CE [33,34,35,36] 


### Cost equations --> "Loop" of eval_rank2_start/9 
* CEs [36] --> Loop 31 
* CEs [35] --> Loop 32 
* CEs [34] --> Loop 33 
* CEs [33] --> Loop 34 

### Ranking functions of CR eval_rank2_start(V_1,V_4,V_7,V_8,V_m,V_x_0,V_y_0,V_y_1,B) 

#### Partial ranking functions of CR eval_rank2_start(V_1,V_4,V_7,V_8,V_m,V_x_0,V_y_0,V_y_1,B) 


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

#### Cost of chains of eval_rank2_bb3_in(V_1,V_4,V_y_1,B,C,D):
* Chain [[13],16]: 1*it(13)+0
  Such that:it(13) =< -V_1+V_y_1+1

  with precondition: [B=2,V_1=D+1,V_1>=1,C>=1,V_y_1>=V_1] 

* Chain [[13],15]: 1*it(13)+0
  Such that:it(13) =< V_y_1-D

  with precondition: [B=2,0>=C,V_1>=1,D>=V_1,V_y_1>=D+1] 

* Chain [[13],14]: 1*it(13)+0
  Such that:it(13) =< -V_1+V_y_1+1

  with precondition: [B=3,V_1>=1,V_y_1>=V_1] 

* Chain [16]: 0
  with precondition: [B=2,C=V_4,V_y_1=D,V_1>=1,V_1>=V_y_1+1] 

* Chain [15]: 0
  with precondition: [B=2,V_y_1=D,0>=C,V_1>=1,V_y_1>=V_1] 

* Chain [14]: 0
  with precondition: [B=3,V_1>=1] 


#### Cost of chains of eval_rank2_bb1_in(V_1,V_4,V_7,V_8,V_x_0,V_y_0,V_y_1,B,C,D,E,F,G,H,I):
* Chain [[17,18,20],24]: 2*it(17)+1*it(20)+2*s(5)+0
  Such that:aux(5) =< V_x_0/2
aux(6) =< V_x_0/2+V_y_0
it(17) =< aux(5)
it(20) =< aux(5)
s(5) =< aux(6)
it(20) =< aux(6)

  with precondition: [B=3,V_x_0>=2,V_y_0>=0] 

* Chain [[17,18,20],23]: 2*it(17)+1*it(20)+2*s(5)+0
  Such that:aux(7) =< V_x_0/2
aux(8) =< V_x_0/2+V_y_0
it(17) =< aux(7)
it(20) =< aux(7)
s(5) =< aux(8)
it(20) =< aux(8)

  with precondition: [B=3,V_x_0>=4,V_y_0>=0] 

* Chain [[17,18,20],22]: 2*it(17)+1*it(20)+3*s(5)+0
  Such that:aux(9) =< V_x_0/2
aux(10) =< V_x_0/2+V_y_0
s(5) =< aux(10)
it(17) =< aux(9)
it(20) =< aux(9)
it(20) =< aux(10)

  with precondition: [B=3,V_x_0>=4,V_y_0>=0] 

* Chain [[17,18,20],21]: 2*it(17)+1*it(20)+2*s(5)+0
  Such that:aux(1) =< V_x_0/2
aux(2) =< V_x_0/2+V_y_0
aux(3) =< V_x_0/2+V_y_0-E/2-H
aux(4) =< V_x_0/2-E/2
it(17) =< aux(1)
it(20) =< aux(1)
s(5) =< aux(2)
it(20) =< aux(3)
s(5) =< aux(3)
it(17) =< aux(4)
it(20) =< aux(4)

  with precondition: [B=4,C=E+1,C=G+1,F=H,C+F=I+1,2>=C,V_y_0>=0,C>=1,F>=0,V_x_0>=C+1,V_x_0+2*V_y_0+1>=2*F+C] 

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

* Chain [23]: 0
  with precondition: [B=3,V_x_0>=2] 

* Chain [22]: 1*s(7)+0
  Such that:s(7) =< V_y_0+1

  with precondition: [B=3,V_x_0>=2,V_y_0>=0] 

* Chain [21]: 0
  with precondition: [B=4,C=V_1,D=V_4,E=V_7,F=V_8,H=V_y_0,I=V_y_1,V_x_0=G,1>=V_x_0] 


#### Cost of chains of eval_rank2_bb1_in_loop_cont(A,B,C,D,E,F,G,H,I,J):
* Chain [26]: 0
  with precondition: [A=3] 

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


#### Cost of chains of eval_rank2_6(V_1,V_4,V_7,V_8,V_m,V_x_0,V_y_0,V_y_1,B):
* Chain [30]: 0
  with precondition: [] 

* Chain [29]: 0
  with precondition: [1>=V_m] 

* Chain [28]: 1*s(26)+4*s(27)+2*s(28)+4*s(29)+0
  Such that:s(26) =< V_m+1
aux(15) =< V_m/2
aux(16) =< 3/2*V_m
s(27) =< aux(15)
s(28) =< aux(15)
s(29) =< aux(16)
s(28) =< aux(16)

  with precondition: [V_m>=2] 

* Chain [27]: 5*s(39)+4*s(40)+2*s(41)+0
  Such that:s(37) =< V_m/2
s(38) =< 3/2*V_m
s(39) =< s(38)
s(40) =< s(37)
s(41) =< s(37)
s(41) =< s(38)

  with precondition: [V_m>=4] 


#### Cost of chains of eval_rank2_start(V_1,V_4,V_7,V_8,V_m,V_x_0,V_y_0,V_y_1,B):
* Chain [34]: 0
  with precondition: [] 

* Chain [33]: 0
  with precondition: [1>=V_m] 

* Chain [32]: 1*s(42)+4*s(45)+2*s(46)+4*s(47)+0
  Such that:s(42) =< V_m+1
s(43) =< V_m/2
s(44) =< 3/2*V_m
s(45) =< s(43)
s(46) =< s(43)
s(47) =< s(44)
s(46) =< s(44)

  with precondition: [V_m>=2] 

* Chain [31]: 5*s(50)+4*s(51)+2*s(52)+0
  Such that:s(48) =< V_m/2
s(49) =< 3/2*V_m
s(50) =< s(49)
s(51) =< s(48)
s(52) =< s(48)
s(52) =< s(49)

  with precondition: [V_m>=4] 


Closed-form bounds of eval_rank2_start(V_1,V_4,V_7,V_8,V_m,V_x_0,V_y_0,V_y_1,B): 
-------------------------------------
* Chain [34] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [33] with precondition: [1>=V_m] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [32] with precondition: [V_m>=2] 
    - Upper bound: 10*V_m+1 
    - Complexity: n 
* Chain [31] with precondition: [V_m>=4] 
    - Upper bound: 21/2*V_m 
    - Complexity: n 

### Maximum cost of eval_rank2_start(V_1,V_4,V_7,V_8,V_m,V_x_0,V_y_0,V_y_1,B): nat(V_m/2)*6+nat(3/2*V_m)*4+max([nat(3/2*V_m),nat(V_m+1)]) 
Asymptotic class: n 
* Total analysis performed in 577 ms.