/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  : [f1/34]
1. recursive  : [f16/47]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f20/76]
4. non_recursive  : [f16_loop_cont/77]
5. recursive  : [f18/48,f27/48]
6. recursive  : [f11/25]
7. non_recursive  : [f11_loop_cont/77]
8. recursive  : [f13/24]
9. non_recursive  : [f13_loop_cont/77]
10. non_recursive  : [f18_loop_cont/77]
11. non_recursive  : [f1_loop_cont/77]
12. non_recursive  : [f19/76]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f1/34
1. SCC is partially evaluated into f16/47
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f16_loop_cont/77
5. SCC is partially evaluated into f18/48
6. SCC is partially evaluated into f11/25
7. SCC is partially evaluated into f11_loop_cont/77
8. SCC is partially evaluated into f13/24
9. SCC is partially evaluated into f13_loop_cont/77
10. SCC is partially evaluated into f18_loop_cont/77
11. SCC is partially evaluated into f1_loop_cont/77
12. SCC is partially evaluated into f19/76

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

### Specialization of cost equations f1/34 
* CE 6 is refined into CE [33] 
* CE 5 is refined into CE [34] 
* CE 4 is refined into CE [35] 


### Cost equations --> "Loop" of f1/34 
* CEs [35] --> Loop 32 
* CEs [33] --> Loop 33 
* CEs [34] --> Loop 34 

### Ranking functions of CR f1(A,B,C,D,H,Z,C1,D1,E1,F1,P1,Q1,R1,Y1,Z1,A2,B2,C2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4) 
* RF of phase [32]: [A-B,-B+C1]

#### Partial ranking functions of CR f1(A,B,C,D,H,Z,C1,D1,E1,F1,P1,Q1,R1,Y1,Z1,A2,B2,C2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4) 
* Partial RF of phase [32]:
  - RF of loop [32:1]:
    A-B
    -B+C1


### Specialization of cost equations f16/47 
* CE 12 is refined into CE [36] 
* CE 10 is refined into CE [37] 
* CE 11 is refined into CE [38] 
* CE 9 is refined into CE [39] 


### Cost equations --> "Loop" of f16/47 
* CEs [39] --> Loop 35 
* CEs [36] --> Loop 36 
* CEs [37] --> Loop 37 
* CEs [38] --> Loop 38 

### Ranking functions of CR f16(A,C,Z,H1,I1,L1,M1,N1,O1,P1,Q1,R1,D2,E2,F2,P2,Q2,R2,S2,T2,U2,V2,W2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4,F4,G4,H4,I4,J4,K4) 

#### Partial ranking functions of CR f16(A,C,Z,H1,I1,L1,M1,N1,O1,P1,Q1,R1,D2,E2,F2,P2,Q2,R2,S2,T2,U2,V2,W2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4,F4,G4,H4,I4,J4,K4) 


### Specialization of cost equations f16_loop_cont/77 
* CE 14 is refined into CE [40] 
* CE 13 is refined into CE [41] 


### Cost equations --> "Loop" of f16_loop_cont/77 
* CEs [40] --> Loop 39 
* CEs [41] --> Loop 40 

### Ranking functions of CR f16_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 

#### Partial ranking functions of CR f16_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 


### Specialization of cost equations f18/48 
* CE 19 is refined into CE [42] 
* CE 15 is refined into CE [43] 
* CE 18 is refined into CE [44] 
* CE 16 is refined into CE [45] 
* CE 17 is refined into CE [46] 


### Cost equations --> "Loop" of f18/48 
* CEs [45] --> Loop 41 
* CEs [46] --> Loop 42 
* CEs [42] --> Loop 43 
* CEs [43] --> Loop 44 
* CEs [44] --> Loop 45 

### Ranking functions of CR f18(A,C,D,H,T,U,V,W,X,Y,Z,A1,B1,G1,H1,I1,L1,M1,N1,O1,Q1,T1,G2,H2,I2,J2,K2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4,F4,G4,H4) 

#### Partial ranking functions of CR f18(A,C,D,H,T,U,V,W,X,Y,Z,A1,B1,G1,H1,I1,L1,M1,N1,O1,Q1,T1,G2,H2,I2,J2,K2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4,F4,G4,H4) 
* Partial RF of phase [41,42]:
  - RF of loop [42:1]:
    C depends on loops [41:1] 
    C-V+1 depends on loops [41:1] 
    H+1 depends on loops [41:1] 


### Specialization of cost equations f11/25 
* CE 25 is refined into CE [47] 
* CE 24 is refined into CE [48] 
* CE 23 is refined into CE [49] 


### Cost equations --> "Loop" of f11/25 
* CEs [49] --> Loop 46 
* CEs [47] --> Loop 47 
* CEs [48] --> Loop 48 

### Ranking functions of CR f11(A,C,H1,I1,J1,L1,M1,N1,O1,P1,Q1,R1,S1,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3) 
* RF of phase [46]: [J1+1]

#### Partial ranking functions of CR f11(A,C,H1,I1,J1,L1,M1,N1,O1,P1,Q1,R1,S1,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3) 
* Partial RF of phase [46]:
  - RF of loop [46:1]:
    J1+1


### Specialization of cost equations f11_loop_cont/77 
* CE 27 is refined into CE [50] 
* CE 26 is refined into CE [51] 


### Cost equations --> "Loop" of f11_loop_cont/77 
* CEs [50] --> Loop 49 
* CEs [51] --> Loop 50 

### Ranking functions of CR f11_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 

#### Partial ranking functions of CR f11_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 


### Specialization of cost equations f13/24 
* CE 30 is refined into CE [52] 
* CE 29 is refined into CE [53] 
* CE 28 is refined into CE [54] 


### Cost equations --> "Loop" of f13/24 
* CEs [54] --> Loop 51 
* CEs [52] --> Loop 52 
* CEs [53] --> Loop 53 

### Ranking functions of CR f13(A,C,H1,I1,L1,M1,N1,O1,P1,Q1,R1,U1,W1,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3) 
* RF of phase [51]: [U1+1]

#### Partial ranking functions of CR f13(A,C,H1,I1,L1,M1,N1,O1,P1,Q1,R1,U1,W1,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3) 
* Partial RF of phase [51]:
  - RF of loop [51:1]:
    U1+1


### Specialization of cost equations f13_loop_cont/77 
* CE 32 is refined into CE [55] 
* CE 31 is refined into CE [56] 


### Cost equations --> "Loop" of f13_loop_cont/77 
* CEs [55] --> Loop 54 
* CEs [56] --> Loop 55 

### Ranking functions of CR f13_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 

#### Partial ranking functions of CR f13_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 


### Specialization of cost equations f18_loop_cont/77 
* CE 22 is refined into CE [57,58,59,60] 
* CE 21 is refined into CE [61,62,63,64] 
* CE 20 is refined into CE [65] 


### Cost equations --> "Loop" of f18_loop_cont/77 
* CEs [60] --> Loop 56 
* CEs [59] --> Loop 57 
* CEs [58] --> Loop 58 
* CEs [57] --> Loop 59 
* CEs [64] --> Loop 60 
* CEs [63] --> Loop 61 
* CEs [62] --> Loop 62 
* CEs [61] --> Loop 63 
* CEs [65] --> Loop 64 

### Ranking functions of CR f18_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 

#### Partial ranking functions of CR f18_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 


### Specialization of cost equations f1_loop_cont/77 
* CE 8 is refined into CE [66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92] 
* CE 7 is refined into CE [93] 


### Cost equations --> "Loop" of f1_loop_cont/77 
* CEs [83] --> Loop 65 
* CEs [82] --> Loop 66 
* CEs [81] --> Loop 67 
* CEs [79] --> Loop 68 
* CEs [71] --> Loop 69 
* CEs [73] --> Loop 70 
* CEs [67] --> Loop 71 
* CEs [69] --> Loop 72 
* CEs [75] --> Loop 73 
* CEs [77] --> Loop 74 
* CEs [78] --> Loop 75 
* CEs [80] --> Loop 76 
* CEs [70] --> Loop 77 
* CEs [72] --> Loop 78 
* CEs [66] --> Loop 79 
* CEs [68] --> Loop 80 
* CEs [74] --> Loop 81 
* CEs [76] --> Loop 82 
* CEs [93] --> Loop 83 
* CEs [90,91] --> Loop 84 
* CEs [86,87] --> Loop 85 
* CEs [84,88,92] --> Loop 86 
* CEs [89] --> Loop 87 
* CEs [85] --> Loop 88 

### Ranking functions of CR f1_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 

#### Partial ranking functions of CR f1_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 


### Specialization of cost equations f19/76 
* CE 2 is refined into CE [94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141] 
* CE 3 is refined into CE [142,143,144,145,146,147,148,149] 
* CE 1 is refined into CE [150] 


### Cost equations --> "Loop" of f19/76 
* CEs [140,141,146,147] --> Loop 89 
* CEs [142,143,144,145] --> Loop 90 
* CEs [118,124] --> Loop 91 
* CEs [117,123,125,130] --> Loop 92 
* CEs [120,122] --> Loop 93 
* CEs [119,121,127,129] --> Loop 94 
* CEs [126,128,131,132,133,134] --> Loop 95 
* CEs [110,111] --> Loop 96 
* CEs [95,101] --> Loop 97 
* CEs [94,100,102,107] --> Loop 98 
* CEs [97,99] --> Loop 99 
* CEs [96,98,104,106] --> Loop 100 
* CEs [103,105,108,109] --> Loop 101 
* CEs [150] --> Loop 102 
* CEs [148,149] --> Loop 103 
* CEs [136] --> Loop 104 
* CEs [138] --> Loop 105 
* CEs [135] --> Loop 106 
* CEs [137] --> Loop 107 
* CEs [139] --> Loop 108 
* CEs [115] --> Loop 109 
* CEs [114] --> Loop 110 
* CEs [116] --> Loop 111 
* CEs [113] --> Loop 112 
* CEs [112] --> Loop 113 

### Ranking functions of CR f19(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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,N3) 

#### Partial ranking functions of CR f19(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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,N3) 


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

#### Cost of chains of f1(A,B,C,D,H,Z,C1,D1,E1,F1,P1,Q1,R1,Y1,Z1,A2,B2,C2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4):
* Chain [[32],34]: 1*it(32)+0
  Such that:it(32) =< A-B

  with precondition: [D=0,N3=6,Q3=0,A=C1,D1=F1,X3=Y3,O3=Z3,B>=2,H>=A,A4>=A,A>=B+1] 

* Chain [[32],33]: 1*it(32)+0
  Such that:it(32) =< A-B

  with precondition: [N3=3,A=C1,D1=F1,B>=2,A>=B+1] 

* Chain [34]: 0
  with precondition: [D=0,N3=6,Q3=0,A=B,A=C1,F1=D1,Z3=O3,F1=X3,F1=Y3,A>=2,H>=A,A4>=A] 

* Chain [33]: 0
  with precondition: [N3=3,C1=A,F1=D1,B>=2,C1>=B] 


#### Cost of chains of f16(A,C,Z,H1,I1,L1,M1,N1,O1,P1,Q1,R1,D2,E2,F2,P2,Q2,R2,S2,T2,U2,V2,W2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4,F4,G4,H4,I4,J4,K4):
* Chain [[35]]...: 1*it(35)+0
  with precondition: [E2=F2,Q1=R1,A=1,0>=C] 

* Chain [[35],38]: 1*it(35)+0
  with precondition: [A=1,Q1=0,R1=0,N3=2,O3=1,P3=0,Y3=0,Z3=0,D4+1=0,E4=0,E2=F2,T2=H4,U2=I4,B4=K4,0>=C] 

* Chain [[35],37]: 1*it(35)+0
  with precondition: [A=1,Q1=0,R1=0,N3=2,O3=1,Y3=0,Z3=0,D4+1=0,E2=F2,P3=E4,B4=I4,V2=J4,W2=K4,0>=C,P3>=1] 

* Chain [[35],36]: 1*it(35)+0
  with precondition: [A=1,N3=3,Q1=R1,E2=F2,0>=C] 

* Chain [38]: 0
  with precondition: [A=1,Q1=0,R1=0,N3=2,O3=1,P3=0,Y3=0,Z3=0,D4+1=0,E4=0,Q3=Z,A4=D2,F2=E2,H4=T2,I4=U2,K4=B4,F2=C4,C>=1] 

* Chain [37]: 0
  with precondition: [A=1,Q1=0,R1=0,N3=2,O3=1,Y3=0,Z3=0,D4+1=0,Q3=Z,A4=D2,F2=E2,J4=V2,K4=W2,I4=B4,F2=C4,P3=E4,C>=1,P3>=1] 

* Chain [36]: 0
  with precondition: [A=1,N3=3,R1=Q1,F2=E2] 


#### Cost of chains of f16_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2):
* Chain [40]: 0
  with precondition: [A=2] 

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


#### Cost of chains of f18(A,C,D,H,T,U,V,W,X,Y,Z,A1,B1,G1,H1,I1,L1,M1,N1,O1,Q1,T1,G2,H2,I2,J2,K2,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4,F4,G4,H4):
* Chain [[41,42]]...: 2*it(41)+0
  with precondition: [A>=2,D>=0,H>=0] 

* Chain [[41,42],45]: 2*it(41)+0
  with precondition: [Q1=0,N3=4,Z3=0,A4=0,B4=0,E4+1=0,P3=Y3+1,T1=C4,J2=G4,K2=H4,A>=2,D>=0,H>=0,O3>=1,Q3>=0,D4>=0,F4>=0,H+O3>=C,O3+2*H>=C+1] 

* Chain [[41,42],44]: 2*it(41)+0
  with precondition: [Q1=0,N3=5,Z3=0,A4=0,B4=0,H4+1=0,Q3=S3,G1=Y3,P3=C4+1,G2=D4,H2=E4,I2=F4,0>=O3,A>=2,D>=0,H>=0,Q3>=0,R3>=0,G4>=0,H>=C] 

* Chain [[41,42],43]: 2*it(41)+0
  with precondition: [N3=3,A>=2,D>=0,H>=0] 

* Chain [45]: 0
  with precondition: [Q1=0,N3=4,Z3=0,A4=0,B4=0,E4+1=0,R3=T,S3=U,T3=W,U3=X,V3=Z,W3=A1,X3=B1,C4=T1,G4=J2,H4=K2,C=O3,Y3+1=P3,H=Q3,A>=2,C>=1,D>=0,H>=0,D4>=0,F4>=0] 

* Chain [44]: 0
  with precondition: [Q1=0,N3=5,Z3=0,A4=0,B4=0,H4+1=0,T3=W,U3=X,V3=Z,W3=A1,X3=B1,Y3=G1,D4=G2,E4=H2,F4=I2,C=O3,C4+1=P3,Q3=S3,0>=C,A>=2,D>=0,H>=0,Q3>=0,R3>=0,G4>=0] 

* Chain [43]: 0
  with precondition: [N3=3,A>=2] 


#### Cost of chains of f11(A,C,H1,I1,J1,L1,M1,N1,O1,P1,Q1,R1,S1,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3):
* Chain [[46],48]: 1*it(46)+0
  Such that:it(46) =< J1-R3

  with precondition: [H1=0,I1=0,L1=0,M1=0,N1=0,O1=0,Q1=0,R1=0,N3=2,X3=0,R3=Y3,A>=2,C>=1,R3>=0,J1>=R3+1] 

* Chain [[46],47]: 1*it(46)+0
  Such that:it(46) =< J1+1

  with precondition: [L1=0,N1=0,Q1=0,N3=3,H1=I1,H1=M1,H1=O1,H1=R1,A>=2,C>=1,J1>=0] 

* Chain [48]: 0
  with precondition: [N3=2,H1=I1,H1=L1,H1=M1,H1=O1,X3=Q1,H1=R1,Y3=S1,J1=R3,A>=2,J1>=0] 

* Chain [47]: 0
  with precondition: [N3=3,H1=I1,H1=M1,H1=O1,H1=R1,A>=2] 


#### Cost of chains of f11_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2):
* Chain [50]: 0
  with precondition: [A=2,N2=2] 

* Chain [49]: 0
  with precondition: [A=3,N2=2] 


#### Cost of chains of f13(A,C,H1,I1,L1,M1,N1,O1,P1,Q1,R1,U1,W1,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3):
* Chain [[51],53]: 1*it(51)+0
  Such that:it(51) =< U1-X3

  with precondition: [H1=0,I1=0,L1=0,M1=0,N1=0,O1=0,Q1=0,R1=0,N3=2,V3=0,W3=X3,0>=C,A>=2,W3>=0,U1>=W3+1] 

* Chain [[51],52]: 1*it(51)+0
  Such that:it(51) =< U1+1

  with precondition: [L1=0,N1=0,Q1=0,N3=3,H1=I1,H1=M1,H1=O1,H1=R1,0>=C,A>=2,U1>=0] 

* Chain [53]: 0
  with precondition: [N3=2,H1=I1,H1=L1,H1=M1,H1=O1,V3=Q1,H1=R1,X3=W1,U1=W3,A>=2,U1>=0] 

* Chain [52]: 0
  with precondition: [N3=3,H1=I1,H1=M1,H1=O1,H1=R1,A>=2] 


#### Cost of chains of f13_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2):
* Chain [55]: 0
  with precondition: [A=2,N2=2,B>=2] 

* Chain [54]: 0
  with precondition: [A=3,N2=2,B>=2] 


#### Cost of chains of f18_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2):
* Chain [64]: 0
  with precondition: [A=3,N2=2,J1=I1,J1=N1,J1=P1,J1=S1,B>=2] 

* Chain [63]: 1*s(1)+0
  Such that:s(1) =< K1

  with precondition: [A=4,I1=0,J1=0,M1=0,N1=0,O1=0,P1=0,R1=0,S1=0,N2=2,B>=2,D>=1,K1>=1] 

* Chain [62]: 1*s(2)+0
  Such that:s(2) =< K1+1

  with precondition: [A=4,M1=0,O1=0,R1=0,N2=2,J1=I1,J1=N1,J1=P1,J1=S1,B>=2,D>=1,K1>=0] 

* Chain [61]: 0
  with precondition: [A=4,N2=2,J1=I1,J1=M1,J1=N1,J1=P1,J1=S1,B>=2,K1>=0] 

* Chain [60]: 0
  with precondition: [A=4,N2=2,J1=I1,J1=N1,J1=P1,J1=S1,B>=2] 

* Chain [59]: 1*s(3)+0
  Such that:s(3) =< V1

  with precondition: [A=5,I1=0,J1=0,M1=0,N1=0,O1=0,P1=0,R1=0,S1=0,N2=2,0>=D,B>=2,V1>=1] 

* Chain [58]: 1*s(4)+0
  Such that:s(4) =< V1+1

  with precondition: [A=5,M1=0,O1=0,R1=0,N2=2,J1=I1,J1=N1,J1=P1,J1=S1,0>=D,B>=2,V1>=0] 

* Chain [57]: 0
  with precondition: [A=5,N2=2,J1=I1,J1=M1,J1=N1,J1=P1,J1=S1,B>=2,V1>=0] 

* Chain [56]: 0
  with precondition: [A=5,N2=2,J1=I1,J1=N1,J1=P1,J1=S1,B>=2] 


#### Cost of chains of f1_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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2):
* Chain [88]...: 2*s(5)+1*s(6)+0
  Such that:s(6) =< K1

  with precondition: [A=6,S1=0,N2=2,D2=I,B>=2,E>=0,K1>=1,D2>=0] 

* Chain [87]...: 2*s(7)+1*s(8)+0
  Such that:s(8) =< V1

  with precondition: [A=6,S1=0,N2=2,D2=I,B>=2,E>=0,V1>=1,D2>=0] 

* Chain [86]...: 1*aux(9)+0
  with precondition: [A=6,N2=2,D2=I,B>=2,E>=0,D2>=0] 

* Chain [85]...: 4*s(12)+1*s(13)+0
  Such that:s(13) =< K1+1

  with precondition: [A=6,N2=2,D2=I,B>=2,E>=0,K1>=0,D2>=0] 

* Chain [84]...: 4*s(15)+1*s(16)+0
  Such that:s(16) =< V1+1

  with precondition: [A=6,N2=2,D2=I,B>=2,E>=0,V1>=0,D2>=0] 

* Chain [83]: 0
  with precondition: [A=3,N2=2,D2=I,B>=2] 

* Chain [82]: 0
  with precondition: [A=6,R1=0,S1=0,N2=2,D2=I,0>=D,B>=2,E>=0,V1>=0,D2>=0] 

* Chain [81]: 1*s(18)+0
  Such that:s(18) =< V1

  with precondition: [A=6,R1=0,S1=0,N2=2,D2=I,0>=D,B>=2,E>=0,V1>=1,D2>=0] 

* Chain [80]: 0
  with precondition: [A=6,R1=0,S1=0,N2=2,D2=I,B>=2,D>=1,E>=0,K1>=0,D2>=0] 

* Chain [79]: 1*s(19)+0
  Such that:s(19) =< K1

  with precondition: [A=6,R1=0,S1=0,N2=2,D2=I,B>=2,D>=1,E>=0,K1>=1,D2>=0] 

* Chain [78]: 2*s(20)+0
  with precondition: [A=6,R1=0,S1=0,N2=2,D2=I,B>=2,E>=0,K1>=0,D2>=0] 

* Chain [77]: 2*s(21)+1*s(22)+0
  Such that:s(22) =< K1

  with precondition: [A=6,R1=0,S1=0,N2=2,D2=I,B>=2,E>=0,K1>=1,D2>=0] 

* Chain [76]: 2*s(23)+0
  with precondition: [A=6,R1=0,S1=0,N2=2,D2=I,B>=2,E>=0,V1>=0,D2>=0,D2>=D] 

* Chain [75]: 2*s(24)+1*s(25)+0
  Such that:s(25) =< V1

  with precondition: [A=6,R1=0,S1=0,N2=2,D2=I,B>=2,E>=0,V1>=1,D2>=0,D2>=D] 

* Chain [74]: 0
  with precondition: [A=6,R1=0,N2=2,D2=I,0>=D,B>=2,E>=0,D2>=0] 

* Chain [73]: 1*s(26)+0
  Such that:s(26) =< V1+1

  with precondition: [A=6,R1=0,N2=2,D2=I,0>=D,B>=2,E>=0,V1>=0,D2>=0] 

* Chain [72]: 0
  with precondition: [A=6,R1=0,N2=2,D2=I,B>=2,D>=1,E>=0,D2>=0] 

* Chain [71]: 1*s(27)+0
  Such that:s(27) =< K1+1

  with precondition: [A=6,R1=0,N2=2,D2=I,B>=2,D>=1,E>=0,K1>=0,D2>=0] 

* Chain [70]: 2*s(28)+0
  with precondition: [A=6,R1=0,N2=2,D2=I,B>=2,E>=0,D2>=0] 

* Chain [69]: 2*s(29)+1*s(30)+0
  Such that:s(30) =< K1+1

  with precondition: [A=6,R1=0,N2=2,D2=I,B>=2,E>=0,K1>=0,D2>=0] 

* Chain [68]: 2*s(31)+1*s(32)+0
  Such that:s(32) =< V1+1

  with precondition: [A=6,R1=0,N2=2,D2=I,B>=2,E>=0,V1>=0,D2>=0,D2>=D] 

* Chain [67]: 2*s(33)+0
  with precondition: [A=6,R1=0,N2=2,D2=I,B>=2,E>=0,D2>=0,D2>=D] 

* Chain [66]: 0
  with precondition: [A=6,N2=2,D2=I,B>=2] 

* Chain [65]: 2*s(34)+0
  with precondition: [A=6,N2=2,D2=I,B>=2,E>=0,D2>=0] 


#### Cost of chains of f19(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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,N3):
* Chain [113]...: 1*s(35)+2*s(36)+0
  Such that:s(35) =< J1

  with precondition: [D=0,E1=0,A2=0,H>=2,J1>=1] 

* Chain [112]...: 1*s(37)+2*s(38)+0
  Such that:s(37) =< U1

  with precondition: [D=0,E1=0,A2=0,H>=2,U1>=1] 

* Chain [111]...: 1*s(39)+0
  with precondition: [D=0,A2=E1,H>=2] 

* Chain [110]...: 1*s(40)+4*s(41)+0
  Such that:s(40) =< J1+1

  with precondition: [D=0,A2=E1,H>=2,J1>=0] 

* Chain [109]...: 1*s(42)+4*s(43)+0
  Such that:s(42) =< U1+1

  with precondition: [D=0,A2=E1,H>=2,U1>=0] 

* Chain [108]...: 1*s(44)+1*s(45)+0
  Such that:s(44) =< H

  with precondition: [D=0,A2=E1,H>=3] 

* Chain [107]...: 1*s(46)+1*s(47)+4*s(48)+0
  Such that:s(46) =< H
s(47) =< J1+1

  with precondition: [D=0,A2=E1,H>=3,J1>=0] 

* Chain [106]...: 1*s(49)+1*s(50)+2*s(51)+0
  Such that:s(49) =< H
s(50) =< J1

  with precondition: [D=0,A2=E1,H>=3,J1>=1] 

* Chain [105]...: 1*s(52)+1*s(53)+4*s(54)+0
  Such that:s(52) =< H
s(53) =< U1+1

  with precondition: [D=0,A2=E1,H>=3,U1>=0] 

* Chain [104]...: 1*s(55)+1*s(56)+2*s(57)+0
  Such that:s(55) =< H
s(56) =< U1

  with precondition: [D=0,A2=E1,H>=3,U1>=1] 

* Chain [103]...: 1*aux(10)+0
  with precondition: [A2=E1] 

* Chain [102]: 0
  with precondition: [] 

* Chain [101]: 1*aux(11)+0
  with precondition: [D=0,E1=0,A2=0,H>=2] 

* Chain [100]: 4*s(62)+2*s(63)+0
  Such that:aux(12) =< J1+1
s(63) =< aux(12)

  with precondition: [D=0,E1=0,A2=0,H>=2,J1>=0] 

* Chain [99]: 2*s(66)+2*s(68)+0
  Such that:aux(13) =< J1
s(66) =< aux(13)

  with precondition: [D=0,E1=0,A2=0,H>=2,J1>=1] 

* Chain [98]: 4*s(69)+2*s(70)+0
  Such that:aux(14) =< U1+1
s(70) =< aux(14)

  with precondition: [D=0,E1=0,A2=0,H>=2,U1>=0] 

* Chain [97]: 2*s(73)+2*s(75)+0
  Such that:aux(15) =< U1
s(73) =< aux(15)

  with precondition: [D=0,E1=0,A2=0,H>=2,U1>=1] 

* Chain [96]: 1*aux(16)+0
  with precondition: [D=0,A2=E1,H>=2] 

* Chain [95]: 6*s(77)+6*s(80)+0
  Such that:aux(17) =< H
s(77) =< aux(17)

  with precondition: [D=0,A2=E1,H>=3] 

* Chain [94]: 4*s(86)+4*s(88)+2*s(90)+0
  Such that:aux(18) =< H
aux(19) =< J1+1
s(86) =< aux(18)
s(90) =< aux(19)

  with precondition: [D=0,A2=E1,H>=3,J1>=0] 

* Chain [93]: 2*s(94)+2*s(95)+2*s(98)+0
  Such that:aux(20) =< H
aux(21) =< J1
s(94) =< aux(20)
s(95) =< aux(21)

  with precondition: [D=0,A2=E1,H>=3,J1>=1] 

* Chain [92]: 4*s(99)+4*s(101)+2*s(103)+0
  Such that:aux(22) =< H
aux(23) =< U1+1
s(99) =< aux(22)
s(103) =< aux(23)

  with precondition: [D=0,A2=E1,H>=3,U1>=0] 

* Chain [91]: 2*s(107)+2*s(108)+2*s(111)+0
  Such that:aux(24) =< H
aux(25) =< U1
s(107) =< aux(24)
s(108) =< aux(25)

  with precondition: [D=0,A2=E1,H>=3,U1>=1] 

* Chain [90]: 1*aux(26)+0
  with precondition: [E1=0,A2=0] 

* Chain [89]: 1*aux(27)+0
  with precondition: [A2=E1] 


Closed-form bounds of f19(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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,N3): 
-------------------------------------
* Chain [113]... with precondition: [D=0,E1=0,A2=0,H>=2,J1>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [112]... with precondition: [D=0,E1=0,A2=0,H>=2,U1>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [111]... with precondition: [D=0,A2=E1,H>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [110]... with precondition: [D=0,A2=E1,H>=2,J1>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [109]... with precondition: [D=0,A2=E1,H>=2,U1>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [108]... with precondition: [D=0,A2=E1,H>=3] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [107]... with precondition: [D=0,A2=E1,H>=3,J1>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [106]... with precondition: [D=0,A2=E1,H>=3,J1>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [105]... with precondition: [D=0,A2=E1,H>=3,U1>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [104]... with precondition: [D=0,A2=E1,H>=3,U1>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [103]... with precondition: [A2=E1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [102] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [101] with precondition: [D=0,E1=0,A2=0,H>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [100] with precondition: [D=0,E1=0,A2=0,H>=2,J1>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [99] with precondition: [D=0,E1=0,A2=0,H>=2,J1>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [98] with precondition: [D=0,E1=0,A2=0,H>=2,U1>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [97] with precondition: [D=0,E1=0,A2=0,H>=2,U1>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [96] with precondition: [D=0,A2=E1,H>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [95] with precondition: [D=0,A2=E1,H>=3] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [94] with precondition: [D=0,A2=E1,H>=3,J1>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [93] with precondition: [D=0,A2=E1,H>=3,J1>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [92] with precondition: [D=0,A2=E1,H>=3,U1>=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [91] with precondition: [D=0,A2=E1,H>=3,U1>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [90] with precondition: [E1=0,A2=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [89] with precondition: [A2=E1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f19(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,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,N3): inf 
Asymptotic class: infinity 
* Total analysis performed in 7203 ms.