0.63/0.67 WORST_CASE(?,O(n^1)) 0.63/0.67 0.63/0.67 Preprocessing Cost Relations 0.63/0.67 ===================================== 0.63/0.67 0.63/0.67 #### Computed strongly connected components 0.63/0.67 0. recursive : [evalNestedMultiplebb1in/4,evalNestedMultiplebb2in/4,evalNestedMultiplebb3in/4] 0.63/0.67 1. recursive : [evalNestedMultiplebb2in_loop_cont/10,evalNestedMultiplebb4in/9,evalNestedMultiplebb5in/9] 0.63/0.67 2. non_recursive : [evalNestedMultiplestop/6] 0.63/0.67 3. non_recursive : [evalNestedMultiplereturnin/6] 0.63/0.67 4. non_recursive : [exit_location/1] 0.63/0.67 5. non_recursive : [evalNestedMultiplebb5in_loop_cont/7] 0.63/0.67 6. non_recursive : [evalNestedMultipleentryin/6] 0.63/0.67 7. non_recursive : [evalNestedMultiplestart/6] 0.63/0.67 0.63/0.67 #### Obtained direct recursion through partial evaluation 0.63/0.67 0. SCC is partially evaluated into evalNestedMultiplebb2in/4 0.63/0.67 1. SCC is partially evaluated into evalNestedMultiplebb5in/9 0.63/0.67 2. SCC is completely evaluated into other SCCs 0.63/0.67 3. SCC is completely evaluated into other SCCs 0.63/0.67 4. SCC is completely evaluated into other SCCs 0.63/0.67 5. SCC is partially evaluated into evalNestedMultiplebb5in_loop_cont/7 0.63/0.67 6. SCC is partially evaluated into evalNestedMultipleentryin/6 0.63/0.67 7. SCC is partially evaluated into evalNestedMultiplestart/6 0.63/0.67 0.63/0.67 Control-Flow Refinement of Cost Relations 0.63/0.67 ===================================== 0.63/0.67 0.63/0.67 ### Specialization of cost equations evalNestedMultiplebb2in/4 0.63/0.67 * CE 12 is refined into CE [13] 0.63/0.67 * CE 9 is refined into CE [14] 0.63/0.67 * CE 11 is refined into CE [15] 0.63/0.67 * CE 10 is refined into CE [16] 0.63/0.67 0.63/0.67 0.63/0.67 ### Cost equations --> "Loop" of evalNestedMultiplebb2in/4 0.63/0.67 * CEs [16] --> Loop 13 0.63/0.67 * CEs [13] --> Loop 14 0.63/0.67 * CEs [14] --> Loop 15 0.63/0.67 * CEs [15] --> Loop 16 0.63/0.67 0.63/0.67 ### Ranking functions of CR evalNestedMultiplebb2in(C,E,G,H) 0.63/0.67 * RF of phase [13]: [C-E] 0.63/0.67 0.63/0.67 #### Partial ranking functions of CR evalNestedMultiplebb2in(C,E,G,H) 0.63/0.67 * Partial RF of phase [13]: 0.63/0.67 - RF of loop [13:1]: 0.63/0.67 C-E 0.63/0.67 0.63/0.67 0.63/0.67 ### Specialization of cost equations evalNestedMultiplebb5in/9 0.63/0.67 * CE 5 is refined into CE [17] 0.63/0.67 * CE 3 is refined into CE [18,19] 0.63/0.67 * CE 6 is refined into CE [20] 0.63/0.67 * CE 4 is refined into CE [21,22,23,24] 0.63/0.67 0.63/0.67 0.63/0.67 ### Cost equations --> "Loop" of evalNestedMultiplebb5in/9 0.63/0.67 * CEs [24] --> Loop 17 0.63/0.67 * CEs [23] --> Loop 18 0.63/0.67 * CEs [22] --> Loop 19 0.63/0.67 * CEs [21] --> Loop 20 0.63/0.67 * CEs [17] --> Loop 21 0.63/0.67 * CEs [19] --> Loop 22 0.63/0.67 * CEs [18] --> Loop 23 0.63/0.67 * CEs [20] --> Loop 24 0.63/0.67 0.63/0.67 ### Ranking functions of CR evalNestedMultiplebb5in(A,B,C,D,E,G,H,I,J) 0.63/0.67 * RF of phase [17,18]: [A-B] 0.63/0.67 * RF of phase [19]: [A-B] 0.63/0.67 0.63/0.67 #### Partial ranking functions of CR evalNestedMultiplebb5in(A,B,C,D,E,G,H,I,J) 0.63/0.67 * Partial RF of phase [17,18]: 0.63/0.67 - RF of loop [17:1]: 0.63/0.67 C-D-1 0.63/0.67 - RF of loop [17:1,18:1]: 0.63/0.67 A-B 0.63/0.67 * Partial RF of phase [19]: 0.63/0.67 - RF of loop [19:1]: 0.63/0.67 A-B 0.63/0.67 0.63/0.67 0.63/0.67 ### Specialization of cost equations evalNestedMultiplebb5in_loop_cont/7 0.63/0.67 * CE 7 is refined into CE [25] 0.63/0.67 * CE 8 is refined into CE [26] 0.63/0.67 0.63/0.67 0.63/0.67 ### Cost equations --> "Loop" of evalNestedMultiplebb5in_loop_cont/7 0.63/0.67 * CEs [25] --> Loop 25 0.63/0.67 * CEs [26] --> Loop 26 0.63/0.67 0.63/0.67 ### Ranking functions of CR evalNestedMultiplebb5in_loop_cont(A,B,C,D,E,F,G) 0.63/0.67 0.63/0.67 #### Partial ranking functions of CR evalNestedMultiplebb5in_loop_cont(A,B,C,D,E,F,G) 0.63/0.67 0.63/0.67 0.63/0.67 ### Specialization of cost equations evalNestedMultipleentryin/6 0.63/0.67 * CE 2 is refined into CE [27,28,29,30,31,32,33,34,35,36,37,38,39,40] 0.63/0.67 0.63/0.67 0.63/0.67 ### Cost equations --> "Loop" of evalNestedMultipleentryin/6 0.63/0.67 * CEs [36] --> Loop 27 0.63/0.67 * CEs [34] --> Loop 28 0.63/0.67 * CEs [33,38] --> Loop 29 0.63/0.67 * CEs [31] --> Loop 30 0.63/0.67 * CEs [32,37] --> Loop 31 0.63/0.67 * CEs [29,39] --> Loop 32 0.63/0.67 * CEs [30,40] --> Loop 33 0.63/0.67 * CEs [28] --> Loop 34 0.63/0.67 * CEs [35] --> Loop 35 0.63/0.67 * CEs [27] --> Loop 36 0.63/0.67 0.63/0.67 ### Ranking functions of CR evalNestedMultipleentryin(A,B,C,D,E,G) 0.63/0.67 0.63/0.67 #### Partial ranking functions of CR evalNestedMultipleentryin(A,B,C,D,E,G) 0.63/0.67 0.63/0.67 0.63/0.67 ### Specialization of cost equations evalNestedMultiplestart/6 0.63/0.67 * CE 1 is refined into CE [41,42,43,44,45,46,47,48,49,50] 0.63/0.67 0.63/0.67 0.63/0.67 ### Cost equations --> "Loop" of evalNestedMultiplestart/6 0.63/0.67 * CEs [50] --> Loop 37 0.63/0.67 * CEs [49] --> Loop 38 0.63/0.67 * CEs [48] --> Loop 39 0.63/0.67 * CEs [47] --> Loop 40 0.63/0.67 * CEs [46] --> Loop 41 0.63/0.67 * CEs [45] --> Loop 42 0.63/0.67 * CEs [44] --> Loop 43 0.63/0.67 * CEs [43] --> Loop 44 0.63/0.67 * CEs [42] --> Loop 45 0.63/0.67 * CEs [41] --> Loop 46 0.63/0.67 0.63/0.67 ### Ranking functions of CR evalNestedMultiplestart(A,B,C,D,E,G) 0.63/0.67 0.63/0.67 #### Partial ranking functions of CR evalNestedMultiplestart(A,B,C,D,E,G) 0.63/0.67 0.63/0.67 0.63/0.67 Computing Bounds 0.63/0.67 ===================================== 0.63/0.67 0.63/0.67 #### Cost of chains of evalNestedMultiplebb2in(C,E,G,H): 0.63/0.67 * Chain [[13],16]: 1*it(13)+0 0.63/0.67 Such that:it(13) =< C-E 0.63/0.67 0.63/0.67 with precondition: [G=2,C=H,C>=E+1] 0.63/0.67 0.63/0.67 * Chain [[13],15]: 1*it(13)+0 0.63/0.67 Such that:it(13) =< -E+H 0.63/0.67 0.63/0.67 with precondition: [G=2,H>=E+1,C>=H+1] 0.63/0.67 0.63/0.67 * Chain [[13],14]: 1*it(13)+0 0.63/0.67 Such that:it(13) =< C-E 0.63/0.67 0.63/0.67 with precondition: [G=3,C>=E+1] 0.63/0.67 0.63/0.67 * Chain [16]: 0 0.63/0.67 with precondition: [G=2,E=H,E>=C] 0.63/0.67 0.63/0.67 * Chain [15]: 0 0.63/0.67 with precondition: [G=2,E=H,C>=E+1] 0.63/0.67 0.63/0.67 * Chain [14]: 0 0.63/0.67 with precondition: [G=3] 0.63/0.67 0.63/0.67 0.63/0.67 #### Cost of chains of evalNestedMultiplebb5in(A,B,C,D,E,G,H,I,J): 0.63/0.67 * Chain [[19],24]: 1*it(19)+0 0.63/0.67 Such that:it(19) =< A-B 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+1,D>=C] 0.63/0.67 0.63/0.67 * Chain [[19],23]: 1*it(19)+0 0.63/0.67 Such that:it(19) =< A-B 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+2,D>=C] 0.63/0.67 0.63/0.67 * Chain [[19],21]: 1*it(19)+0 0.63/0.67 Such that:it(19) =< A-B 0.63/0.67 0.63/0.67 with precondition: [G=4,A=H,D=I,D=J,A>=B+1,D>=C] 0.63/0.67 0.63/0.67 * Chain [[17,18],24]: 1*it(17)+1*it(18)+1*s(3)+0 0.63/0.67 Such that:aux(5) =< A-B 0.63/0.67 aux(6) =< C-D 0.63/0.67 it(17) =< aux(5) 0.63/0.67 it(18) =< aux(5) 0.63/0.67 it(17) =< aux(6) 0.63/0.67 s(3) =< aux(6) 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+1,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],23]: 1*it(17)+1*it(18)+1*s(3)+0 0.63/0.67 Such that:aux(7) =< A-B 0.63/0.67 aux(8) =< C-D 0.63/0.67 it(17) =< aux(7) 0.63/0.67 it(18) =< aux(7) 0.63/0.67 it(17) =< aux(8) 0.63/0.67 s(3) =< aux(8) 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+2,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],22]: 1*it(17)+1*it(18)+2*s(3)+0 0.63/0.67 Such that:aux(9) =< A-B 0.63/0.67 aux(10) =< C-D 0.63/0.67 s(3) =< aux(10) 0.63/0.67 it(17) =< aux(9) 0.63/0.67 it(18) =< aux(9) 0.63/0.67 it(17) =< aux(10) 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+2,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],21]: 1*it(17)+1*it(18)+1*s(3)+0 0.63/0.67 Such that:aux(3) =< C-D 0.63/0.67 aux(4) =< -D+J 0.63/0.67 aux(11) =< A-B 0.63/0.67 it(17) =< aux(11) 0.63/0.67 it(18) =< aux(11) 0.63/0.67 it(17) =< aux(3) 0.63/0.67 s(3) =< aux(3) 0.63/0.67 it(17) =< aux(4) 0.63/0.67 s(3) =< aux(4) 0.63/0.67 0.63/0.67 with precondition: [G=4,A=H,I=J,A>=B+1,I>=D,C>=I+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],20,[19],24]: 1*it(17)+2*it(18)+2*s(3)+1 0.63/0.67 Such that:aux(12) =< A-B 0.63/0.67 aux(13) =< C-D 0.63/0.67 it(18) =< aux(12) 0.63/0.67 s(3) =< aux(13) 0.63/0.67 it(17) =< aux(12) 0.63/0.67 it(17) =< aux(13) 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+3,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],20,[19],23]: 1*it(17)+2*it(18)+2*s(3)+1 0.63/0.67 Such that:aux(14) =< A-B 0.63/0.67 aux(15) =< C-D 0.63/0.67 it(18) =< aux(14) 0.63/0.67 s(3) =< aux(15) 0.63/0.67 it(17) =< aux(14) 0.63/0.67 it(17) =< aux(15) 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+4,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],20,[19],21]: 1*it(17)+2*it(18)+2*s(3)+1 0.63/0.67 Such that:aux(16) =< A-B 0.63/0.67 aux(17) =< C-D 0.63/0.67 it(18) =< aux(16) 0.63/0.67 s(3) =< aux(17) 0.63/0.67 it(17) =< aux(16) 0.63/0.67 it(17) =< aux(17) 0.63/0.67 0.63/0.67 with precondition: [G=4,A=H,C=I,C=J,A>=B+3,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],20,24]: 1*it(17)+1*it(18)+2*s(3)+1 0.63/0.67 Such that:aux(18) =< A-B 0.63/0.67 aux(19) =< C-D 0.63/0.67 s(3) =< aux(19) 0.63/0.67 it(17) =< aux(18) 0.63/0.67 it(18) =< aux(18) 0.63/0.67 it(17) =< aux(19) 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+2,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],20,23]: 1*it(17)+1*it(18)+2*s(3)+1 0.63/0.67 Such that:aux(20) =< A-B 0.63/0.67 aux(21) =< C-D 0.63/0.67 s(3) =< aux(21) 0.63/0.67 it(17) =< aux(20) 0.63/0.67 it(18) =< aux(20) 0.63/0.67 it(17) =< aux(21) 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+3,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [[17,18],20,21]: 1*it(17)+1*it(18)+2*s(3)+1 0.63/0.67 Such that:aux(22) =< A-B 0.63/0.67 aux(23) =< C-D 0.63/0.67 s(3) =< aux(23) 0.63/0.67 it(17) =< aux(22) 0.63/0.67 it(18) =< aux(22) 0.63/0.67 it(17) =< aux(23) 0.63/0.67 0.63/0.67 with precondition: [G=4,A=H,C=I,C=J,A>=B+2,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [24]: 0 0.63/0.67 with precondition: [G=3] 0.63/0.67 0.63/0.67 * Chain [23]: 0 0.63/0.67 with precondition: [G=3,A>=B+1] 0.63/0.67 0.63/0.67 * Chain [22]: 1*s(4)+0 0.63/0.67 Such that:s(4) =< C-D 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+1,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [21]: 0 0.63/0.67 with precondition: [G=4,I=D,J=E,B=H,B>=A] 0.63/0.67 0.63/0.67 * Chain [20,[19],24]: 1*it(19)+1*s(5)+1 0.63/0.67 Such that:it(19) =< A-B 0.63/0.67 s(5) =< C-D 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+2,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [20,[19],23]: 1*it(19)+1*s(5)+1 0.63/0.67 Such that:it(19) =< A-B 0.63/0.67 s(5) =< C-D 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+3,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [20,[19],21]: 1*it(19)+1*s(5)+1 0.63/0.67 Such that:it(19) =< A-B 0.63/0.67 s(5) =< C-D 0.63/0.67 0.63/0.67 with precondition: [G=4,A=H,C=I,C=J,A>=B+2,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [20,24]: 1*s(5)+1 0.63/0.67 Such that:s(5) =< C-D 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+1,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [20,23]: 1*s(5)+1 0.63/0.67 Such that:s(5) =< C-D 0.63/0.67 0.63/0.67 with precondition: [G=3,A>=B+2,C>=D+1] 0.63/0.67 0.63/0.67 * Chain [20,21]: 1*s(5)+1 0.63/0.67 Such that:s(5) =< C-D 0.63/0.67 0.63/0.67 with precondition: [G=4,A=B+1,A=H,C=I,C=J,C>=D+1] 0.63/0.67 0.63/0.67 0.63/0.67 #### Cost of chains of evalNestedMultiplebb5in_loop_cont(A,B,C,D,E,F,G): 0.63/0.67 * Chain [26]: 0 0.63/0.67 with precondition: [A=3] 0.63/0.67 0.63/0.67 * Chain [25]: 0 0.63/0.67 with precondition: [A=4] 0.63/0.67 0.63/0.67 0.63/0.67 #### Cost of chains of evalNestedMultipleentryin(A,B,C,D,E,G): 0.63/0.67 * Chain [36]: 0 0.63/0.67 with precondition: [] 0.63/0.67 0.63/0.67 * Chain [35]: 1*s(50)+1 0.63/0.67 Such that:s(50) =< -C+D 0.63/0.67 0.63/0.67 with precondition: [B=A+1,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [34]: 0 0.63/0.67 with precondition: [B>=A+1] 0.63/0.67 0.63/0.67 * Chain [33]: 4*s(53)+2*s(54)+2*s(55)+1 0.63/0.67 Such that:aux(32) =< -A+B 0.63/0.67 aux(33) =< -C+D 0.63/0.67 s(53) =< aux(33) 0.63/0.67 s(54) =< aux(32) 0.63/0.67 s(55) =< aux(32) 0.63/0.67 s(54) =< aux(33) 0.63/0.67 0.63/0.67 with precondition: [B>=A+1,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [32]: 2*s(62)+0 0.63/0.67 Such that:aux(34) =< -A+B 0.63/0.67 s(62) =< aux(34) 0.63/0.67 0.63/0.67 with precondition: [B>=A+1,C>=D] 0.63/0.67 0.63/0.67 * Chain [31]: 6*s(66)+10*s(67)+4*s(68)+1 0.63/0.67 Such that:aux(35) =< -A+B 0.63/0.67 aux(36) =< -C+D 0.63/0.67 s(66) =< aux(35) 0.63/0.67 s(67) =< aux(36) 0.63/0.67 s(68) =< aux(35) 0.63/0.67 s(68) =< aux(36) 0.63/0.67 0.63/0.67 with precondition: [B>=A+2,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [30]: 1*s(74)+0 0.63/0.67 Such that:s(74) =< -A+B 0.63/0.67 0.63/0.67 with precondition: [B>=A+2,C>=D] 0.63/0.67 0.63/0.67 * Chain [29]: 6*s(77)+7*s(78)+3*s(79)+1 0.63/0.67 Such that:aux(37) =< -A+B 0.63/0.67 aux(38) =< -C+D 0.63/0.67 s(77) =< aux(37) 0.63/0.67 s(78) =< aux(38) 0.63/0.67 s(79) =< aux(37) 0.63/0.67 s(79) =< aux(38) 0.63/0.67 0.63/0.67 with precondition: [B>=A+3,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [28]: 2*s(87)+2*s(88)+1*s(89)+1 0.63/0.67 Such that:s(85) =< -A+B 0.63/0.67 s(86) =< -C+D 0.63/0.67 s(87) =< s(85) 0.63/0.67 s(88) =< s(86) 0.63/0.67 s(89) =< s(85) 0.63/0.67 s(89) =< s(86) 0.63/0.67 0.63/0.67 with precondition: [B>=A+4,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [27]: 0 0.63/0.67 with precondition: [A>=B] 0.63/0.67 0.63/0.67 0.63/0.67 #### Cost of chains of evalNestedMultiplestart(A,B,C,D,E,G): 0.63/0.67 * Chain [46]: 0 0.63/0.67 with precondition: [] 0.63/0.67 0.63/0.67 * Chain [45]: 1*s(90)+1 0.63/0.67 Such that:s(90) =< -C+D 0.63/0.67 0.63/0.67 with precondition: [B=A+1,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [44]: 0 0.63/0.67 with precondition: [B>=A+1] 0.63/0.67 0.63/0.67 * Chain [43]: 4*s(93)+2*s(94)+2*s(95)+1 0.63/0.67 Such that:s(91) =< -A+B 0.63/0.67 s(92) =< -C+D 0.63/0.67 s(93) =< s(92) 0.63/0.67 s(94) =< s(91) 0.63/0.67 s(95) =< s(91) 0.63/0.67 s(94) =< s(92) 0.63/0.67 0.63/0.67 with precondition: [B>=A+1,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [42]: 2*s(97)+0 0.63/0.67 Such that:s(96) =< -A+B 0.63/0.67 s(97) =< s(96) 0.63/0.67 0.63/0.67 with precondition: [B>=A+1,C>=D] 0.63/0.67 0.63/0.67 * Chain [41]: 6*s(100)+10*s(101)+4*s(102)+1 0.63/0.67 Such that:s(98) =< -A+B 0.63/0.67 s(99) =< -C+D 0.63/0.67 s(100) =< s(98) 0.63/0.67 s(101) =< s(99) 0.63/0.67 s(102) =< s(98) 0.63/0.67 s(102) =< s(99) 0.63/0.67 0.63/0.67 with precondition: [B>=A+2,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [40]: 1*s(103)+0 0.63/0.67 Such that:s(103) =< -A+B 0.63/0.67 0.63/0.67 with precondition: [B>=A+2,C>=D] 0.63/0.67 0.63/0.67 * Chain [39]: 6*s(106)+7*s(107)+3*s(108)+1 0.63/0.67 Such that:s(104) =< -A+B 0.63/0.67 s(105) =< -C+D 0.63/0.67 s(106) =< s(104) 0.63/0.67 s(107) =< s(105) 0.63/0.67 s(108) =< s(104) 0.63/0.67 s(108) =< s(105) 0.63/0.67 0.63/0.67 with precondition: [B>=A+3,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [38]: 2*s(111)+2*s(112)+1*s(113)+1 0.63/0.67 Such that:s(109) =< -A+B 0.63/0.67 s(110) =< -C+D 0.63/0.67 s(111) =< s(109) 0.63/0.67 s(112) =< s(110) 0.63/0.67 s(113) =< s(109) 0.63/0.67 s(113) =< s(110) 0.63/0.67 0.63/0.67 with precondition: [B>=A+4,D>=C+1] 0.63/0.67 0.63/0.67 * Chain [37]: 0 0.63/0.67 with precondition: [A>=B] 0.63/0.67 0.63/0.67 0.63/0.67 Closed-form bounds of evalNestedMultiplestart(A,B,C,D,E,G): 0.63/0.67 ------------------------------------- 0.63/0.67 * Chain [46] with precondition: [] 0.63/0.67 - Upper bound: 0 0.63/0.67 - Complexity: constant 0.63/0.67 * Chain [45] with precondition: [B=A+1,D>=C+1] 0.63/0.67 - Upper bound: -C+D+1 0.63/0.67 - Complexity: n 0.63/0.67 * Chain [44] with precondition: [B>=A+1] 0.63/0.67 - Upper bound: 0 0.63/0.67 - Complexity: constant 0.63/0.67 * Chain [43] with precondition: [B>=A+1,D>=C+1] 0.63/0.67 - Upper bound: -4*A+4*B-4*C+4*D+1 0.63/0.67 - Complexity: n 0.63/0.67 * Chain [42] with precondition: [B>=A+1,C>=D] 0.63/0.67 - Upper bound: -2*A+2*B 0.63/0.67 - Complexity: n 0.63/0.67 * Chain [41] with precondition: [B>=A+2,D>=C+1] 0.63/0.67 - Upper bound: -10*A+10*B-10*C+10*D+1 0.63/0.67 - Complexity: n 0.63/0.67 * Chain [40] with precondition: [B>=A+2,C>=D] 0.63/0.67 - Upper bound: -A+B 0.63/0.67 - Complexity: n 0.63/0.67 * Chain [39] with precondition: [B>=A+3,D>=C+1] 0.63/0.67 - Upper bound: -9*A+9*B-7*C+7*D+1 0.63/0.67 - Complexity: n 0.63/0.67 * Chain [38] with precondition: [B>=A+4,D>=C+1] 0.63/0.67 - Upper bound: -3*A+3*B-2*C+2*D+1 0.63/0.67 - Complexity: n 0.63/0.67 * Chain [37] with precondition: [A>=B] 0.63/0.67 - Upper bound: 0 0.63/0.67 - Complexity: constant 0.63/0.67 0.63/0.67 ### Maximum cost of evalNestedMultiplestart(A,B,C,D,E,G): max([nat(-C+D)+1,nat(-C+D)*3+nat(-A+B)*5+(nat(-C+D)*3+nat(-A+B))+(nat(-C+D)*2+nat(-A+B))+(nat(-A+B)+1+nat(-C+D)*2)+nat(-A+B)+nat(-A+B)]) 0.63/0.67 Asymptotic class: n 0.63/0.67 * Total analysis performed in 585 ms. 0.63/0.67 0.68/0.77 EOF