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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [f30/4]
1. non_recursive  : [exit_location/1]
2. recursive  : [f70/4]
3. recursive  : [f110/4]
4. recursive  : [f150/4]
5. recursive  : [f190/4]
6. non_recursive  : [f207/31]
7. non_recursive  : [f190_loop_cont/32]
8. non_recursive  : [f187/31]
9. non_recursive  : [f181/31]
10. non_recursive  : [f178/31]
11. non_recursive  : [f166/31]
12. non_recursive  : [f150_loop_cont/32]
13. non_recursive  : [f147/31]
14. non_recursive  : [f141/31]
15. non_recursive  : [f138/31]
16. non_recursive  : [f126/31]
17. non_recursive  : [f110_loop_cont/32]
18. non_recursive  : [f107/31]
19. non_recursive  : [f101/31]
20. non_recursive  : [f98/31]
21. non_recursive  : [f86/31]
22. non_recursive  : [f70_loop_cont/32]
23. non_recursive  : [f67/31]
24. non_recursive  : [f61/31]
25. non_recursive  : [f58/31]
26. non_recursive  : [f46/31]
27. non_recursive  : [f30_loop_cont/32]
28. non_recursive  : [f27/31]
29. non_recursive  : [f21/31]
30. non_recursive  : [f18/31]
31. non_recursive  : [f0/31]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f30/4
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f70/4
3. SCC is partially evaluated into f110/4
4. SCC is partially evaluated into f150/4
5. SCC is partially evaluated into f190/4
6. SCC is completely evaluated into other SCCs
7. SCC is partially evaluated into f190_loop_cont/32
8. SCC is partially evaluated into f187/31
9. SCC is partially evaluated into f181/31
10. SCC is partially evaluated into f178/31
11. SCC is partially evaluated into f166/31
12. SCC is partially evaluated into f150_loop_cont/32
13. SCC is partially evaluated into f147/31
14. SCC is partially evaluated into f141/31
15. SCC is partially evaluated into f138/31
16. SCC is partially evaluated into f126/31
17. SCC is partially evaluated into f110_loop_cont/32
18. SCC is partially evaluated into f107/31
19. SCC is partially evaluated into f101/31
20. SCC is partially evaluated into f98/31
21. SCC is partially evaluated into f86/31
22. SCC is partially evaluated into f70_loop_cont/32
23. SCC is partially evaluated into f67/31
24. SCC is partially evaluated into f61/31
25. SCC is partially evaluated into f58/31
26. SCC is partially evaluated into f46/31
27. SCC is partially evaluated into f30_loop_cont/32
28. SCC is partially evaluated into f27/31
29. SCC is partially evaluated into f21/31
30. SCC is partially evaluated into f18/31
31. SCC is partially evaluated into f0/31

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

### Specialization of cost equations f30/4 
* CE 17 is refined into CE [76] 
* CE 18 is refined into CE [77] 
* CE 16 is refined into CE [78] 


### Cost equations --> "Loop" of f30/4 
* CEs [78] --> Loop 66 
* CEs [76] --> Loop 67 
* CEs [77] --> Loop 68 

### Ranking functions of CR f30(A,F,E1,F1) 
* RF of phase [66]: [-F+100]

#### Partial ranking functions of CR f30(A,F,E1,F1) 
* Partial RF of phase [66]:
  - RF of loop [66:1]:
    -F+100


### Specialization of cost equations f70/4 
* CE 32 is refined into CE [79] 
* CE 33 is refined into CE [80] 
* CE 31 is refined into CE [81] 


### Cost equations --> "Loop" of f70/4 
* CEs [81] --> Loop 69 
* CEs [79] --> Loop 70 
* CEs [80] --> Loop 71 

### Ranking functions of CR f70(G,L,E1,F1) 
* RF of phase [69]: [-L+200]

#### Partial ranking functions of CR f70(G,L,E1,F1) 
* Partial RF of phase [69]:
  - RF of loop [69:1]:
    -L+200


### Specialization of cost equations f110/4 
* CE 48 is refined into CE [82] 
* CE 47 is refined into CE [83] 
* CE 46 is refined into CE [84] 


### Cost equations --> "Loop" of f110/4 
* CEs [84] --> Loop 72 
* CEs [82] --> Loop 73 
* CEs [83] --> Loop 74 

### Ranking functions of CR f110(M,R,E1,F1) 
* RF of phase [72]: [-R+50]

#### Partial ranking functions of CR f110(M,R,E1,F1) 
* Partial RF of phase [72]:
  - RF of loop [72:1]:
    -R+50


### Specialization of cost equations f150/4 
* CE 62 is refined into CE [85] 
* CE 63 is refined into CE [86] 
* CE 61 is refined into CE [87] 


### Cost equations --> "Loop" of f150/4 
* CEs [87] --> Loop 75 
* CEs [85] --> Loop 76 
* CEs [86] --> Loop 77 

### Ranking functions of CR f150(S,X,E1,F1) 
* RF of phase [75]: [-X+20]

#### Partial ranking functions of CR f150(S,X,E1,F1) 
* Partial RF of phase [75]:
  - RF of loop [75:1]:
    -X+20


### Specialization of cost equations f190/4 
* CE 72 is refined into CE [88] 
* CE 73 is refined into CE [89] 
* CE 71 is refined into CE [90] 


### Cost equations --> "Loop" of f190/4 
* CEs [90] --> Loop 78 
* CEs [88] --> Loop 79 
* CEs [89] --> Loop 80 

### Ranking functions of CR f190(Y,D1,E1,F1) 
* RF of phase [78]: [-D1+200]

#### Partial ranking functions of CR f190(Y,D1,E1,F1) 
* Partial RF of phase [78]:
  - RF of loop [78:1]:
    -D1+200


### Specialization of cost equations f190_loop_cont/32 
* CE 74 is refined into CE [91] 
* CE 75 is refined into CE [92] 


### Cost equations --> "Loop" of f190_loop_cont/32 
* CEs [91] --> Loop 81 
* CEs [92] --> Loop 82 

### Ranking functions of CR f190_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 

#### Partial ranking functions of CR f190_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 


### Specialization of cost equations f187/31 
* CE 70 is refined into CE [93,94,95] 
* CE 69 is discarded (unfeasible) 
* CE 68 is refined into CE [96] 


### Cost equations --> "Loop" of f187/31 
* CEs [93,94,95] --> Loop 83 
* CEs [96] --> Loop 84 

### Ranking functions of CR f187(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f187(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f181/31 
* CE 66 is refined into CE [97] 
* CE 67 is refined into CE [98] 


### Cost equations --> "Loop" of f181/31 
* CEs [97,98] --> Loop 85 

### Ranking functions of CR f181(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f181(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f178/31 
* CE 59 is refined into CE [99] 
* CE 58 is discarded (unfeasible) 
* CE 60 is refined into CE [100] 


### Cost equations --> "Loop" of f178/31 
* CEs [99] --> Loop 86 
* CEs [100] --> Loop 87 

### Ranking functions of CR f178(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f178(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f166/31 
* CE 53 is refined into CE [101] 
* CE 54 is refined into CE [102] 


### Cost equations --> "Loop" of f166/31 
* CEs [101,102] --> Loop 88 

### Ranking functions of CR f166(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f166(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f150_loop_cont/32 
* CE 64 is refined into CE [103] 
* CE 65 is refined into CE [104] 


### Cost equations --> "Loop" of f150_loop_cont/32 
* CEs [103] --> Loop 89 
* CEs [104] --> Loop 90 

### Ranking functions of CR f150_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 

#### Partial ranking functions of CR f150_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 


### Specialization of cost equations f147/31 
* CE 57 is refined into CE [105,106,107] 
* CE 56 is discarded (unfeasible) 
* CE 55 is refined into CE [108] 


### Cost equations --> "Loop" of f147/31 
* CEs [105,106,107] --> Loop 91 
* CEs [108] --> Loop 92 

### Ranking functions of CR f147(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f147(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f141/31 
* CE 51 is refined into CE [109] 
* CE 52 is refined into CE [110] 


### Cost equations --> "Loop" of f141/31 
* CEs [109,110] --> Loop 93 

### Ranking functions of CR f141(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f141(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f138/31 
* CE 44 is refined into CE [111] 
* CE 43 is discarded (unfeasible) 
* CE 45 is refined into CE [112] 


### Cost equations --> "Loop" of f138/31 
* CEs [111] --> Loop 94 
* CEs [112] --> Loop 95 

### Ranking functions of CR f138(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f138(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f126/31 
* CE 38 is refined into CE [113] 
* CE 39 is refined into CE [114] 


### Cost equations --> "Loop" of f126/31 
* CEs [113,114] --> Loop 96 

### Ranking functions of CR f126(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f126(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f110_loop_cont/32 
* CE 50 is refined into CE [115] 
* CE 49 is refined into CE [116] 


### Cost equations --> "Loop" of f110_loop_cont/32 
* CEs [115] --> Loop 97 
* CEs [116] --> Loop 98 

### Ranking functions of CR f110_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 

#### Partial ranking functions of CR f110_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 


### Specialization of cost equations f107/31 
* CE 42 is refined into CE [117,118,119] 
* CE 41 is discarded (unfeasible) 
* CE 40 is refined into CE [120] 


### Cost equations --> "Loop" of f107/31 
* CEs [117,118,119] --> Loop 99 
* CEs [120] --> Loop 100 

### Ranking functions of CR f107(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f107(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f101/31 
* CE 36 is refined into CE [121] 
* CE 37 is refined into CE [122] 


### Cost equations --> "Loop" of f101/31 
* CEs [121,122] --> Loop 101 

### Ranking functions of CR f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f98/31 
* CE 29 is refined into CE [123] 
* CE 28 is discarded (unfeasible) 
* CE 30 is refined into CE [124] 


### Cost equations --> "Loop" of f98/31 
* CEs [123] --> Loop 102 
* CEs [124] --> Loop 103 

### Ranking functions of CR f98(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f98(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f86/31 
* CE 23 is refined into CE [125] 
* CE 24 is refined into CE [126] 


### Cost equations --> "Loop" of f86/31 
* CEs [125,126] --> Loop 104 

### Ranking functions of CR f86(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f86(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f70_loop_cont/32 
* CE 34 is refined into CE [127] 
* CE 35 is refined into CE [128] 


### Cost equations --> "Loop" of f70_loop_cont/32 
* CEs [127] --> Loop 105 
* CEs [128] --> Loop 106 

### Ranking functions of CR f70_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 

#### Partial ranking functions of CR f70_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 


### Specialization of cost equations f67/31 
* CE 27 is refined into CE [129,130,131] 
* CE 26 is discarded (unfeasible) 
* CE 25 is refined into CE [132] 


### Cost equations --> "Loop" of f67/31 
* CEs [129,130,131] --> Loop 107 
* CEs [132] --> Loop 108 

### Ranking functions of CR f67(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f67(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f61/31 
* CE 21 is refined into CE [133] 
* CE 22 is refined into CE [134] 


### Cost equations --> "Loop" of f61/31 
* CEs [133,134] --> Loop 109 

### Ranking functions of CR f61(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f61(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f58/31 
* CE 14 is refined into CE [135] 
* CE 13 is discarded (unfeasible) 
* CE 15 is refined into CE [136] 


### Cost equations --> "Loop" of f58/31 
* CEs [135] --> Loop 110 
* CEs [136] --> Loop 111 

### Ranking functions of CR f58(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f58(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f46/31 
* CE 8 is refined into CE [137] 
* CE 9 is refined into CE [138] 


### Cost equations --> "Loop" of f46/31 
* CEs [137,138] --> Loop 112 

### Ranking functions of CR f46(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f46(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f30_loop_cont/32 
* CE 19 is refined into CE [139] 
* CE 20 is refined into CE [140] 


### Cost equations --> "Loop" of f30_loop_cont/32 
* CEs [139] --> Loop 113 
* CEs [140] --> Loop 114 

### Ranking functions of CR f30_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 

#### Partial ranking functions of CR f30_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 


### Specialization of cost equations f27/31 
* CE 12 is refined into CE [141,142,143] 
* CE 11 is discarded (unfeasible) 
* CE 10 is refined into CE [144] 


### Cost equations --> "Loop" of f27/31 
* CEs [141,142,143] --> Loop 115 
* CEs [144] --> Loop 116 

### Ranking functions of CR f27(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f27(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f21/31 
* CE 6 is refined into CE [145] 
* CE 7 is refined into CE [146] 


### Cost equations --> "Loop" of f21/31 
* CEs [145,146] --> Loop 117 

### Ranking functions of CR f21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f18/31 
* CE 4 is refined into CE [147] 
* CE 3 is discarded (unfeasible) 
* CE 5 is refined into CE [148] 


### Cost equations --> "Loop" of f18/31 
* CEs [147] --> Loop 118 
* CEs [148] --> Loop 119 

### Ranking functions of CR f18(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f18(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


### Specialization of cost equations f0/31 
* CE 1 is refined into CE [149] 
* CE 2 is refined into CE [150] 


### Cost equations --> "Loop" of f0/31 
* CEs [149,150] --> Loop 120 

### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 

#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1) 


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

#### Cost of chains of f30(A,F,E1,F1):
* Chain [[66],68]: 1*it(66)+0
  Such that:it(66) =< -F+100

  with precondition: [A=100,E1=3,99>=F,F>=0] 

* Chain [[66],67]: 1*it(66)+0
  Such that:it(66) =< -F+100

  with precondition: [A=100,E1=6,F1=100,99>=F,F>=0] 

* Chain [68]: 0
  with precondition: [A=100,E1=3,F>=0] 


#### Cost of chains of f70(G,L,E1,F1):
* Chain [[69],71]: 1*it(69)+0
  Such that:it(69) =< -L+200

  with precondition: [G=200,E1=3,199>=L,L>=0] 

* Chain [[69],70]: 1*it(69)+0
  Such that:it(69) =< -L+200

  with precondition: [G=200,E1=7,F1=200,199>=L,L>=0] 

* Chain [71]: 0
  with precondition: [G=200,E1=3,L>=0] 


#### Cost of chains of f110(M,R,E1,F1):
* Chain [[72],74]: 1*it(72)+0
  Such that:it(72) =< -R+50

  with precondition: [M=50,E1=2,F1=50,49>=R,R>=0] 

* Chain [[72],73]: 1*it(72)+0
  Such that:it(72) =< -R+50

  with precondition: [M=50,E1=3,49>=R,R>=0] 

* Chain [73]: 0
  with precondition: [M=50,E1=3,R>=0] 


#### Cost of chains of f150(S,X,E1,F1):
* Chain [[75],77]: 1*it(75)+0
  Such that:it(75) =< -X+20

  with precondition: [S=20,E1=3,19>=X,X>=0] 

* Chain [[75],76]: 1*it(75)+0
  Such that:it(75) =< -X+20

  with precondition: [S=20,E1=4,F1=20,19>=X,X>=0] 

* Chain [77]: 0
  with precondition: [S=20,E1=3,X>=0] 


#### Cost of chains of f190(Y,D1,E1,F1):
* Chain [[78],80]: 1*it(78)+0
  Such that:it(78) =< -D1+200

  with precondition: [Y=200,E1=3,199>=D1,D1>=0] 

* Chain [[78],79]: 1*it(78)+0
  Such that:it(78) =< -D1+200

  with precondition: [Y=200,E1=5,F1=200,199>=D1,D1>=0] 

* Chain [80]: 0
  with precondition: [Y=200,E1=3,D1>=0] 


#### Cost of chains of f190_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1):
* Chain [82]: 0
  with precondition: [A=3,B=100,H=200,N=50,T=20,Z=200,D=C,J=I,P=O,V=U,B1=A1,D1=C1,10>=D,10>=J,10>=P,10>=V,10>=B1,10>=D1,D>=0,J>=0,P>=0,V>=0,B1>=1,D1>=1] 

* Chain [81]: 0
  with precondition: [A=5,B=100,H=200,N=50,T=20,Z=200,D=C,J=I,P=O,V=U,B1=A1,D1=C1,10>=D,10>=J,10>=P,10>=V,10>=B1,10>=D1,D>=0,J>=0,P>=0,V>=0,B1>=1,D1>=1] 


#### Cost of chains of f187(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [84]: 0
  with precondition: [A=100,G=200,M=50,S=20,Y=200,B1=0,C=B,I=H,O=N,U=T,A1=Z,10>=C,10>=I,10>=O,10>=U,10>=A1,C>=0,I>=0,O>=0,U>=0,A1>=1] 

* Chain [83]: 400
  with precondition: [A=100,G=200,M=50,S=20,Y=200,C=B,I=H,O=N,U=T,A1=Z,10>=C,10>=I,10>=O,10>=U,10>=A1,10>=B1,C>=0,I>=0,O>=0,U>=0,A1>=1,B1>=1] 


#### Cost of chains of f181(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [85]: 400
  with precondition: [A=100,G=200,M=50,S=20,Y=200,C=B,I=H,O=N,U=T,A1=Z,10>=C,10>=I,10>=O,10>=U,10>=A1,C>=0,I>=0,O>=0,U>=0,A1>=1] 


#### Cost of chains of f178(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [87]: 0
  with precondition: [A=100,G=200,M=50,S=20,Y=200,Z=0,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,C>=0,I>=0,O>=0,U>=0] 

* Chain [86]: 400
  with precondition: [A=100,G=200,M=50,S=20,Y=200,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,10>=Z,C>=0,I>=0,O>=0,U>=0,Z>=1] 


#### Cost of chains of f166(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [88]: 400
  with precondition: [A=100,G=200,M=50,S=20,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,C>=0,I>=0,O>=0,U>=0] 


#### Cost of chains of f150_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1):
* Chain [90]: 0
  with precondition: [A=3,B=100,H=200,N=50,T=20,D=C,J=I,P=O,V=U,X=W,10>=D,10>=J,10>=P,10>=V,10>=X,D>=0,J>=0,P>=0,V>=1,X>=1] 

* Chain [89]: 400
  with precondition: [A=4,B=100,H=200,N=50,T=20,D=C,J=I,P=O,V=U,X=W,10>=D,10>=J,10>=P,10>=V,10>=X,D>=0,J>=0,P>=0,V>=1,X>=1] 


#### Cost of chains of f147(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [92]: 400
  with precondition: [A=100,G=200,M=50,S=20,V=0,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,C>=0,I>=0,O>=0,U>=1] 

* Chain [91]: 440
  with precondition: [A=100,G=200,M=50,S=20,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,10>=V,C>=0,I>=0,O>=0,U>=1,V>=1] 


#### Cost of chains of f141(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [93]: 440
  with precondition: [A=100,G=200,M=50,S=20,C=B,I=H,O=N,U=T,10>=C,10>=I,10>=O,10>=U,C>=0,I>=0,O>=0,U>=1] 


#### Cost of chains of f138(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [95]: 400
  with precondition: [A=100,G=200,M=50,S=20,T=0,C=B,I=H,O=N,10>=C,10>=I,10>=O,C>=0,I>=0,O>=0] 

* Chain [94]: 440
  with precondition: [A=100,G=200,M=50,S=20,C=B,I=H,O=N,10>=C,10>=I,10>=O,10>=T,C>=0,I>=0,O>=0,T>=1] 


#### Cost of chains of f126(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [96]: 440
  with precondition: [A=100,G=200,M=50,C=B,I=H,O=N,10>=C,10>=I,10>=O,C>=0,I>=0,O>=0] 


#### Cost of chains of f110_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1):
* Chain [98]: 440
  with precondition: [A=2,B=100,H=200,N=50,D=C,J=I,P=O,R=Q,10>=D,10>=J,10>=P,10>=R,D>=0,J>=0,P>=1,R>=1] 

* Chain [97]: 0
  with precondition: [A=3,B=100,H=200,N=50,D=C,J=I,P=O,R=Q,10>=D,10>=J,10>=P,10>=R,D>=0,J>=0,P>=1,R>=1] 


#### Cost of chains of f107(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [100]: 440
  with precondition: [A=100,G=200,M=50,P=0,C=B,I=H,O=N,10>=C,10>=I,10>=O,C>=0,I>=0,O>=1] 

* Chain [99]: 540
  with precondition: [A=100,G=200,M=50,C=B,I=H,O=N,10>=C,10>=I,10>=O,10>=P,C>=0,I>=0,O>=1,P>=1] 


#### Cost of chains of f101(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [101]: 540
  with precondition: [A=100,G=200,M=50,C=B,I=H,O=N,10>=C,10>=I,10>=O,C>=0,I>=0,O>=1] 


#### Cost of chains of f98(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [103]: 440
  with precondition: [A=100,G=200,M=50,N=0,C=B,I=H,10>=C,10>=I,C>=0,I>=0] 

* Chain [102]: 540
  with precondition: [A=100,G=200,M=50,C=B,I=H,10>=C,10>=I,10>=N,C>=0,I>=0,N>=1] 


#### Cost of chains of f86(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [104]: 540
  with precondition: [A=100,G=200,C=B,I=H,10>=C,10>=I,C>=0,I>=0] 


#### Cost of chains of f70_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1):
* Chain [106]: 0
  with precondition: [A=3,B=100,H=200,D=C,J=I,L=K,10>=D,10>=J,10>=L,D>=0,J>=1,L>=1] 

* Chain [105]: 540
  with precondition: [A=7,B=100,H=200,D=C,J=I,L=K,10>=D,10>=J,10>=L,D>=0,J>=1,L>=1] 


#### Cost of chains of f67(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [108]: 540
  with precondition: [A=100,G=200,J=0,C=B,I=H,10>=C,10>=I,C>=0,I>=1] 

* Chain [107]: 940
  with precondition: [A=100,G=200,C=B,I=H,10>=C,10>=I,10>=J,C>=0,I>=1,J>=1] 


#### Cost of chains of f61(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [109]: 940
  with precondition: [A=100,G=200,C=B,I=H,10>=C,10>=I,C>=0,I>=1] 


#### Cost of chains of f58(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [111]: 540
  with precondition: [A=100,G=200,H=0,C=B,10>=C,C>=0] 

* Chain [110]: 940
  with precondition: [A=100,G=200,C=B,10>=C,10>=H,C>=0,H>=1] 


#### Cost of chains of f46(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [112]: 940
  with precondition: [A=100,C=B,10>=C,C>=0] 


#### Cost of chains of f30_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1):
* Chain [114]: 0
  with precondition: [A=3,B=100,D=C,F=E,10>=D,10>=F,D>=1,F>=1] 

* Chain [113]: 940
  with precondition: [A=6,B=100,D=C,F=E,10>=D,10>=F,D>=1,F>=1] 


#### Cost of chains of f27(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [116]: 940
  with precondition: [A=100,D=0,C=B,10>=C,C>=1] 

* Chain [115]: 1140
  with precondition: [A=100,C=B,10>=C,10>=D,C>=1,D>=1] 


#### Cost of chains of f21(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [117]: 1140
  with precondition: [A=100,C=B,10>=C,C>=1] 


#### Cost of chains of f18(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [119]: 940
  with precondition: [A=100,B=0] 

* Chain [118]: 1140
  with precondition: [A=100,10>=B,B>=1] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1):
* Chain [120]: 1140
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1): 
-------------------------------------
* Chain [120] with precondition: [] 
    - Upper bound: 1140 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1): 1140 
Asymptotic class: constant 
* Total analysis performed in 2633 ms.