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

#### Computed strongly connected components 
0. non_recursive  : [eval_foo_stop/9]
1. non_recursive  : [eval_foo_20/9]
2. non_recursive  : [eval_foo_19/9]
3. non_recursive  : [eval_foo_bb11_in/9]
4. non_recursive  : [eval_foo_18/9]
5. non_recursive  : [eval_foo_17/9]
6. non_recursive  : [eval_foo_bb10_in/9]
7. recursive  : [eval_foo_bb4_in/7,eval_foo_bb5_in/7]
8. recursive  : [eval_foo_bb6_in/3,eval_foo_bb7_in/3]
9. non_recursive  : [eval_foo_bb8_in/9]
10. non_recursive  : [exit_location/1]
11. non_recursive  : [eval_foo_bb6_in_loop_cont/10]
12. non_recursive  : [eval_foo_bb4_in_loop_cont/10]
13. non_recursive  : [eval_foo_9/9]
14. non_recursive  : [eval_foo_8/9]
15. non_recursive  : [eval_foo_7/9]
16. non_recursive  : [eval_foo_6/9]
17. non_recursive  : [eval_foo_5/9]
18. non_recursive  : [eval_foo_4/9]
19. non_recursive  : [eval_foo_bb3_in/9]
20. non_recursive  : [eval_foo_16/9]
21. non_recursive  : [eval_foo_15/9]
22. non_recursive  : [eval_foo_bb9_in/9]
23. non_recursive  : [eval_foo_bb2_in/9]
24. non_recursive  : [eval_foo_bb1_in/9]
25. non_recursive  : [eval_foo_3/9]
26. non_recursive  : [eval_foo_2/9]
27. non_recursive  : [eval_foo_1/9]
28. non_recursive  : [eval_foo_0/9]
29. non_recursive  : [eval_foo_bb0_in/9]
30. non_recursive  : [eval_foo_start/9]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
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 completely evaluated into other SCCs
5. SCC is completely evaluated into other SCCs
6. SCC is completely evaluated into other SCCs
7. SCC is partially evaluated into eval_foo_bb4_in/7
8. SCC is partially evaluated into eval_foo_bb6_in/3
9. SCC is completely evaluated into other SCCs
10. SCC is completely evaluated into other SCCs
11. SCC is partially evaluated into eval_foo_bb6_in_loop_cont/10
12. SCC is partially evaluated into eval_foo_bb4_in_loop_cont/10
13. SCC is partially evaluated into eval_foo_9/9
14. SCC is completely evaluated into other SCCs
15. SCC is completely evaluated into other SCCs
16. SCC is partially evaluated into eval_foo_6/9
17. SCC is completely evaluated into other SCCs
18. SCC is completely evaluated into other SCCs
19. SCC is completely evaluated into other SCCs
20. SCC is completely evaluated into other SCCs
21. SCC is completely evaluated into other SCCs
22. SCC is completely evaluated into other SCCs
23. SCC is partially evaluated into eval_foo_bb2_in/9
24. SCC is partially evaluated into eval_foo_bb1_in/9
25. SCC is partially evaluated into eval_foo_3/9
26. SCC is completely evaluated into other SCCs
27. SCC is completely evaluated into other SCCs
28. SCC is completely evaluated into other SCCs
29. SCC is completely evaluated into other SCCs
30. SCC is partially evaluated into eval_foo_start/9

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

### Specialization of cost equations eval_foo_bb4_in/7 
* CE 12 is refined into CE [21] 
* CE 13 is refined into CE [22] 
* CE 11 is refined into CE [23] 


### Cost equations --> "Loop" of eval_foo_bb4_in/7 
* CEs [23] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [21] --> Loop 23 

### Ranking functions of CR eval_foo_bb4_in(V_x_1,V_y_0,V_z_0,B,C,D,E) 
* RF of phase [21]: [V_y_0]

#### Partial ranking functions of CR eval_foo_bb4_in(V_x_1,V_y_0,V_z_0,B,C,D,E) 
* Partial RF of phase [21]:
  - RF of loop [21:1]:
    V_y_0


### Specialization of cost equations eval_foo_bb6_in/3 
* CE 18 is refined into CE [24] 
* CE 17 is refined into CE [25] 
* CE 16 is refined into CE [26] 


### Cost equations --> "Loop" of eval_foo_bb6_in/3 
* CEs [26] --> Loop 24 
* CEs [24] --> Loop 25 
* CEs [25] --> Loop 26 

### Ranking functions of CR eval_foo_bb6_in(V_z_0,B,C) 
* RF of phase [24]: [V_z_0]

#### Partial ranking functions of CR eval_foo_bb6_in(V_z_0,B,C) 
* Partial RF of phase [24]:
  - RF of loop [24:1]:
    V_z_0


### Specialization of cost equations eval_foo_bb6_in_loop_cont/10 
* CE 20 is refined into CE [27] 
* CE 19 is refined into CE [28] 


### Cost equations --> "Loop" of eval_foo_bb6_in_loop_cont/10 
* CEs [27] --> Loop 27 
* CEs [28] --> Loop 28 

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

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


### Specialization of cost equations eval_foo_bb4_in_loop_cont/10 
* CE 15 is refined into CE [29,30,31,32] 
* CE 14 is refined into CE [33] 


### Cost equations --> "Loop" of eval_foo_bb4_in_loop_cont/10 
* CEs [31] --> Loop 29 
* CEs [29,32] --> Loop 30 
* CEs [30] --> Loop 31 
* CEs [33] --> Loop 32 

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

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


### Specialization of cost equations eval_foo_9/9 
* CE 10 is refined into CE [34,35,36,37,38,39,40] 


### Cost equations --> "Loop" of eval_foo_9/9 
* CEs [38,39,40] --> Loop 33 
* CEs [37] --> Loop 34 
* CEs [35] --> Loop 35 
* CEs [36] --> Loop 36 
* CEs [34] --> Loop 37 

### Ranking functions of CR eval_foo_9(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 

#### Partial ranking functions of CR eval_foo_9(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 


### Specialization of cost equations eval_foo_6/9 
* CE 8 is refined into CE [41,42,43,44,45] 
* CE 9 is refined into CE [46,47,48,49,50] 


### Cost equations --> "Loop" of eval_foo_6/9 
* CEs [45] --> Loop 38 
* CEs [44] --> Loop 39 
* CEs [50] --> Loop 40 
* CEs [49] --> Loop 41 
* CEs [43] --> Loop 42 
* CEs [42] --> Loop 43 
* CEs [48] --> Loop 44 
* CEs [47] --> Loop 45 
* CEs [46] --> Loop 46 
* CEs [41] --> Loop 47 

### Ranking functions of CR eval_foo_6(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 

#### Partial ranking functions of CR eval_foo_6(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 


### Specialization of cost equations eval_foo_bb2_in/9 
* CE 6 is refined into CE [51,52,53,54,55,56,57,58,59,60] 
* CE 7 is refined into CE [61] 


### Cost equations --> "Loop" of eval_foo_bb2_in/9 
* CEs [58,60] --> Loop 48 
* CEs [57,59] --> Loop 49 
* CEs [61] --> Loop 50 
* CEs [56] --> Loop 51 
* CEs [54] --> Loop 52 
* CEs [53,55] --> Loop 53 
* CEs [52] --> Loop 54 
* CEs [51] --> Loop 55 

### Ranking functions of CR eval_foo_bb2_in(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 

#### Partial ranking functions of CR eval_foo_bb2_in(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 


### Specialization of cost equations eval_foo_bb1_in/9 
* CE 4 is refined into CE [62,63,64,65,66,67,68,69] 
* CE 5 is refined into CE [70] 


### Cost equations --> "Loop" of eval_foo_bb1_in/9 
* CEs [69] --> Loop 56 
* CEs [68] --> Loop 57 
* CEs [67] --> Loop 58 
* CEs [70] --> Loop 59 
* CEs [66] --> Loop 60 
* CEs [65] --> Loop 61 
* CEs [64] --> Loop 62 
* CEs [63] --> Loop 63 
* CEs [62] --> Loop 64 

### Ranking functions of CR eval_foo_bb1_in(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 

#### Partial ranking functions of CR eval_foo_bb1_in(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 


### Specialization of cost equations eval_foo_3/9 
* CE 2 is refined into CE [71,72,73,74,75,76,77,78,79] 
* CE 3 is refined into CE [80] 


### Cost equations --> "Loop" of eval_foo_3/9 
* CEs [79] --> Loop 65 
* CEs [78] --> Loop 66 
* CEs [80] --> Loop 67 
* CEs [77] --> Loop 68 
* CEs [76] --> Loop 69 
* CEs [75] --> Loop 70 
* CEs [74] --> Loop 71 
* CEs [73] --> Loop 72 
* CEs [72] --> Loop 73 
* CEs [71] --> Loop 74 

### Ranking functions of CR eval_foo_3(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 

#### Partial ranking functions of CR eval_foo_3(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 


### Specialization of cost equations eval_foo_start/9 
* CE 1 is refined into CE [81,82,83,84,85,86,87,88,89,90] 


### Cost equations --> "Loop" of eval_foo_start/9 
* CEs [90] --> Loop 75 
* CEs [89] --> Loop 76 
* CEs [88] --> Loop 77 
* CEs [87] --> Loop 78 
* CEs [86] --> Loop 79 
* CEs [85] --> Loop 80 
* CEs [84] --> Loop 81 
* CEs [83] --> Loop 82 
* CEs [82] --> Loop 83 
* CEs [81] --> Loop 84 

### Ranking functions of CR eval_foo_start(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 

#### Partial ranking functions of CR eval_foo_start(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B) 


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

#### Cost of chains of eval_foo_bb4_in(V_x_1,V_y_0,V_z_0,B,C,D,E):
* Chain [[21],23]: 1*it(21)+0
  Such that:it(21) =< -V_x_1/2+C/2

  with precondition: [B=4,D=0,V_x_1+2*V_y_0=C,V_x_1+2*V_y_0=E,V_x_1>=0,V_y_0>=1] 

* Chain [[21],22]: 1*it(21)+0
  Such that:it(21) =< V_y_0

  with precondition: [B=3,V_x_1>=0,V_y_0>=1] 

* Chain [23]: 0
  with precondition: [V_y_0=0,B=4,D=0,V_x_1=C,V_x_1=E,V_x_1>=0] 

* Chain [22]: 0
  with precondition: [B=3,V_x_1>=0,V_y_0>=0] 


#### Cost of chains of eval_foo_bb6_in(V_z_0,B,C):
* Chain [[24],26]: 1*it(24)+0
  Such that:it(24) =< V_z_0

  with precondition: [B=2,C=0,V_z_0>=1] 

* Chain [[24],25]: 1*it(24)+0
  Such that:it(24) =< V_z_0

  with precondition: [B=3,V_z_0>=1] 

* Chain [26]: 0
  with precondition: [B=2,V_z_0=C,0>=V_z_0] 

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


#### Cost of chains of eval_foo_bb6_in_loop_cont(A,B,C,D,E,F,G,H,I,J):
* Chain [28]: 0
  with precondition: [A=2,C>=0,D>=0,E>=0,F>=0,C+E>=D] 

* Chain [27]: 0
  with precondition: [A=3,C>=0,D>=0,E>=0,F>=0,C+E>=D] 


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

* Chain [31]: 0
  with precondition: [A=4,0>=I,C>=0,D>=0,E>=0,F>=0,C+E>=D] 

* Chain [30]: 2*s(1)+0
  Such that:aux(1) =< I
s(1) =< aux(1)

  with precondition: [A=4,C>=0,D>=0,E>=0,F>=0,I>=1,C+E>=D] 

* Chain [29]: 0
  with precondition: [A=4,C>=0,D>=0,E>=0,F>=0,C+E>=D] 


#### Cost of chains of eval_foo_9(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B):
* Chain [37]: 0
  with precondition: [V_m1_m2=0,V_n=0,V_m1>=0,V_m2>=0] 

* Chain [36]: 0
  with precondition: [V_n=0,V_m1>=0,V_m1_m2>=0,V_m2>=0,V_m1+V_m2>=V_m1_m2] 

* Chain [35]: 2*s(4)+0
  Such that:s(3) =< V_m1_m2
s(4) =< s(3)

  with precondition: [V_n=0,V_m1>=0,V_m1_m2>=1,V_m2>=0,V_m1+V_m2>=V_m1_m2] 

* Chain [34]: 0
  with precondition: [V_m1>=0,V_m1_m2>=0,V_m2>=0,V_n>=0,V_m1+V_m2>=V_m1_m2] 

* Chain [33]: 3*s(5)+2*s(8)+0
  Such that:s(7) =< V_m1_m2+2*V_n
aux(2) =< V_n
s(5) =< aux(2)
s(8) =< s(7)

  with precondition: [V_m1>=0,V_m1_m2>=0,V_m2>=0,V_n>=1,V_m1+V_m2>=V_m1_m2] 


#### Cost of chains of eval_foo_6(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B):
* Chain [47]: 0
  with precondition: [V_m1=0,V_n=0,V_3>=1,V_m2>=0] 

* Chain [46]: 0
  with precondition: [V_m2=0,V_n=0,0>=V_3,V_m1>=0] 

* Chain [45]: 0
  with precondition: [V_n=0,0>=V_3,V_m1>=0,V_m2>=0] 

* Chain [44]: 2*s(11)+0
  Such that:s(10) =< V_m2
s(11) =< s(10)

  with precondition: [V_n=0,0>=V_3,V_m1>=0,V_m2>=1] 

* Chain [43]: 0
  with precondition: [V_n=0,V_3>=1,V_m1>=0,V_m2>=0] 

* Chain [42]: 2*s(13)+0
  Such that:s(12) =< V_m1
s(13) =< s(12)

  with precondition: [V_n=0,V_3>=1,V_m1>=1,V_m2>=0] 

* Chain [41]: 0
  with precondition: [0>=V_3,V_m1>=0,V_m2>=0,V_n>=0] 

* Chain [40]: 3*s(16)+2*s(17)+0
  Such that:s(14) =< V_m2+2*V_n
s(15) =< V_n
s(16) =< s(15)
s(17) =< s(14)

  with precondition: [0>=V_3,V_m1>=0,V_m2>=0,V_n>=1] 

* Chain [39]: 0
  with precondition: [V_3>=1,V_m1>=0,V_m2>=0,V_n>=0] 

* Chain [38]: 3*s(20)+2*s(21)+0
  Such that:s(18) =< V_m1+2*V_n
s(19) =< V_n
s(20) =< s(19)
s(21) =< s(18)

  with precondition: [V_3>=1,V_m1>=0,V_m2>=0,V_n>=1] 


#### Cost of chains of eval_foo_bb2_in(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B):
* Chain [55]: 0
  with precondition: [V_m1=0,V_n=0,V_m2>=0] 

* Chain [54]: 0
  with precondition: [V_m2=0,V_n=0,V_m1>=0] 

* Chain [53]: 0
  with precondition: [V_n=0,V_m1>=0,V_m2>=0] 

* Chain [52]: 2*s(23)+0
  Such that:s(22) =< V_m2
s(23) =< s(22)

  with precondition: [V_n=0,V_m1>=0,V_m2>=1] 

* Chain [51]: 2*s(25)+0
  Such that:s(24) =< V_m1
s(25) =< s(24)

  with precondition: [V_n=0,V_m1>=1,V_m2>=0] 

* Chain [50]: 0
  with precondition: [0>=V_m2+1,V_m1>=0,V_n>=0] 

* Chain [49]: 0
  with precondition: [V_m1>=0,V_m2>=0,V_n>=0] 

* Chain [48]: 6*s(28)+2*s(29)+2*s(33)+0
  Such that:s(30) =< V_m1+2*V_n
s(26) =< V_m2+2*V_n
aux(3) =< V_n
s(28) =< aux(3)
s(33) =< s(30)
s(29) =< s(26)

  with precondition: [V_m1>=0,V_m2>=0,V_n>=1] 


#### Cost of chains of eval_foo_bb1_in(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B):
* Chain [64]: 0
  with precondition: [V_m1=0,V_n=0,V_m2>=0] 

* Chain [63]: 0
  with precondition: [V_m2=0,V_n=0,V_m1>=0] 

* Chain [62]: 0
  with precondition: [V_n=0,V_m1>=0,V_m2>=0] 

* Chain [61]: 2*s(35)+0
  Such that:s(34) =< V_m2
s(35) =< s(34)

  with precondition: [V_n=0,V_m1>=0,V_m2>=1] 

* Chain [60]: 2*s(37)+0
  Such that:s(36) =< V_m1
s(37) =< s(36)

  with precondition: [V_n=0,V_m1>=1,V_m2>=0] 

* Chain [59]: 0
  with precondition: [0>=V_m1+1,V_n>=0] 

* Chain [58]: 0
  with precondition: [0>=V_m2+1,V_m1>=0,V_n>=0] 

* Chain [57]: 0
  with precondition: [V_m1>=0,V_m2>=0,V_n>=0] 

* Chain [56]: 6*s(41)+2*s(42)+2*s(43)+0
  Such that:s(38) =< V_m1+2*V_n
s(39) =< V_m2+2*V_n
s(40) =< V_n
s(41) =< s(40)
s(42) =< s(38)
s(43) =< s(39)

  with precondition: [V_m1>=0,V_m2>=0,V_n>=1] 


#### Cost of chains of eval_foo_3(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B):
* Chain [74]: 0
  with precondition: [V_m1=0,V_n=0,V_m2>=0] 

* Chain [73]: 0
  with precondition: [V_m2=0,V_n=0,V_m1>=0] 

* Chain [72]: 0
  with precondition: [V_n=0,V_m1>=0,V_m2>=0] 

* Chain [71]: 2*s(45)+0
  Such that:s(44) =< V_m2
s(45) =< s(44)

  with precondition: [V_n=0,V_m1>=0,V_m2>=1] 

* Chain [70]: 2*s(47)+0
  Such that:s(46) =< V_m1
s(47) =< s(46)

  with precondition: [V_n=0,V_m1>=1,V_m2>=0] 

* Chain [69]: 0
  with precondition: [0>=V_m1+1,V_n>=0] 

* Chain [68]: 0
  with precondition: [0>=V_m2+1,V_m1>=0,V_n>=0] 

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

* Chain [66]: 0
  with precondition: [V_m1>=0,V_m2>=0,V_n>=0] 

* Chain [65]: 6*s(51)+2*s(52)+2*s(53)+0
  Such that:s(48) =< V_m1+2*V_n
s(49) =< V_m2+2*V_n
s(50) =< V_n
s(51) =< s(50)
s(52) =< s(48)
s(53) =< s(49)

  with precondition: [V_m1>=0,V_m2>=0,V_n>=1] 


#### Cost of chains of eval_foo_start(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B):
* Chain [84]: 0
  with precondition: [V_m1=0,V_n=0,V_m2>=0] 

* Chain [83]: 0
  with precondition: [V_m2=0,V_n=0,V_m1>=0] 

* Chain [82]: 0
  with precondition: [V_n=0,V_m1>=0,V_m2>=0] 

* Chain [81]: 2*s(55)+0
  Such that:s(54) =< V_m2
s(55) =< s(54)

  with precondition: [V_n=0,V_m1>=0,V_m2>=1] 

* Chain [80]: 2*s(57)+0
  Such that:s(56) =< V_m1
s(57) =< s(56)

  with precondition: [V_n=0,V_m1>=1,V_m2>=0] 

* Chain [79]: 0
  with precondition: [0>=V_m1+1,V_n>=0] 

* Chain [78]: 0
  with precondition: [0>=V_m2+1,V_m1>=0,V_n>=0] 

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

* Chain [76]: 0
  with precondition: [V_m1>=0,V_m2>=0,V_n>=0] 

* Chain [75]: 6*s(61)+2*s(62)+2*s(63)+0
  Such that:s(58) =< V_m1+2*V_n
s(59) =< V_m2+2*V_n
s(60) =< V_n
s(61) =< s(60)
s(62) =< s(58)
s(63) =< s(59)

  with precondition: [V_m1>=0,V_m2>=0,V_n>=1] 


Closed-form bounds of eval_foo_start(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B): 
-------------------------------------
* Chain [84] with precondition: [V_m1=0,V_n=0,V_m2>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [83] with precondition: [V_m2=0,V_n=0,V_m1>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [82] with precondition: [V_n=0,V_m1>=0,V_m2>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [81] with precondition: [V_n=0,V_m1>=0,V_m2>=1] 
    - Upper bound: 2*V_m2 
    - Complexity: n 
* Chain [80] with precondition: [V_n=0,V_m1>=1,V_m2>=0] 
    - Upper bound: 2*V_m1 
    - Complexity: n 
* Chain [79] with precondition: [0>=V_m1+1,V_n>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [78] with precondition: [0>=V_m2+1,V_m1>=0,V_n>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [77] with precondition: [0>=V_n+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [76] with precondition: [V_m1>=0,V_m2>=0,V_n>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [75] with precondition: [V_m1>=0,V_m2>=0,V_n>=1] 
    - Upper bound: 2*V_m1+2*V_m2+14*V_n 
    - Complexity: n 

### Maximum cost of eval_foo_start(V_3,V_m1,V_m1_m2,V_m2,V_n,V_x_1,V_y_0,V_z_0,B): max([nat(V_m1)*2,nat(V_m2)*2,nat(V_m1+2*V_n)*2+nat(V_n)*6+nat(V_m2+2*V_n)*2]) 
Asymptotic class: n 
* Total analysis performed in 247 ms.

