7.62/7.67 MAYBE 7.62/7.67 7.62/7.67 Preprocessing Cost Relations 7.62/7.67 ===================================== 7.62/7.67 7.62/7.67 #### Computed strongly connected components 7.62/7.67 0. non_recursive : [f1/60] 7.62/7.67 1. recursive : [f16/43] 7.62/7.67 2. non_recursive : [exit_location/1] 7.62/7.67 3. recursive : [f14/48] 7.62/7.67 4. recursive : [f7/28] 7.62/7.67 5. non_recursive : [f7_loop_cont/61] 7.62/7.67 6. non_recursive : [f14_loop_cont/61] 7.62/7.67 7. non_recursive : [f16_loop_cont/61] 7.62/7.67 8. non_recursive : [f0/60] 7.62/7.67 7.62/7.67 #### Obtained direct recursion through partial evaluation 7.62/7.67 0. SCC is completely evaluated into other SCCs 7.62/7.67 1. SCC is partially evaluated into f16/43 7.62/7.67 2. SCC is completely evaluated into other SCCs 7.62/7.67 3. SCC is partially evaluated into f14/48 7.62/7.67 4. SCC is partially evaluated into f7/28 7.62/7.67 5. SCC is partially evaluated into f7_loop_cont/61 7.62/7.67 6. SCC is partially evaluated into f14_loop_cont/61 7.62/7.67 7. SCC is partially evaluated into f16_loop_cont/61 7.62/7.67 8. SCC is partially evaluated into f0/60 7.62/7.67 7.62/7.67 Control-Flow Refinement of Cost Relations 7.62/7.67 ===================================== 7.62/7.67 7.62/7.67 ### Specialization of cost equations f16/43 7.62/7.67 * CE 8 is refined into CE [24] 7.62/7.67 * CE 7 is refined into CE [25] 7.62/7.67 * CE 6 is refined into CE [26] 7.62/7.67 * CE 5 is refined into CE [27] 7.62/7.67 * CE 4 is refined into CE [28] 7.62/7.67 * CE 3 is refined into CE [29] 7.62/7.67 7.62/7.67 7.62/7.67 ### Cost equations --> "Loop" of f16/43 7.62/7.67 * CEs [29] --> Loop 24 7.62/7.67 * CEs [24] --> Loop 25 7.62/7.67 * CEs [25] --> Loop 26 7.62/7.67 * CEs [26] --> Loop 27 7.62/7.67 * CEs [27] --> Loop 28 7.62/7.67 * CEs [28] --> Loop 29 7.62/7.67 7.62/7.67 ### Ranking functions of CR f16(A,B,C,D,E,F,G,H,I,K,L,M,N,O,R,S,T,O1,U1,W1,X1,Y1,Z1,A2,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3) 7.62/7.67 * RF of phase [24]: [A-B,-B+L] 7.62/7.67 7.62/7.67 #### Partial ranking functions of CR f16(A,B,C,D,E,F,G,H,I,K,L,M,N,O,R,S,T,O1,U1,W1,X1,Y1,Z1,A2,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3) 7.62/7.67 * Partial RF of phase [24]: 7.62/7.67 - RF of loop [24:1]: 7.62/7.67 A-B 7.62/7.67 -B+L 7.62/7.67 7.62/7.67 7.62/7.67 ### Specialization of cost equations f14/48 7.62/7.67 * CE 15 is refined into CE [30] 7.62/7.67 * CE 13 is refined into CE [31] 7.62/7.67 * CE 14 is refined into CE [32] 7.62/7.67 * CE 12 is refined into CE [33] 7.62/7.67 * CE 11 is refined into CE [34] 7.62/7.67 7.62/7.67 7.62/7.67 ### Cost equations --> "Loop" of f14/48 7.62/7.67 * CEs [33] --> Loop 30 7.62/7.67 * CEs [34] --> Loop 31 7.62/7.67 * CEs [30] --> Loop 32 7.62/7.67 * CEs [31] --> Loop 33 7.62/7.67 * CEs [32] --> Loop 34 7.62/7.67 7.62/7.67 ### Ranking functions of CR f14(I,K,L,M,N,O,S,T,U,X,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,W1,B2,E2,F2,G2,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3) 7.62/7.67 * RF of phase [30,31]: [T+1] 7.62/7.67 7.62/7.67 #### Partial ranking functions of CR f14(I,K,L,M,N,O,S,T,U,X,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,W1,B2,E2,F2,G2,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3) 7.62/7.67 * Partial RF of phase [30,31]: 7.62/7.67 - RF of loop [30:1,31:1]: 7.62/7.67 T+1 7.62/7.67 7.62/7.67 7.62/7.67 ### Specialization of cost equations f7/28 7.62/7.67 * CE 21 is refined into CE [35] 7.62/7.67 * CE 20 is refined into CE [36] 7.62/7.67 * CE 19 is refined into CE [37] 7.62/7.67 * CE 18 is refined into CE [38] 7.62/7.67 7.62/7.67 7.62/7.67 ### Cost equations --> "Loop" of f7/28 7.62/7.67 * CEs [37] --> Loop 35 7.62/7.67 * CEs [38] --> Loop 36 7.62/7.67 * CEs [35] --> Loop 37 7.62/7.67 * CEs [36] --> Loop 38 7.62/7.67 7.62/7.67 ### Ranking functions of CR f7(I,L,U,G1,I1,J1,K1,L1,M1,N1,O1,Q1,R1,S1,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3) 7.62/7.67 * RF of phase [35,36]: [Q1+1] 7.62/7.67 7.62/7.67 #### Partial ranking functions of CR f7(I,L,U,G1,I1,J1,K1,L1,M1,N1,O1,Q1,R1,S1,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3) 7.62/7.67 * Partial RF of phase [35,36]: 7.62/7.67 - RF of loop [35:1,36:1]: 7.62/7.67 Q1+1 7.62/7.67 7.62/7.67 7.62/7.67 ### Specialization of cost equations f7_loop_cont/61 7.62/7.67 * CE 23 is refined into CE [39] 7.62/7.67 * CE 22 is refined into CE [40] 7.62/7.67 7.62/7.67 7.62/7.67 ### Cost equations --> "Loop" of f7_loop_cont/61 7.62/7.67 * CEs [39] --> Loop 39 7.62/7.67 * CEs [40] --> Loop 40 7.62/7.67 7.62/7.67 ### Ranking functions of CR f7_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) 7.62/7.67 7.62/7.67 #### Partial ranking functions of CR f7_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) 7.62/7.67 7.62/7.67 7.62/7.67 ### Specialization of cost equations f14_loop_cont/61 7.62/7.67 * CE 17 is refined into CE [41,42,43,44] 7.62/7.67 * CE 16 is refined into CE [45] 7.62/7.67 7.62/7.67 7.62/7.67 ### Cost equations --> "Loop" of f14_loop_cont/61 7.62/7.67 * CEs [44] --> Loop 41 7.62/7.67 * CEs [43] --> Loop 42 7.62/7.67 * CEs [42] --> Loop 43 7.62/7.67 * CEs [41] --> Loop 44 7.62/7.67 * CEs [45] --> Loop 45 7.62/7.67 7.62/7.67 ### Ranking functions of CR f14_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) 7.62/7.67 7.62/7.67 #### Partial ranking functions of CR f14_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) 7.62/7.67 7.62/7.67 7.62/7.67 ### Specialization of cost equations f16_loop_cont/61 7.62/7.67 * CE 10 is refined into CE [46,47,48,49,50,51,52,53,54,55] 7.62/7.67 * CE 9 is refined into CE [56] 7.62/7.67 7.62/7.67 7.62/7.67 ### Cost equations --> "Loop" of f16_loop_cont/61 7.62/7.67 * CEs [55] --> Loop 46 7.62/7.67 * CEs [54] --> Loop 47 7.62/7.67 * CEs [51] --> Loop 48 7.62/7.67 * CEs [53] --> Loop 49 7.62/7.67 * CEs [52] --> Loop 50 7.62/7.67 * CEs [50] --> Loop 51 7.62/7.67 * CEs [49] --> Loop 52 7.62/7.67 * CEs [48] --> Loop 53 7.62/7.67 * CEs [47] --> Loop 54 7.62/7.67 * CEs [46] --> Loop 55 7.62/7.67 * CEs [56] --> Loop 56 7.62/7.67 7.62/7.67 ### 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) 7.62/7.67 7.62/7.67 #### 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) 7.62/7.67 7.62/7.67 7.62/7.67 ### Specialization of cost equations f0/60 7.62/7.67 * CE 1 is refined into CE [57] 7.62/7.68 * CE 2 is refined into CE [58,59,60,61,62,63,64,65,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,93,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] 7.62/7.68 7.62/7.68 7.62/7.68 ### Cost equations --> "Loop" of f0/60 7.62/7.68 * CEs [92,95,132,135] --> Loop 57 7.62/7.68 * CEs [97,137] --> Loop 58 7.62/7.68 * CEs [96,136] --> Loop 59 7.62/7.68 * CEs [87,127] --> Loop 60 7.62/7.68 * CEs [86,126] --> Loop 61 7.62/7.68 * CEs [82,85,122,125] --> Loop 62 7.62/7.68 * CEs [94,134] --> Loop 63 7.62/7.68 * CEs [93,133] --> Loop 64 7.62/7.68 * CEs [84,124] --> Loop 65 7.62/7.68 * CEs [83,123] --> Loop 66 7.62/7.68 * CEs [72,75,112,115] --> Loop 67 7.62/7.68 * CEs [77,117] --> Loop 68 7.62/7.68 * CEs [76,116] --> Loop 69 7.62/7.68 * CEs [67,107] --> Loop 70 7.62/7.68 * CEs [66,106] --> Loop 71 7.62/7.68 * CEs [62,65,102,105] --> Loop 72 7.62/7.68 * CEs [74,114] --> Loop 73 7.62/7.68 * CEs [73,113] --> Loop 74 7.62/7.68 * CEs [64,104] --> Loop 75 7.62/7.68 * CEs [63,103] --> Loop 76 7.62/7.68 * CEs [91,131] --> Loop 77 7.62/7.68 * CEs [90,130] --> Loop 78 7.62/7.68 * CEs [80,120] --> Loop 79 7.62/7.68 * CEs [81,121] --> Loop 80 7.62/7.68 * CEs [89,129] --> Loop 81 7.62/7.68 * CEs [88,128] --> Loop 82 7.62/7.68 * CEs [78,118] --> Loop 83 7.62/7.68 * CEs [79,119] --> Loop 84 7.62/7.68 * CEs [71,111] --> Loop 85 7.62/7.68 * CEs [70,110] --> Loop 86 7.62/7.68 * CEs [60,100] --> Loop 87 7.62/7.68 * CEs [61,101] --> Loop 88 7.62/7.68 * CEs [69,109] --> Loop 89 7.62/7.68 * CEs [68,108] --> Loop 90 7.62/7.68 * CEs [58,98] --> Loop 91 7.62/7.68 * CEs [59,99] --> Loop 92 7.62/7.68 * CEs [57] --> Loop 93 7.62/7.68 * CEs [138,139] --> Loop 94 7.62/7.68 7.62/7.68 ### 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,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,F3) 7.62/7.68 7.62/7.68 #### 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,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,F3) 7.62/7.68 7.62/7.68 7.62/7.68 Computing Bounds 7.62/7.68 ===================================== 7.62/7.68 7.62/7.68 #### Cost of chains of f16(A,B,C,D,E,F,G,H,I,K,L,M,N,O,R,S,T,O1,U1,W1,X1,Y1,Z1,A2,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3): 7.62/7.68 * Chain [[24],29]: 1*it(24)+0 7.62/7.68 Such that:it(24) =< A-B 7.62/7.68 7.62/7.68 with precondition: [S=0,F3=5,S3=0,C=E,A=L,R=T,A=M3+1,I=N3,Q3=R3,0>=K+1,0>=W1+1,B>=2,P3>=2,A>=B+1,R>=P3,X3>=P3] 7.62/7.68 7.62/7.68 * Chain [[24],28]: 1*it(24)+0 7.62/7.68 Such that:it(24) =< A-B 7.62/7.68 7.62/7.68 with precondition: [S=0,F3=5,S3=0,C=E,A=L,R=T,A=M3+1,I=N3,Q3=R3,0>=K+1,B>=2,W1>=1,P3>=2,A>=B+1,R>=P3,X3>=P3] 7.62/7.68 7.62/7.68 * Chain [[24],27]: 1*it(24)+0 7.62/7.68 Such that:it(24) =< A-B 7.62/7.68 7.62/7.68 with precondition: [S=0,F3=5,S3=0,C=E,A=L,R=T,A=M3+1,I=N3,Q3=R3,0>=W1+1,B>=2,K>=1,P3>=2,A>=B+1,R>=P3,X3>=P3] 7.62/7.68 7.62/7.68 * Chain [[24],26]: 1*it(24)+0 7.62/7.68 Such that:it(24) =< A-B 7.62/7.68 7.62/7.68 with precondition: [S=0,F3=5,S3=0,C=E,A=L,R=T,A=M3+1,I=N3,Q3=R3,B>=2,K>=1,W1>=1,P3>=2,A>=B+1,R>=P3,X3>=P3] 7.62/7.68 7.62/7.68 * Chain [[24],25]: 1*it(24)+0 7.62/7.68 Such that:it(24) =< A-B 7.62/7.68 7.62/7.68 with precondition: [F3=3,C=E,A=L,B>=2,A>=B+1] 7.62/7.68 7.62/7.68 * Chain [29]: 0 7.62/7.68 with precondition: [S=0,F3=5,S3=0,A=B,E=C,L3=F,M3=G,N3=H,A=L,R=T,R3=Q3,0>=K+1,0>=W1+1,A>=2,P3>=2,R>=P3,X3>=P3] 7.62/7.68 7.62/7.68 * Chain [28]: 0 7.62/7.68 with precondition: [S=0,F3=5,S3=0,A=B,E=C,L3=F,M3=G,N3=H,A=L,R=T,R3=Q3,0>=K+1,A>=2,W1>=1,P3>=2,R>=P3,X3>=P3] 7.62/7.68 7.62/7.68 * Chain [27]: 0 7.62/7.68 with precondition: [S=0,F3=5,S3=0,A=B,E=C,L3=F,M3=G,N3=H,A=L,R=T,R3=Q3,0>=W1+1,A>=2,K>=1,P3>=2,R>=P3,X3>=P3] 7.62/7.68 7.62/7.68 * Chain [26]: 0 7.62/7.68 with precondition: [S=0,F3=5,S3=0,A=B,E=C,L3=F,M3=G,N3=H,A=L,R=T,R3=Q3,A>=2,K>=1,W1>=1,P3>=2,R>=P3,X3>=P3] 7.62/7.68 7.62/7.68 * Chain [25]: 0 7.62/7.68 with precondition: [F3=3,L=A,E=C,B>=2,L>=B] 7.62/7.68 7.62/7.68 7.62/7.68 #### Cost of chains of f14(I,K,L,M,N,O,S,T,U,X,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,W1,B2,E2,F2,G2,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3): 7.62/7.68 * Chain [[30,31],34]: 2*it(30)+0 7.62/7.68 Such that:aux(2) =< -S+B2 7.62/7.68 aux(1) =< -S+B2+M3 7.62/7.68 it(30) =< aux(1) 7.62/7.68 it(30) =< aux(2) 7.62/7.68 7.62/7.68 with precondition: [F3=4,T3=0,U3=0,B2=L3+1,I=P3,X=Q3,B2=R3+1,S+T+1=B2+M3,S+T+1=B2+S3,0>=M1+1,S>=0,H3>=2,B2>=S+2,S+T+1>=B2] 7.62/7.68 7.62/7.68 * Chain [[30,31],33]: 2*it(30)+0 7.62/7.68 Such that:aux(2) =< -S+B2 7.62/7.68 aux(1) =< -S+B2+M3 7.62/7.68 it(30) =< aux(1) 7.62/7.68 it(30) =< aux(2) 7.62/7.68 7.62/7.68 with precondition: [F3=4,T3=0,U3=0,B2=L3+1,I=P3,X=Q3,B2=R3+1,S+T+1=B2+M3,S+T+1=B2+S3,S>=0,M1>=1,H3>=2,B2>=S+2,S+T+1>=B2] 7.62/7.68 7.62/7.68 * Chain [[30,31],32]: 2*it(30)+0 7.62/7.68 Such that:aux(3) =< T+1 7.62/7.68 it(30) =< aux(3) 7.62/7.68 7.62/7.68 with precondition: [F3=3,S>=0,T>=0] 7.62/7.68 7.62/7.68 * Chain [34]: 0 7.62/7.68 with precondition: [K=0,F3=4,T3=0,U3=0,K3=O,O3=B1,P3=C1,Q3=D1,R3=E1,S3=F1,S+1=B2,S=L3,T=M3,0>=M1+1,S>=0,T>=0,H3>=2] 7.62/7.68 7.62/7.68 * Chain [33]: 0 7.62/7.68 with precondition: [K=0,F3=4,T3=0,U3=0,K3=O,O3=B1,P3=C1,Q3=D1,R3=E1,S3=F1,S+1=B2,S=L3,T=M3,S>=0,T>=0,M1>=1,H3>=2] 7.62/7.68 7.62/7.68 * Chain [32]: 0 7.62/7.68 with precondition: [F3=3] 7.62/7.68 7.62/7.68 7.62/7.68 #### Cost of chains of f7(I,L,U,G1,I1,J1,K1,L1,M1,N1,O1,Q1,R1,S1,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3): 7.62/7.68 * Chain [[35,36],38]: 2*it(35)+0 7.62/7.68 Such that:aux(4) =< Q1+1 7.62/7.68 aux(5) =< Q1-Q3 7.62/7.68 it(35) =< aux(4) 7.62/7.68 it(35) =< aux(5) 7.62/7.68 7.62/7.68 with precondition: [G1=0,I1=0,N1=0,F3=2,J1=L1,J1=M1,I=R3,Q3=S3,G3>=2,Q3>=0,Q1>=Q3+1] 7.62/7.68 7.62/7.68 * Chain [[35,36],37]: 2*it(35)+0 7.62/7.68 Such that:aux(6) =< Q1+1 7.62/7.68 it(35) =< aux(6) 7.62/7.68 7.62/7.68 with precondition: [I1=0,F3=3,J1=L1,J1=M1,G1=N1,Q1>=0] 7.62/7.68 7.62/7.68 * Chain [38]: 0 7.62/7.68 with precondition: [F3=2,H3=U,G1=I1,L1=J1,L1=M1,G1=N1,R3=R1,S3=S1,Q1=Q3,Q1>=0,G3>=2] 7.62/7.68 7.62/7.68 * Chain [37]: 0 7.62/7.68 with precondition: [F3=3,N1=G1,L1=J1,L1=M1] 7.62/7.68 7.62/7.68 7.62/7.68 #### Cost of chains of f7_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): 7.62/7.68 * Chain [40]: 0 7.62/7.68 with precondition: [A=2,Z1=J,Z1=F2] 7.62/7.68 7.62/7.68 * Chain [39]: 0 7.62/7.68 with precondition: [A=3,Z1=J,Z1=F2] 7.62/7.68 7.62/7.68 7.62/7.68 #### Cost of chains of f14_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): 7.62/7.68 * Chain [45]: 0 7.62/7.68 with precondition: [A=3,Z1=J,K1=H1,R1=I1,K1=M1,K1=N1,K1=O1,Z1=F2] 7.62/7.68 7.62/7.68 * Chain [44]: 2*s(3)+0 7.62/7.68 Such that:s(2) =< I1 7.62/7.68 s(1) =< I1+1 7.62/7.68 s(3) =< s(1) 7.62/7.68 s(3) =< s(2) 7.62/7.68 7.62/7.68 with precondition: [A=4,H1=0,J1=0,K1=0,M1=0,N1=0,O1=0,Z1=J,R1=I1,Z1=F2,R1>=1] 7.62/7.68 7.62/7.68 * Chain [43]: 2*s(5)+0 7.62/7.68 Such that:s(4) =< R1+1 7.62/7.68 s(5) =< s(4) 7.62/7.68 7.62/7.68 with precondition: [A=4,J1=0,Z1=J,K1=H1,R1=I1,K1=M1,K1=N1,K1=O1,Z1=F2,R1>=0] 7.62/7.68 7.62/7.68 * Chain [42]: 0 7.62/7.68 with precondition: [A=4,Z1=J,R1=I1,H1=J1,H1=K1,H1=M1,H1=N1,H1=O1,Z1=F2,R1>=0] 7.62/7.68 7.62/7.68 * Chain [41]: 0 7.62/7.68 with precondition: [A=4,Z1=J,K1=H1,R1=I1,K1=M1,K1=N1,K1=O1,Z1=F2] 7.62/7.68 7.62/7.68 7.62/7.68 #### 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): 7.62/7.68 * Chain [56]: 0 7.62/7.68 with precondition: [A=3,Z1=J,Y=O,U=S] 7.62/7.68 7.62/7.68 * Chain [55]: 2*s(7)+0 7.62/7.68 Such that:s(6) =< R1+1 7.62/7.68 s(7) =< s(6) 7.62/7.68 7.62/7.68 with precondition: [A=5,L=0,Z1=J,Y=O,U=S,C2=T+1,0>=N1+1,U>=0,R1>=0,C2>=1] 7.62/7.68 7.62/7.68 * Chain [54]: 0 7.62/7.68 with precondition: [A=5,L=0,Z1=J,Y=O,U=S,C2=T+1,0>=N1+1,U>=0,C2>=1] 7.62/7.68 7.62/7.68 * Chain [53]: 2*s(9)+0 7.62/7.68 Such that:s(8) =< R1+1 7.62/7.68 s(9) =< s(8) 7.62/7.68 7.62/7.68 with precondition: [A=5,L=0,Z1=J,Y=O,U=S,C2=T+1,U>=0,N1>=1,R1>=0,C2>=1] 7.62/7.68 7.62/7.68 * Chain [52]: 0 7.62/7.68 with precondition: [A=5,L=0,Z1=J,Y=O,U=S,C2=T+1,U>=0,N1>=1,C2>=1] 7.62/7.68 7.62/7.68 * Chain [51]: 0 7.62/7.68 with precondition: [A=5,Z1=J,Y=O,U=S] 7.62/7.68 7.62/7.68 * Chain [50]: 2*s(12)+2*s(14)+0 7.62/7.68 Such that:s(10) =< -T+C2 7.62/7.68 s(11) =< U+1 7.62/7.68 s(13) =< R1+1 7.62/7.68 s(14) =< s(13) 7.62/7.68 s(12) =< s(11) 7.62/7.68 s(12) =< s(10) 7.62/7.68 7.62/7.68 with precondition: [A=5,Z1=J,Y=O,U=S,0>=N1+1,T>=0,R1>=0,C2>=T+2,T+U+1>=C2] 7.62/7.68 7.62/7.68 * Chain [49]: 2*s(17)+0 7.62/7.68 Such that:s(16) =< S+1 7.62/7.68 s(15) =< -T+C2 7.62/7.68 s(17) =< s(16) 7.62/7.68 s(17) =< s(15) 7.62/7.68 7.62/7.68 with precondition: [A=5,Z1=J,Y=O,U=S,0>=N1+1,T>=0,C2>=T+2,T+U+1>=C2] 7.62/7.68 7.62/7.68 * Chain [48]: 2*s(19)+0 7.62/7.68 Such that:s(18) =< U+1 7.62/7.68 s(19) =< s(18) 7.62/7.68 7.62/7.68 with precondition: [A=5,Z1=J,Y=O,U=S,T>=0,U>=0] 7.62/7.68 7.62/7.68 * Chain [47]: 2*s(22)+2*s(24)+0 7.62/7.68 Such that:s(20) =< -T+C2 7.62/7.68 s(21) =< U+1 7.62/7.68 s(23) =< R1+1 7.62/7.68 s(24) =< s(23) 7.62/7.68 s(22) =< s(21) 7.62/7.68 s(22) =< s(20) 7.62/7.68 7.62/7.68 with precondition: [A=5,Z1=J,Y=O,U=S,T>=0,N1>=1,R1>=0,C2>=T+2,T+U+1>=C2] 7.62/7.68 7.62/7.68 * Chain [46]: 2*s(27)+0 7.62/7.68 Such that:s(26) =< S+1 7.62/7.68 s(25) =< -T+C2 7.62/7.68 s(27) =< s(26) 7.62/7.68 s(27) =< s(25) 7.62/7.68 7.62/7.68 with precondition: [A=5,Z1=J,Y=O,U=S,T>=0,N1>=1,C2>=T+2,T+U+1>=C2] 7.62/7.68 7.62/7.68 7.62/7.68 #### 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,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,F3): 7.62/7.68 * Chain [94]: 1*aux(7)+0 7.62/7.68 with precondition: [] 7.62/7.68 7.62/7.68 * Chain [93]: 0 7.62/7.68 with precondition: [K=0,M1=0] 7.62/7.68 7.62/7.68 * Chain [92]: 1*aux(8)+0 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=K+1,0>=M1+1,0>=W1+1,R>=2] 7.62/7.68 7.62/7.68 * Chain [91]: 4*s(31)+1*s(32)+0 7.62/7.68 Such that:aux(9) =< Q1+1 7.62/7.68 s(31) =< aux(9) 7.62/7.68 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=K+1,0>=M1+1,0>=W1+1,R>=2,Q1>=0] 7.62/7.68 7.62/7.68 * Chain [90]: 4*s(36)+1*s(37)+0 7.62/7.68 Such that:aux(10) =< Q1+1 7.62/7.68 s(36) =< aux(10) 7.62/7.68 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=K+1,0>=M1+1,R>=2,Q1>=0,W1>=1] 7.62/7.68 7.62/7.68 * Chain [89]: 1*aux(11)+0 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=K+1,0>=M1+1,R>=2,W1>=1] 7.62/7.68 7.62/7.68 * Chain [88]: 1*aux(12)+0 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=K+1,0>=W1+1,R>=2,M1>=1] 7.62/7.68 7.62/7.68 * Chain [87]: 4*s(43)+1*s(44)+0 7.62/7.68 Such that:aux(13) =< Q1+1 7.62/7.68 s(43) =< aux(13) 7.62/7.68 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=K+1,0>=W1+1,R>=2,M1>=1,Q1>=0] 7.62/7.68 7.62/7.68 * Chain [86]: 4*s(48)+1*s(49)+0 7.62/7.68 Such that:aux(14) =< Q1+1 7.62/7.68 s(48) =< aux(14) 7.62/7.68 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=K+1,R>=2,M1>=1,Q1>=0,W1>=1] 7.62/7.68 7.62/7.68 * Chain [85]: 1*aux(15)+0 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=K+1,R>=2,M1>=1,W1>=1] 7.62/7.68 7.62/7.68 * Chain [84]: 1*aux(16)+0 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=M1+1,0>=W1+1,K>=1,R>=2] 7.62/7.68 7.62/7.68 * Chain [83]: 4*s(55)+1*s(56)+0 7.62/7.68 Such that:aux(17) =< Q1+1 7.62/7.68 s(55) =< aux(17) 7.62/7.68 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=M1+1,0>=W1+1,K>=1,R>=2,Q1>=0] 7.62/7.68 7.62/7.68 * Chain [82]: 4*s(60)+1*s(61)+0 7.62/7.68 Such that:aux(18) =< Q1+1 7.62/7.68 s(60) =< aux(18) 7.62/7.68 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=M1+1,K>=1,R>=2,Q1>=0,W1>=1] 7.62/7.68 7.62/7.68 * Chain [81]: 1*aux(19)+0 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=M1+1,K>=1,R>=2,W1>=1] 7.62/7.68 7.62/7.68 * Chain [80]: 1*aux(20)+0 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=W1+1,K>=1,R>=2,M1>=1] 7.62/7.68 7.62/7.68 * Chain [79]: 4*s(67)+1*s(68)+0 7.62/7.68 Such that:aux(21) =< Q1+1 7.62/7.68 s(67) =< aux(21) 7.62/7.68 7.62/7.68 with precondition: [S=0,B2=1,R=T,0>=W1+1,K>=1,R>=2,M1>=1,Q1>=0] 7.62/7.68 7.62/7.68 * Chain [78]: 4*s(72)+1*s(73)+0 7.62/7.68 Such that:aux(22) =< Q1+1 7.62/7.68 s(72) =< aux(22) 7.62/7.68 7.62/7.68 with precondition: [S=0,B2=1,R=T,K>=1,R>=2,M1>=1,Q1>=0,W1>=1] 7.62/7.68 7.62/7.68 * Chain [77]: 1*aux(23)+0 7.62/7.68 with precondition: [S=0,B2=1,R=T,K>=1,R>=2,M1>=1,W1>=1] 7.62/7.68 7.62/7.68 * Chain [76]: 4*s(80)+2*s(81)+1*s(82)+2*s(87)+0 7.62/7.68 Such that:s(84) =< R+1 7.62/7.68 s(78) =< T+1 7.62/7.68 aux(24) =< Q1+1 7.62/7.68 aux(25) =< B2 7.62/7.68 s(80) =< aux(24) 7.62/7.68 s(87) =< s(84) 7.62/7.68 s(87) =< aux(25) 7.62/7.68 s(81) =< s(78) 7.62/7.68 s(81) =< aux(25) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,0>=M1+1,0>=W1+1,R>=2,Q1>=0,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [75]: 4*s(90)+1*s(91)+0 7.62/7.68 Such that:aux(26) =< T+1 7.62/7.68 aux(27) =< B2 7.62/7.68 s(90) =< aux(26) 7.62/7.68 s(90) =< aux(27) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,0>=M1+1,0>=W1+1,R>=2,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [74]: 4*s(98)+2*s(99)+1*s(100)+2*s(105)+0 7.62/7.68 Such that:s(102) =< R+1 7.62/7.68 s(96) =< T+1 7.62/7.68 aux(28) =< Q1+1 7.62/7.68 aux(29) =< B2 7.62/7.68 s(98) =< aux(28) 7.62/7.68 s(105) =< s(102) 7.62/7.68 s(105) =< aux(29) 7.62/7.68 s(99) =< s(96) 7.62/7.68 s(99) =< aux(29) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,0>=M1+1,R>=2,Q1>=0,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [73]: 4*s(108)+1*s(109)+0 7.62/7.68 Such that:aux(30) =< T+1 7.62/7.68 aux(31) =< B2 7.62/7.68 s(108) =< aux(30) 7.62/7.68 s(108) =< aux(31) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,0>=M1+1,R>=2,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [72]: 4*s(114)+2*s(115)+0 7.62/7.68 Such that:aux(32) =< R+1 7.62/7.68 s(114) =< aux(32) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,0>=W1+1,R>=2] 7.62/7.68 7.62/7.68 * Chain [71]: 4*s(122)+2*s(123)+1*s(124)+2*s(129)+0 7.62/7.68 Such that:s(126) =< R+1 7.62/7.68 s(120) =< T+1 7.62/7.68 aux(33) =< Q1+1 7.62/7.68 aux(34) =< B2 7.62/7.68 s(122) =< aux(33) 7.62/7.68 s(129) =< s(126) 7.62/7.68 s(129) =< aux(34) 7.62/7.68 s(123) =< s(120) 7.62/7.68 s(123) =< aux(34) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,0>=W1+1,R>=2,M1>=1,Q1>=0,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [70]: 4*s(132)+1*s(133)+0 7.62/7.68 Such that:aux(35) =< T+1 7.62/7.68 aux(36) =< B2 7.62/7.68 s(132) =< aux(35) 7.62/7.68 s(132) =< aux(36) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,0>=W1+1,R>=2,M1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [69]: 4*s(140)+2*s(141)+1*s(142)+2*s(147)+0 7.62/7.68 Such that:s(144) =< R+1 7.62/7.68 s(138) =< T+1 7.62/7.68 aux(37) =< Q1+1 7.62/7.68 aux(38) =< B2 7.62/7.68 s(140) =< aux(37) 7.62/7.68 s(147) =< s(144) 7.62/7.68 s(147) =< aux(38) 7.62/7.68 s(141) =< s(138) 7.62/7.68 s(141) =< aux(38) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,R>=2,M1>=1,Q1>=0,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [68]: 4*s(150)+1*s(151)+0 7.62/7.68 Such that:aux(39) =< T+1 7.62/7.68 aux(40) =< B2 7.62/7.68 s(150) =< aux(39) 7.62/7.68 s(150) =< aux(40) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,R>=2,M1>=1,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [67]: 4*s(156)+2*s(157)+0 7.62/7.68 Such that:aux(41) =< R+1 7.62/7.68 s(156) =< aux(41) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=K+1,R>=2,W1>=1] 7.62/7.68 7.62/7.68 * Chain [66]: 4*s(164)+2*s(165)+1*s(166)+2*s(171)+0 7.62/7.68 Such that:s(168) =< R+1 7.62/7.68 s(162) =< T+1 7.62/7.68 aux(42) =< Q1+1 7.62/7.68 aux(43) =< B2 7.62/7.68 s(164) =< aux(42) 7.62/7.68 s(171) =< s(168) 7.62/7.68 s(171) =< aux(43) 7.62/7.68 s(165) =< s(162) 7.62/7.68 s(165) =< aux(43) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=M1+1,0>=W1+1,K>=1,R>=2,Q1>=0,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [65]: 4*s(174)+1*s(175)+0 7.62/7.68 Such that:aux(44) =< T+1 7.62/7.68 aux(45) =< B2 7.62/7.68 s(174) =< aux(44) 7.62/7.68 s(174) =< aux(45) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=M1+1,0>=W1+1,K>=1,R>=2,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [64]: 4*s(182)+2*s(183)+1*s(184)+2*s(189)+0 7.62/7.68 Such that:s(186) =< R+1 7.62/7.68 s(180) =< T+1 7.62/7.68 aux(46) =< Q1+1 7.62/7.68 aux(47) =< B2 7.62/7.68 s(182) =< aux(46) 7.62/7.68 s(189) =< s(186) 7.62/7.68 s(189) =< aux(47) 7.62/7.68 s(183) =< s(180) 7.62/7.68 s(183) =< aux(47) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=M1+1,K>=1,R>=2,Q1>=0,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [63]: 4*s(192)+1*s(193)+0 7.62/7.68 Such that:aux(48) =< T+1 7.62/7.68 aux(49) =< B2 7.62/7.68 s(192) =< aux(48) 7.62/7.68 s(192) =< aux(49) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=M1+1,K>=1,R>=2,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [62]: 4*s(198)+2*s(199)+0 7.62/7.68 Such that:aux(50) =< R+1 7.62/7.68 s(198) =< aux(50) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=W1+1,K>=1,R>=2] 7.62/7.68 7.62/7.68 * Chain [61]: 4*s(206)+2*s(207)+1*s(208)+2*s(213)+0 7.62/7.68 Such that:s(210) =< R+1 7.62/7.68 s(204) =< T+1 7.62/7.68 aux(51) =< Q1+1 7.62/7.68 aux(52) =< B2 7.62/7.68 s(206) =< aux(51) 7.62/7.68 s(213) =< s(210) 7.62/7.68 s(213) =< aux(52) 7.62/7.68 s(207) =< s(204) 7.62/7.68 s(207) =< aux(52) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=W1+1,K>=1,R>=2,M1>=1,Q1>=0,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [60]: 4*s(216)+1*s(217)+0 7.62/7.68 Such that:aux(53) =< T+1 7.62/7.68 aux(54) =< B2 7.62/7.68 s(216) =< aux(53) 7.62/7.68 s(216) =< aux(54) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,0>=W1+1,K>=1,R>=2,M1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [59]: 4*s(224)+2*s(225)+1*s(226)+2*s(231)+0 7.62/7.68 Such that:s(228) =< R+1 7.62/7.68 s(222) =< T+1 7.62/7.68 aux(55) =< Q1+1 7.62/7.68 aux(56) =< B2 7.62/7.68 s(224) =< aux(55) 7.62/7.68 s(231) =< s(228) 7.62/7.68 s(231) =< aux(56) 7.62/7.68 s(225) =< s(222) 7.62/7.68 s(225) =< aux(56) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,K>=1,R>=2,M1>=1,Q1>=0,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [58]: 4*s(234)+1*s(235)+0 7.62/7.68 Such that:aux(57) =< T+1 7.62/7.68 aux(58) =< B2 7.62/7.68 s(234) =< aux(57) 7.62/7.68 s(234) =< aux(58) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,K>=1,R>=2,M1>=1,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 7.62/7.68 * Chain [57]: 4*s(240)+2*s(241)+0 7.62/7.68 Such that:aux(59) =< R+1 7.62/7.68 s(240) =< aux(59) 7.62/7.68 7.62/7.68 with precondition: [S=0,R=T,K>=1,R>=2,W1>=1] 7.62/7.68 7.62/7.68 7.62/7.68 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,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,F3): 7.62/7.68 ------------------------------------- 7.62/7.68 * Chain [94] with precondition: [] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [93] with precondition: [K=0,M1=0] 7.62/7.68 - Upper bound: 0 7.62/7.68 - Complexity: constant 7.62/7.68 * Chain [92] with precondition: [S=0,B2=1,R=T,0>=K+1,0>=M1+1,0>=W1+1,R>=2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [91] with precondition: [S=0,B2=1,R=T,0>=K+1,0>=M1+1,0>=W1+1,R>=2,Q1>=0] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [90] with precondition: [S=0,B2=1,R=T,0>=K+1,0>=M1+1,R>=2,Q1>=0,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [89] with precondition: [S=0,B2=1,R=T,0>=K+1,0>=M1+1,R>=2,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [88] with precondition: [S=0,B2=1,R=T,0>=K+1,0>=W1+1,R>=2,M1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [87] with precondition: [S=0,B2=1,R=T,0>=K+1,0>=W1+1,R>=2,M1>=1,Q1>=0] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [86] with precondition: [S=0,B2=1,R=T,0>=K+1,R>=2,M1>=1,Q1>=0,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [85] with precondition: [S=0,B2=1,R=T,0>=K+1,R>=2,M1>=1,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [84] with precondition: [S=0,B2=1,R=T,0>=M1+1,0>=W1+1,K>=1,R>=2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [83] with precondition: [S=0,B2=1,R=T,0>=M1+1,0>=W1+1,K>=1,R>=2,Q1>=0] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [82] with precondition: [S=0,B2=1,R=T,0>=M1+1,K>=1,R>=2,Q1>=0,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [81] with precondition: [S=0,B2=1,R=T,0>=M1+1,K>=1,R>=2,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [80] with precondition: [S=0,B2=1,R=T,0>=W1+1,K>=1,R>=2,M1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [79] with precondition: [S=0,B2=1,R=T,0>=W1+1,K>=1,R>=2,M1>=1,Q1>=0] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [78] with precondition: [S=0,B2=1,R=T,K>=1,R>=2,M1>=1,Q1>=0,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [77] with precondition: [S=0,B2=1,R=T,K>=1,R>=2,M1>=1,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [76] with precondition: [S=0,R=T,0>=K+1,0>=M1+1,0>=W1+1,R>=2,Q1>=0,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [75] with precondition: [S=0,R=T,0>=K+1,0>=M1+1,0>=W1+1,R>=2,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [74] with precondition: [S=0,R=T,0>=K+1,0>=M1+1,R>=2,Q1>=0,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [73] with precondition: [S=0,R=T,0>=K+1,0>=M1+1,R>=2,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [72] with precondition: [S=0,R=T,0>=K+1,0>=W1+1,R>=2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [71] with precondition: [S=0,R=T,0>=K+1,0>=W1+1,R>=2,M1>=1,Q1>=0,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [70] with precondition: [S=0,R=T,0>=K+1,0>=W1+1,R>=2,M1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [69] with precondition: [S=0,R=T,0>=K+1,R>=2,M1>=1,Q1>=0,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [68] with precondition: [S=0,R=T,0>=K+1,R>=2,M1>=1,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [67] with precondition: [S=0,R=T,0>=K+1,R>=2,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [66] with precondition: [S=0,R=T,0>=M1+1,0>=W1+1,K>=1,R>=2,Q1>=0,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [65] with precondition: [S=0,R=T,0>=M1+1,0>=W1+1,K>=1,R>=2,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [64] with precondition: [S=0,R=T,0>=M1+1,K>=1,R>=2,Q1>=0,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [63] with precondition: [S=0,R=T,0>=M1+1,K>=1,R>=2,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [62] with precondition: [S=0,R=T,0>=W1+1,K>=1,R>=2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [61] with precondition: [S=0,R=T,0>=W1+1,K>=1,R>=2,M1>=1,Q1>=0,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [60] with precondition: [S=0,R=T,0>=W1+1,K>=1,R>=2,M1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [59] with precondition: [S=0,R=T,K>=1,R>=2,M1>=1,Q1>=0,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [58] with precondition: [S=0,R=T,K>=1,R>=2,M1>=1,W1>=1,B2>=2,R+1>=B2] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 * Chain [57] with precondition: [S=0,R=T,K>=1,R>=2,W1>=1] 7.62/7.68 - Upper bound: inf 7.62/7.68 - Complexity: infinity 7.62/7.68 7.62/7.68 ### 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,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,F3): inf 7.62/7.68 Asymptotic class: infinity 7.62/7.68 * Total analysis performed in 6763 ms. 7.62/7.68 7.68/7.78 EOF