5.93/5.95 MAYBE 5.93/5.95 5.93/5.95 Preprocessing Cost Relations 5.93/5.95 ===================================== 5.93/5.95 5.93/5.95 #### Computed strongly connected components 5.93/5.95 0. recursive : [f34/21,f44/21] 5.93/5.95 1. non_recursive : [exit_location/1] 5.93/5.95 2. recursive : [f65/21,f75/21,f79/21,f81/21] 5.93/5.95 3. recursive : [f100/21] 5.93/5.95 4. recursive : [f132/29] 5.93/5.95 5. recursive : [f191/25] 5.93/5.95 6. recursive : [f216/1] 5.93/5.95 7. non_recursive : [f216_loop_cont/2] 5.93/5.95 8. non_recursive : [f191_loop_cont/65] 5.93/5.95 9. non_recursive : [f132_loop_cont/65] 5.93/5.95 10. non_recursive : [f100_loop_cont/65] 5.93/5.95 11. non_recursive : [f65_loop_cont/65] 5.93/5.95 12. non_recursive : [f34_loop_cont/65] 5.93/5.95 13. non_recursive : [f0/64] 5.93/5.95 5.93/5.95 #### Obtained direct recursion through partial evaluation 5.93/5.95 0. SCC is partially evaluated into f34/21 5.93/5.95 1. SCC is completely evaluated into other SCCs 5.93/5.95 2. SCC is partially evaluated into f65/21 5.93/5.95 3. SCC is partially evaluated into f100/21 5.93/5.95 4. SCC is partially evaluated into f132/29 5.93/5.95 5. SCC is partially evaluated into f191/25 5.93/5.95 6. SCC is partially evaluated into f216/1 5.93/5.95 7. SCC is completely evaluated into other SCCs 5.93/5.95 8. SCC is partially evaluated into f191_loop_cont/65 5.93/5.95 9. SCC is partially evaluated into f132_loop_cont/65 5.93/5.95 10. SCC is partially evaluated into f100_loop_cont/65 5.93/5.95 11. SCC is partially evaluated into f65_loop_cont/65 5.93/5.95 12. SCC is partially evaluated into f34_loop_cont/65 5.93/5.95 13. SCC is partially evaluated into f0/64 5.93/5.95 5.93/5.95 Control-Flow Refinement of Cost Relations 5.93/5.95 ===================================== 5.93/5.95 5.93/5.95 ### Specialization of cost equations f34/21 5.93/5.95 * CE 8 is refined into CE [52] 5.93/5.95 * CE 9 is refined into CE [53] 5.93/5.95 * CE 3 is refined into CE [54] 5.93/5.95 * CE 5 is refined into CE [55] 5.93/5.95 * CE 4 is refined into CE [56] 5.93/5.95 * CE 6 is refined into CE [57] 5.93/5.95 * CE 7 is refined into CE [58] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f34/21 5.93/5.95 * CEs [54] --> Loop 51 5.93/5.95 * CEs [55] --> Loop 52 5.93/5.95 * CEs [56] --> Loop 53 5.93/5.95 * CEs [57] --> Loop 54 5.93/5.95 * CEs [58] --> Loop 55 5.93/5.95 * CEs [52] --> Loop 56 5.93/5.95 * CEs [53] --> Loop 57 5.93/5.95 5.93/5.95 ### Ranking functions of CR f34(B,C,D,E,G,S,W,Z1,A2,B2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3) 5.93/5.95 * RF of phase [51,52,53,54,55]: [B] 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f34(B,C,D,E,G,S,W,Z1,A2,B2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3) 5.93/5.95 * Partial RF of phase [51,52,53,54,55]: 5.93/5.95 - RF of loop [51:1,52:1,53:1,54:1,55:1]: 5.93/5.95 B 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f65/21 5.93/5.95 * CE 28 is refined into CE [59] 5.93/5.95 * CE 29 is refined into CE [60] 5.93/5.95 * CE 24 is refined into CE [61] 5.93/5.95 * CE 26 is refined into CE [62] 5.93/5.95 * CE 25 is refined into CE [63] 5.93/5.95 * CE 27 is refined into CE [64] 5.93/5.95 * CE 16 is refined into CE [65] 5.93/5.95 * CE 18 is refined into CE [66] 5.93/5.95 * CE 17 is refined into CE [67] 5.93/5.95 * CE 19 is refined into CE [68] 5.93/5.95 * CE 20 is refined into CE [69] 5.93/5.95 * CE 22 is refined into CE [70] 5.93/5.95 * CE 21 is refined into CE [71] 5.93/5.95 * CE 23 is refined into CE [72] 5.93/5.95 * CE 12 is refined into CE [73] 5.93/5.95 * CE 14 is refined into CE [74] 5.93/5.95 * CE 13 is refined into CE [75] 5.93/5.95 * CE 15 is refined into CE [76] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f65/21 5.93/5.95 * CEs [61] --> Loop 58 5.93/5.95 * CEs [62] --> Loop 59 5.93/5.95 * CEs [63] --> Loop 60 5.93/5.95 * CEs [64] --> Loop 61 5.93/5.95 * CEs [65] --> Loop 62 5.93/5.95 * CEs [66] --> Loop 63 5.93/5.95 * CEs [67] --> Loop 64 5.93/5.95 * CEs [68] --> Loop 65 5.93/5.95 * CEs [69] --> Loop 66 5.93/5.95 * CEs [70] --> Loop 67 5.93/5.95 * CEs [71] --> Loop 68 5.93/5.95 * CEs [72] --> Loop 69 5.93/5.95 * CEs [73] --> Loop 70 5.93/5.95 * CEs [74] --> Loop 71 5.93/5.95 * CEs [75] --> Loop 72 5.93/5.95 * CEs [76] --> Loop 73 5.93/5.95 * CEs [59] --> Loop 74 5.93/5.95 * CEs [60] --> Loop 75 5.93/5.95 5.93/5.95 ### Ranking functions of CR f65(A,F,G,H,I,S,W,Q1,X1,Y1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3) 5.93/5.95 * RF of phase [58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73]: [G] 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f65(A,F,G,H,I,S,W,Q1,X1,Y1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3) 5.93/5.95 * Partial RF of phase [58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73]: 5.93/5.95 - RF of loop [58:1,59:1,60:1,61:1,62:1,63:1,64:1,65:1,66:1,67:1,68:1,69:1,70:1,71:1,72:1,73:1]: 5.93/5.95 G 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f100/21 5.93/5.95 * CE 32 is refined into CE [77] 5.93/5.95 * CE 34 is refined into CE [78] 5.93/5.95 * CE 33 is refined into CE [79] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f100/21 5.93/5.95 * CEs [79] --> Loop 76 5.93/5.95 * CEs [77] --> Loop 77 5.93/5.95 * CEs [78] --> Loop 78 5.93/5.95 5.93/5.95 ### Ranking functions of CR f100(S,V,W,Q1,R1,S1,T1,U1,V1,W1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3) 5.93/5.95 * RF of phase [76]: [Q1] 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f100(S,V,W,Q1,R1,S1,T1,U1,V1,W1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3) 5.93/5.95 * Partial RF of phase [76]: 5.93/5.95 - RF of loop [76:1]: 5.93/5.95 Q1 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f132/29 5.93/5.95 * CE 37 is refined into CE [80] 5.93/5.95 * CE 40 is refined into CE [81] 5.93/5.95 * CE 38 is refined into CE [82] 5.93/5.95 * CE 39 is refined into CE [83] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f132/29 5.93/5.95 * CEs [82] --> Loop 79 5.93/5.95 * CEs [83] --> Loop 80 5.93/5.95 * CEs [80] --> Loop 81 5.93/5.95 * CEs [81] --> Loop 82 5.93/5.95 5.93/5.95 ### Ranking functions of CR f132(J,S,V,W,X,Y,A1,E1,K1,L1,M1,N1,O1,P1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3) 5.93/5.95 * RF of phase [79,80]: [V] 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f132(J,S,V,W,X,Y,A1,E1,K1,L1,M1,N1,O1,P1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3) 5.93/5.95 * Partial RF of phase [79,80]: 5.93/5.95 - RF of loop [79:1,80:1]: 5.93/5.95 V 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f191/25 5.93/5.95 * CE 46 is discarded (unfeasible) 5.93/5.95 * CE 45 is refined into CE [84] 5.93/5.95 * CE 47 is refined into CE [85] 5.93/5.95 * CE 44 is discarded (unfeasible) 5.93/5.95 * CE 43 is refined into CE [86] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f191/25 5.93/5.95 * CEs [86] --> Loop 83 5.93/5.95 * CEs [84] --> Loop 84 5.93/5.95 * CEs [85] --> Loop 85 5.93/5.95 5.93/5.95 ### Ranking functions of CR f191(J,K,L,M,N,O,P,Q,R,S,T,U,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 5.93/5.95 * RF of phase [83]: [J] 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f191(J,K,L,M,N,O,P,Q,R,S,T,U,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 5.93/5.95 * Partial RF of phase [83]: 5.93/5.95 - RF of loop [83:1]: 5.93/5.95 J 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f216/1 5.93/5.95 * CE 51 is refined into CE [87] 5.93/5.95 * CE 50 is refined into CE [88] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f216/1 5.93/5.95 * CEs [88] --> Loop 86 5.93/5.95 * CEs [87] --> Loop 87 5.93/5.95 5.93/5.95 ### Ranking functions of CR f216(Q2) 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f216(Q2) 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f191_loop_cont/65 5.93/5.95 * CE 49 is refined into CE [89,90] 5.93/5.95 * CE 48 is refined into CE [91] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f191_loop_cont/65 5.93/5.95 * CEs [89] --> Loop 88 5.93/5.95 * CEs [91] --> Loop 89 5.93/5.95 * CEs [90] --> Loop 90 5.93/5.95 5.93/5.95 ### Ranking functions of CR f191_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) 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f191_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) 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f132_loop_cont/65 5.93/5.95 * CE 42 is refined into CE [92,93,94,95,96,97] 5.93/5.95 * CE 41 is refined into CE [98] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f132_loop_cont/65 5.93/5.95 * CEs [92,94] --> Loop 91 5.93/5.95 * CEs [96] --> Loop 92 5.93/5.95 * CEs [93] --> Loop 93 5.93/5.95 * CEs [98] --> Loop 94 5.93/5.95 * CEs [95] --> Loop 95 5.93/5.95 * CEs [97] --> Loop 96 5.93/5.95 5.93/5.95 ### Ranking functions of CR f132_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) 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f132_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) 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f100_loop_cont/65 5.93/5.95 * CE 36 is refined into CE [99,100,101,102,103,104,105,106,107,108,109,110] 5.93/5.95 * CE 35 is refined into CE [111] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f100_loop_cont/65 5.93/5.95 * CEs [100,101,102,103] --> Loop 97 5.93/5.95 * CEs [106,107,108] --> Loop 98 5.93/5.95 * CEs [99] --> Loop 99 5.93/5.95 * CEs [111] --> Loop 100 5.93/5.95 * CEs [104,105] --> Loop 101 5.93/5.95 * CEs [109,110] --> Loop 102 5.93/5.95 5.93/5.95 ### Ranking functions of CR f100_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) 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f100_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) 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f65_loop_cont/65 5.93/5.95 * CE 31 is refined into CE [112,113,114,115,116,117,118,119,120,121,122,123] 5.93/5.95 * CE 30 is refined into CE [124] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f65_loop_cont/65 5.93/5.95 * CEs [113,114,115,116] --> Loop 103 5.93/5.95 * CEs [119,120,121] --> Loop 104 5.93/5.95 * CEs [112] --> Loop 105 5.93/5.95 * CEs [124] --> Loop 106 5.93/5.95 * CEs [117,118] --> Loop 107 5.93/5.95 * CEs [122,123] --> Loop 108 5.93/5.95 5.93/5.95 ### Ranking functions of CR f65_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) 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f65_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) 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f34_loop_cont/65 5.93/5.95 * CE 11 is refined into CE [125,126,127,128,129,130,131,132,133,134,135,136] 5.93/5.95 * CE 10 is refined into CE [137] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f34_loop_cont/65 5.93/5.95 * CEs [126,127,128,129] --> Loop 109 5.93/5.95 * CEs [132,133,134] --> Loop 110 5.93/5.95 * CEs [125] --> Loop 111 5.93/5.95 * CEs [137] --> Loop 112 5.93/5.95 * CEs [130,131] --> Loop 113 5.93/5.95 * CEs [135,136] --> Loop 114 5.93/5.95 5.93/5.95 ### Ranking functions of CR f34_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) 5.93/5.95 5.93/5.95 #### Partial ranking functions of CR f34_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) 5.93/5.95 5.93/5.95 5.93/5.95 ### Specialization of cost equations f0/64 5.93/5.95 * CE 1 is refined into CE [138,139,140,141,142,143,144,145,146,147,148,149] 5.93/5.95 * CE 2 is refined into CE [150,151,152,153,154,155,156,157,158,159,160,161] 5.93/5.95 5.93/5.95 5.93/5.95 ### Cost equations --> "Loop" of f0/64 5.93/5.95 * CEs [143,144,148,149,155,156,160,161] --> Loop 115 5.93/5.95 * CEs [138,139,140,141,142,145,146,147,150,151,152,153,154,157,158,159] --> Loop 116 5.93/5.95 5.93/5.95 ### 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,H2,I2,J2,K2,Q2) 5.93/5.95 5.93/5.95 #### 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,H2,I2,J2,K2,Q2) 5.93/5.95 5.93/5.95 5.93/5.95 Computing Bounds 5.93/5.95 ===================================== 5.93/5.95 5.93/5.95 #### Cost of chains of f34(B,C,D,E,G,S,W,Z1,A2,B2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3): 5.93/5.95 * Chain [[51,52,53,54,55],57]: 5*it(51)+0 5.93/5.95 Such that:aux(3) =< B 5.93/5.95 it(51) =< aux(3) 5.93/5.95 5.93/5.95 with precondition: [S=0,W=0,Q2=2,B>=1] 5.93/5.95 5.93/5.95 * Chain [[51,52,53,54,55],56]: 5*it(51)+0 5.93/5.95 Such that:aux(4) =< B 5.93/5.95 it(51) =< aux(4) 5.93/5.95 5.93/5.95 with precondition: [S=0,W=0,Q2=7,R2=0,W2=0,X2=0,V2=A3,B>=1] 5.93/5.95 5.93/5.95 * Chain [57]: 0 5.93/5.95 with precondition: [S=0,W=0,Q2=2] 5.93/5.95 5.93/5.95 * Chain [56]: 0 5.93/5.95 with precondition: [S=0,W=0,Q2=7,W2=0,X2=0,S2=C,T2=D,U2=E,Y2=Z1,B=R2,A3=V2,0>=B] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f65(A,F,G,H,I,S,W,Q1,X1,Y1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3): 5.93/5.95 * Chain [[58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73],75]: 16*it(58)+0 5.93/5.95 Such that:aux(7) =< G 5.93/5.95 it(58) =< aux(7) 5.93/5.95 5.93/5.95 with precondition: [Q2=2,G>=1] 5.93/5.95 5.93/5.95 * Chain [[58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73],74]: 16*it(58)+0 5.93/5.95 Such that:aux(8) =< G 5.93/5.95 it(58) =< aux(8) 5.93/5.95 5.93/5.95 with precondition: [Q2=6,T2=0,W2=0,X2=0,Y2=A3,G>=1] 5.93/5.95 5.93/5.95 * Chain [75]: 0 5.93/5.95 with precondition: [Q2=2] 5.93/5.95 5.93/5.95 * Chain [74]: 0 5.93/5.95 with precondition: [Q2=6,W2=0,X2=0,R2=A,S2=F,U2=H,V2=I,G=T2,A3=Y2,0>=G] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f100(S,V,W,Q1,R1,S1,T1,U1,V1,W1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3): 5.93/5.95 * Chain [[76],78]: 1*it(76)+0 5.93/5.95 Such that:it(76) =< Q1 5.93/5.95 5.93/5.95 with precondition: [Q2=2,Q1>=1] 5.93/5.95 5.93/5.95 * Chain [[76],77]: 1*it(76)+0 5.93/5.95 Such that:it(76) =< Q1 5.93/5.95 5.93/5.95 with precondition: [Q2=5,R2=0,T2=0,U2=0,S2=W2,X2=A3,Q1>=1] 5.93/5.95 5.93/5.95 * Chain [78]: 0 5.93/5.95 with precondition: [Q2=2] 5.93/5.95 5.93/5.95 * Chain [77]: 0 5.93/5.95 with precondition: [Q2=5,R2=0,T2=0,X2=T1,Y2=U1,Z2=V1,A3=W1,W2=S2,Q1=U2,0>=Q1] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f132(J,S,V,W,X,Y,A1,E1,K1,L1,M1,N1,O1,P1,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3): 5.93/5.95 * Chain [[79,80],82]: 2*it(79)+0 5.93/5.95 Such that:aux(11) =< V 5.93/5.95 it(79) =< aux(11) 5.93/5.95 5.93/5.95 with precondition: [Q2=2,V>=1] 5.93/5.95 5.93/5.95 * Chain [[79,80],81]: 2*it(79)+0 5.93/5.95 Such that:aux(12) =< V 5.93/5.95 it(79) =< aux(12) 5.93/5.95 5.93/5.95 with precondition: [Q2=4,S2=0,T2=0,U2=0,R2=W2,V>=1] 5.93/5.95 5.93/5.95 * Chain [82]: 0 5.93/5.95 with precondition: [Q2=2] 5.93/5.95 5.93/5.95 * Chain [81]: 0 5.93/5.95 with precondition: [Q2=4,S2=0,U2=0,X2=A1,Y2=E1,Z2=K1,A3=L1,B3=M1,C3=N1,D3=O1,E3=P1,W2=R2,V=T2,0>=V] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f191(J,K,L,M,N,O,P,Q,R,S,T,U,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3): 5.93/5.95 * Chain [[83],85]: 1*it(83)+0 5.93/5.95 Such that:it(83) =< J 5.93/5.95 5.93/5.95 with precondition: [R=0,U=0,Q2=2,1>=K,J>=1,K>=0] 5.93/5.95 5.93/5.95 * Chain [[83],84]: 1*it(83)+0 5.93/5.95 Such that:it(83) =< J 5.93/5.95 5.93/5.95 with precondition: [R=0,U=0,Q2=3,R2=0,S2=1,T2=0,V2=0,W2=0,X2=2,Z2=0,A3=0,C3=1,U2=Y2,1>=K,J>=1,K>=0] 5.93/5.95 5.93/5.95 * Chain [85]: 0 5.93/5.95 with precondition: [R=0,U=0,Q2=2,1>=K,K>=0] 5.93/5.95 5.93/5.95 * Chain [84]: 0 5.93/5.95 with precondition: [R=0,U=0,Q2=3,Z2=0,A3=0,C3=1,T2=L,U2=M,V2=N,W2=O,X2=P,Y2=Q,J=R2,K=S2,0>=J,1>=K,K>=0] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f216(Q2): 5.93/5.95 * Chain [[86]]...: 1*it(86)+0 5.93/5.95 with precondition: [Q2=2] 5.93/5.95 5.93/5.95 * Chain [[86],87]: 1*it(86)+0 5.93/5.95 with precondition: [Q2=2] 5.93/5.95 5.93/5.95 * Chain [87]: 0 5.93/5.95 with precondition: [Q2=2] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f191_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): 5.93/5.95 * Chain [90]...: 1*s(2)+0 5.93/5.95 with precondition: [A=3,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [89]: 0 5.93/5.95 with precondition: [A=2,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [88]: 1*s(3)+0 5.93/5.95 with precondition: [A=3,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f132_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): 5.93/5.95 * Chain [96]...: 1*s(4)+0 5.93/5.95 with precondition: [A=4,L=0,S=0,V=0,D2=0,E2=0,H2=0,0>=K] 5.93/5.95 5.93/5.95 * Chain [95]...: 1*s(5)+1*s(6)+0 5.93/5.95 Such that:s(5) =< K 5.93/5.95 5.93/5.95 with precondition: [A=4,L=0,S=0,V=0,D2=0,E2=0,H2=0,K>=1] 5.93/5.95 5.93/5.95 * Chain [94]: 0 5.93/5.95 with precondition: [A=2,L=0,S=0,V=0,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [93]: 0 5.93/5.95 with precondition: [A=4,L=0,S=0,V=0,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [92]: 1*s(7)+0 5.93/5.95 with precondition: [A=4,L=0,S=0,V=0,D2=0,E2=0,H2=0,0>=K] 5.93/5.95 5.93/5.95 * Chain [91]: 2*s(8)+1*s(10)+0 5.93/5.95 Such that:aux(14) =< K 5.93/5.95 s(8) =< aux(14) 5.93/5.95 5.93/5.95 with precondition: [A=4,L=0,S=0,V=0,D2=0,E2=0,H2=0,K>=1] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f100_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): 5.93/5.95 * Chain [102]...: 1*aux(15)+0 5.93/5.95 with precondition: [A=5,L=0,S=0,V=0,D2=0,E2=0,H2=0,0>=W] 5.93/5.95 5.93/5.95 * Chain [101]...: 4*s(15)+3*s(16)+0 5.93/5.95 Such that:aux(16) =< W 5.93/5.95 s(15) =< aux(16) 5.93/5.95 5.93/5.95 with precondition: [A=5,L=0,S=0,V=0,D2=0,E2=0,H2=0,W>=1] 5.93/5.95 5.93/5.95 * Chain [100]: 0 5.93/5.95 with precondition: [A=2,L=0,S=0,V=0,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [99]: 0 5.93/5.95 with precondition: [A=5,L=0,S=0,V=0,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [98]: 1*aux(17)+0 5.93/5.95 with precondition: [A=5,L=0,S=0,V=0,D2=0,E2=0,H2=0,0>=W] 5.93/5.95 5.93/5.95 * Chain [97]: 8*s(26)+4*s(31)+0 5.93/5.95 Such that:aux(18) =< W 5.93/5.95 s(26) =< aux(18) 5.93/5.95 5.93/5.95 with precondition: [A=5,L=0,S=0,V=0,D2=0,E2=0,H2=0,W>=1] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f65_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): 5.93/5.95 * Chain [108]...: 1*aux(19)+0 5.93/5.95 with precondition: [A=6,L=0,S=0,V=0,D2=0,E2=0,H2=0,0>=R1] 5.93/5.95 5.93/5.95 * Chain [107]...: 2*s(41)+8*s(42)+0 5.93/5.95 Such that:aux(20) =< R1 5.93/5.95 s(41) =< aux(20) 5.93/5.95 5.93/5.95 with precondition: [A=6,L=0,S=0,V=0,D2=0,E2=0,H2=0,R1>=1] 5.93/5.95 5.93/5.95 * Chain [106]: 0 5.93/5.95 with precondition: [A=2,L=0,S=0,V=0,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [105]: 0 5.93/5.95 with precondition: [A=6,L=0,S=0,V=0,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [104]: 1*aux(21)+0 5.93/5.95 with precondition: [A=6,L=0,S=0,V=0,D2=0,E2=0,H2=0,0>=R1] 5.93/5.95 5.93/5.95 * Chain [103]: 4*s(51)+13*s(54)+0 5.93/5.95 Such that:aux(22) =< R1 5.93/5.95 s(51) =< aux(22) 5.93/5.95 5.93/5.95 with precondition: [A=6,L=0,S=0,V=0,D2=0,E2=0,H2=0,R1>=1] 5.93/5.95 5.93/5.95 5.93/5.95 #### Cost of chains of f34_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): 5.93/5.95 * Chain [114]...: 1*aux(23)+0 5.93/5.95 with precondition: [A=7,L=0,S=0,V=0,D2=0,E2=0,H2=0,0>=H] 5.93/5.95 5.93/5.95 * Chain [113]...: 32*s(64)+11*s(65)+0 5.93/5.95 Such that:aux(24) =< H 5.93/5.95 s(64) =< aux(24) 5.93/5.95 5.93/5.95 with precondition: [A=7,L=0,S=0,V=0,D2=0,E2=0,H2=0,H>=1] 5.93/5.95 5.93/5.95 * Chain [112]: 0 5.93/5.95 with precondition: [A=2,L=0,S=0,V=0,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [111]: 0 5.93/5.95 with precondition: [A=7,L=0,S=0,V=0,D2=0,E2=0,H2=0] 5.93/5.95 5.93/5.95 * Chain [110]: 1*aux(25)+0 5.93/5.95 with precondition: [A=7,L=0,S=0,V=0,D2=0,E2=0,H2=0,0>=H] 5.93/5.95 5.93/5.95 * Chain [109]: 64*s(76)+18*s(81)+0 5.93/5.95 Such that:aux(26) =< H 5.93/5.95 s(76) =< aux(26) 5.93/5.95 5.93/5.95 with precondition: [A=7,L=0,S=0,V=0,D2=0,E2=0,H2=0,H>=1] 5.93/5.95 5.93/5.95 5.93/5.95 #### 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,H2,I2,J2,K2,Q2): 5.93/5.95 * Chain [116]: 1*aux(27)+0 5.93/5.95 with precondition: [] 5.93/5.95 5.93/5.95 * Chain [115]...: 1*aux(28)+0 5.93/5.95 with precondition: [] 5.93/5.95 5.93/5.95 5.93/5.95 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,H2,I2,J2,K2,Q2): 5.93/5.95 ------------------------------------- 5.93/5.95 * Chain [116] with precondition: [] 5.93/5.95 - Upper bound: inf 5.93/5.95 - Complexity: infinity 5.93/5.95 * Chain [115]... with precondition: [] 5.93/5.95 - Upper bound: inf 5.93/5.95 - Complexity: infinity 5.93/5.95 5.93/5.95 ### 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,H2,I2,J2,K2,Q2): inf 5.93/5.95 Asymptotic class: infinity 5.93/5.95 * Total analysis performed in 5471 ms. 5.93/5.95 5.96/6.06 EOF