0.92/0.97 WORST_CASE(?,O(n^2)) 0.92/0.97 0.92/0.97 Preprocessing Cost Relations 0.92/0.97 ===================================== 0.92/0.97 0.92/0.97 #### Computed strongly connected components 0.92/0.97 0. recursive : [evalfbb2in/4,evalfbb3in/4,evalfbb4in/4] 0.92/0.97 1. recursive : [evalfbb3in_loop_cont/11,evalfbb5in/10,evalfbb6in/10,evalfbb7in/10,evalfbbin/10] 0.92/0.97 2. non_recursive : [evalfstop/6] 0.92/0.97 3. non_recursive : [evalfreturnin/6] 0.92/0.97 4. non_recursive : [exit_location/1] 0.92/0.97 5. non_recursive : [evalfbb7in_loop_cont/7] 0.92/0.97 6. non_recursive : [evalfentryin/6] 0.92/0.97 7. non_recursive : [evalfstart/6] 0.92/0.97 0.92/0.97 #### Obtained direct recursion through partial evaluation 0.92/0.97 0. SCC is partially evaluated into evalfbb3in/4 0.92/0.97 1. SCC is partially evaluated into evalfbb7in/10 0.92/0.97 2. SCC is completely evaluated into other SCCs 0.92/0.97 3. SCC is completely evaluated into other SCCs 0.92/0.97 4. SCC is completely evaluated into other SCCs 0.92/0.97 5. SCC is partially evaluated into evalfbb7in_loop_cont/7 0.92/0.97 6. SCC is partially evaluated into evalfentryin/6 0.92/0.97 7. SCC is partially evaluated into evalfstart/6 0.92/0.97 0.92/0.97 Control-Flow Refinement of Cost Relations 0.92/0.97 ===================================== 0.92/0.97 0.92/0.97 ### Specialization of cost equations evalfbb3in/4 0.92/0.97 * CE 14 is refined into CE [15] 0.92/0.97 * CE 11 is refined into CE [16] 0.92/0.97 * CE 13 is refined into CE [17] 0.92/0.97 * CE 12 is refined into CE [18] 0.92/0.97 0.92/0.97 0.92/0.97 ### Cost equations --> "Loop" of evalfbb3in/4 0.92/0.97 * CEs [18] --> Loop 15 0.92/0.97 * CEs [15] --> Loop 16 0.92/0.97 * CEs [16] --> Loop 17 0.92/0.97 * CEs [17] --> Loop 18 0.92/0.97 0.92/0.97 ### Ranking functions of CR evalfbb3in(B,D,G,H) 0.92/0.97 * RF of phase [15]: [B-D+1] 0.92/0.97 0.92/0.97 #### Partial ranking functions of CR evalfbb3in(B,D,G,H) 0.92/0.97 * Partial RF of phase [15]: 0.92/0.97 - RF of loop [15:1]: 0.92/0.97 B-D+1 0.92/0.97 0.92/0.97 0.92/0.97 ### Specialization of cost equations evalfbb7in/10 0.92/0.97 * CE 7 is refined into CE [19] 0.92/0.97 * CE 6 is refined into CE [20] 0.92/0.97 * CE 3 is refined into CE [21,22] 0.92/0.97 * CE 8 is refined into CE [23] 0.92/0.97 * CE 5 is refined into CE [24] 0.92/0.97 * CE 4 is refined into CE [25,26,27,28] 0.92/0.97 0.92/0.97 0.92/0.97 ### Cost equations --> "Loop" of evalfbb7in/10 0.92/0.97 * CEs [24] --> Loop 19 0.92/0.97 * CEs [28] --> Loop 20 0.92/0.97 * CEs [26] --> Loop 21 0.92/0.97 * CEs [27] --> Loop 22 0.92/0.97 * CEs [25] --> Loop 23 0.92/0.97 * CEs [19] --> Loop 24 0.92/0.97 * CEs [20] --> Loop 25 0.92/0.97 * CEs [23] --> Loop 26 0.92/0.97 * CEs [22] --> Loop 27 0.92/0.97 * CEs [21] --> Loop 28 0.92/0.97 0.92/0.97 ### Ranking functions of CR evalfbb7in(A,B,C,D,E,G,H,I,J,K) 0.92/0.97 0.92/0.97 #### Partial ranking functions of CR evalfbb7in(A,B,C,D,E,G,H,I,J,K) 0.92/0.97 * Partial RF of phase [19,20,21,22,23]: 0.92/0.97 - RF of loop [19:1,22:1]: 0.92/0.97 C+1 depends on loops [20:1,23:1] 0.92/0.97 - RF of loop [20:1,21:1,22:1,23:1]: 0.92/0.97 A+1 0.92/0.97 - RF of loop [21:1]: 0.92/0.97 -B+C depends on loops [20:1,23:1] 0.92/0.97 C depends on loops [20:1,23:1] 0.92/0.97 0.92/0.97 0.92/0.97 ### Specialization of cost equations evalfbb7in_loop_cont/7 0.92/0.97 * CE 9 is refined into CE [29] 0.92/0.97 * CE 10 is refined into CE [30] 0.92/0.97 0.92/0.97 0.92/0.97 ### Cost equations --> "Loop" of evalfbb7in_loop_cont/7 0.92/0.97 * CEs [29] --> Loop 29 0.92/0.97 * CEs [30] --> Loop 30 0.92/0.97 0.92/0.97 ### Ranking functions of CR evalfbb7in_loop_cont(A,B,C,D,E,F,G) 0.92/0.97 0.92/0.97 #### Partial ranking functions of CR evalfbb7in_loop_cont(A,B,C,D,E,F,G) 0.92/0.97 0.92/0.97 0.92/0.97 ### Specialization of cost equations evalfentryin/6 0.92/0.97 * CE 2 is refined into CE [31,32,33,34,35,36,37] 0.92/0.97 0.92/0.97 0.92/0.97 ### Cost equations --> "Loop" of evalfentryin/6 0.92/0.97 * CEs [33] --> Loop 31 0.92/0.97 * CEs [31,32,35,36] --> Loop 32 0.92/0.97 * CEs [37] --> Loop 33 0.92/0.97 * CEs [34] --> Loop 34 0.92/0.97 0.92/0.97 ### Ranking functions of CR evalfentryin(A,B,C,D,E,G) 0.92/0.97 0.92/0.97 #### Partial ranking functions of CR evalfentryin(A,B,C,D,E,G) 0.92/0.97 0.92/0.97 0.92/0.97 ### Specialization of cost equations evalfstart/6 0.92/0.97 * CE 1 is refined into CE [38,39,40,41] 0.92/0.97 0.92/0.97 0.92/0.97 ### Cost equations --> "Loop" of evalfstart/6 0.92/0.97 * CEs [41] --> Loop 35 0.92/0.97 * CEs [40] --> Loop 36 0.92/0.97 * CEs [39] --> Loop 37 0.92/0.97 * CEs [38] --> Loop 38 0.92/0.97 0.92/0.97 ### Ranking functions of CR evalfstart(A,B,C,D,E,G) 0.92/0.97 0.92/0.97 #### Partial ranking functions of CR evalfstart(A,B,C,D,E,G) 0.92/0.97 0.92/0.97 0.92/0.97 Computing Bounds 0.92/0.97 ===================================== 0.92/0.97 0.92/0.97 #### Cost of chains of evalfbb3in(B,D,G,H): 0.92/0.97 * Chain [[15],18]: 1*it(15)+0 0.92/0.97 Such that:it(15) =< -D+H 0.92/0.97 0.92/0.97 with precondition: [G=2,B+1=H,D>=0,B>=D] 0.92/0.97 0.92/0.97 * Chain [[15],17]: 1*it(15)+0 0.92/0.97 Such that:it(15) =< -D+H 0.92/0.97 0.92/0.97 with precondition: [G=2,D>=0,H>=D+1,B>=H] 0.92/0.97 0.92/0.97 * Chain [[15],16]: 1*it(15)+0 0.92/0.97 Such that:it(15) =< B-D+1 0.92/0.97 0.92/0.97 with precondition: [G=3,D>=0,B>=D] 0.92/0.97 0.92/0.97 * Chain [18]: 0 0.92/0.97 with precondition: [G=2,D=H,B>=0,D>=B+1] 0.92/0.97 0.92/0.97 * Chain [17]: 0 0.92/0.97 with precondition: [G=2,D=H,D>=0,B>=D] 0.92/0.97 0.92/0.97 * Chain [16]: 0 0.92/0.97 with precondition: [G=3,B>=0,D>=0] 0.92/0.97 0.92/0.97 0.92/0.97 #### Cost of chains of evalfbb7in(A,B,C,D,E,G,H,I,J,K): 0.92/0.97 * Chain [[19,20,21,22,23],28]: 1*it(19)+2*it(20)+2*it(21)+1*s(5)+1*s(6)+0 0.92/0.97 Such that:aux(49) =< A 0.92/0.97 aux(47) =< A+1 0.92/0.97 aux(48) =< A+B 0.92/0.97 aux(34) =< A+B-C+1 0.92/0.97 aux(48) =< 2*A+B 0.92/0.97 aux(50) =< B 0.92/0.97 aux(52) =< C 0.92/0.97 aux(51) =< C+1 0.92/0.97 it(20) =< aux(47) 0.92/0.97 it(21) =< aux(47) 0.92/0.97 it(20) =< aux(49) 0.92/0.97 it(21) =< aux(49) 0.92/0.97 aux(36) =< aux(50)+1 0.92/0.97 aux(12) =< aux(50) 0.92/0.97 aux(11) =< it(20)*aux(50) 0.92/0.97 aux(1) =< it(20)*aux(50) 0.92/0.97 s(5) =< it(20)*aux(50) 0.92/0.97 aux(13) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(11) 0.92/0.97 aux(1) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(13) 0.92/0.97 aux(2) =< it(20)*aux(36) 0.92/0.97 s(6) =< it(20)*aux(36) 0.92/0.97 it(19) =< aux(2)+aux(1)+aux(51) 0.92/0.97 it(21) =< aux(2)+aux(1)+aux(51) 0.92/0.97 it(19) =< aux(2)+aux(4)+aux(52) 0.92/0.97 it(21) =< aux(2)+aux(4)+aux(52) 0.92/0.97 s(6) =< it(19)+aux(48) 0.92/0.97 s(6) =< it(19)+aux(34) 0.92/0.97 0.92/0.97 with precondition: [G=3,A>=0,C>=0,B>=A,A+C>=1] 0.92/0.97 0.92/0.97 * Chain [[19,20,21,22,23],27]: 1*it(19)+2*it(20)+2*it(21)+1*s(5)+1*s(6)+1*s(7)+0 0.92/0.97 Such that:aux(49) =< A 0.92/0.97 aux(47) =< A+1 0.92/0.97 aux(48) =< A+B-C 0.92/0.97 aux(34) =< A+B-C+1 0.92/0.97 aux(48) =< 2*A+B 0.92/0.97 aux(50) =< B 0.92/0.97 s(7) =< B+1 0.92/0.97 aux(52) =< C 0.92/0.97 aux(51) =< C+1 0.92/0.97 it(20) =< aux(47) 0.92/0.97 it(21) =< aux(47) 0.92/0.97 it(20) =< aux(49) 0.92/0.97 it(21) =< aux(49) 0.92/0.97 aux(36) =< aux(50)+1 0.92/0.97 aux(12) =< aux(50) 0.92/0.97 aux(11) =< it(20)*aux(50) 0.92/0.97 aux(1) =< it(20)*aux(50) 0.92/0.97 s(5) =< it(20)*aux(50) 0.92/0.97 aux(13) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(11) 0.92/0.97 aux(1) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(13) 0.92/0.97 aux(2) =< it(20)*aux(36) 0.92/0.97 s(6) =< it(20)*aux(36) 0.92/0.97 it(19) =< aux(2)+aux(1)+aux(51) 0.92/0.97 it(21) =< aux(2)+aux(1)+aux(51) 0.92/0.97 it(19) =< aux(2)+aux(4)+aux(52) 0.92/0.97 it(21) =< aux(2)+aux(4)+aux(52) 0.92/0.97 s(6) =< it(19)+aux(48) 0.92/0.97 s(6) =< it(19)+aux(34) 0.92/0.97 0.92/0.97 with precondition: [G=3,A>=0,C>=0,B>=A,A+C>=1] 0.92/0.97 0.92/0.97 * Chain [[19,20,21,22,23],26]: 1*it(19)+2*it(20)+2*it(21)+1*s(5)+1*s(6)+0 0.92/0.97 Such that:aux(48) =< A+B+1 0.92/0.97 aux(34) =< A+B-C+1 0.92/0.97 aux(50) =< B 0.92/0.97 aux(48) =< 2*B+1 0.92/0.97 aux(53) =< A+1 0.92/0.97 aux(54) =< C+1 0.92/0.97 it(20) =< aux(53) 0.92/0.97 it(21) =< aux(53) 0.92/0.97 aux(36) =< aux(50)+1 0.92/0.97 aux(12) =< aux(50) 0.92/0.97 aux(11) =< it(20)*aux(50) 0.92/0.97 aux(1) =< it(20)*aux(50) 0.92/0.97 s(5) =< it(20)*aux(50) 0.92/0.97 aux(13) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(11) 0.92/0.97 aux(1) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(13) 0.92/0.97 aux(2) =< it(20)*aux(36) 0.92/0.97 s(6) =< it(20)*aux(36) 0.92/0.97 it(19) =< aux(2)+aux(1)+aux(54) 0.92/0.97 it(21) =< aux(2)+aux(1)+aux(54) 0.92/0.97 it(19) =< aux(2)+aux(4)+aux(54) 0.92/0.97 it(21) =< aux(2)+aux(4)+aux(54) 0.92/0.97 s(6) =< it(19)+aux(48) 0.92/0.97 s(6) =< it(19)+aux(34) 0.92/0.97 0.92/0.97 with precondition: [G=3,A>=0,C>=0,B>=A] 0.92/0.97 0.92/0.97 * Chain [[19,20,21,22,23],25]: 1*it(19)+2*it(20)+2*it(21)+1*s(5)+1*s(6)+0 0.92/0.97 Such that:aux(34) =< A+B-C+1 0.92/0.97 aux(48) =< A-C+K 0.92/0.97 aux(50) =< B 0.92/0.97 aux(48) =< B-C+K 0.92/0.97 aux(51) =< C+1 0.92/0.97 aux(52) =< C-K+1 0.92/0.97 aux(55) =< A+1 0.92/0.97 it(20) =< aux(55) 0.92/0.97 it(21) =< aux(55) 0.92/0.97 aux(36) =< aux(50)+1 0.92/0.97 aux(12) =< aux(50) 0.92/0.97 aux(11) =< it(20)*aux(50) 0.92/0.97 aux(1) =< it(20)*aux(50) 0.92/0.97 s(5) =< it(20)*aux(50) 0.92/0.97 aux(13) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(11) 0.92/0.97 aux(1) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(13) 0.92/0.97 aux(2) =< it(20)*aux(36) 0.92/0.97 s(6) =< it(20)*aux(36) 0.92/0.97 it(19) =< aux(2)+aux(1)+aux(51) 0.92/0.97 it(21) =< aux(2)+aux(1)+aux(51) 0.92/0.97 it(19) =< aux(2)+aux(4)+aux(52) 0.92/0.97 it(21) =< aux(2)+aux(4)+aux(52) 0.92/0.97 s(6) =< it(19)+aux(48) 0.92/0.97 s(6) =< it(19)+aux(34) 0.92/0.97 0.92/0.97 with precondition: [G=4,H+1=0,J+1=0,I+1=K,A>=0,C>=0,I+1>=0,B>=A] 0.92/0.97 0.92/0.97 * Chain [[19,20,21,22,23],24]: 1*it(19)+2*it(20)+2*it(21)+1*s(5)+1*s(6)+0 0.92/0.97 Such that:aux(47) =< A+1 0.92/0.97 aux(34) =< A+B-C+1 0.92/0.97 aux(48) =< A-C-H 0.92/0.97 aux(49) =< A-J 0.92/0.97 aux(50) =< B 0.92/0.97 aux(48) =< B-C-H 0.92/0.97 aux(56) =< C+1 0.92/0.97 it(20) =< aux(47) 0.92/0.97 it(21) =< aux(47) 0.92/0.97 it(20) =< aux(49) 0.92/0.97 it(21) =< aux(49) 0.92/0.97 aux(36) =< aux(50)+1 0.92/0.97 aux(12) =< aux(50) 0.92/0.97 aux(11) =< it(20)*aux(50) 0.92/0.97 aux(1) =< it(20)*aux(50) 0.92/0.97 s(5) =< it(20)*aux(50) 0.92/0.97 aux(13) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(11) 0.92/0.97 aux(1) =< it(20)*aux(12) 0.92/0.97 aux(4) =< aux(13) 0.92/0.97 aux(2) =< it(20)*aux(36) 0.92/0.97 s(6) =< it(20)*aux(36) 0.92/0.97 it(19) =< aux(2)+aux(1)+aux(56) 0.92/0.97 it(21) =< aux(2)+aux(1)+aux(56) 0.92/0.97 it(19) =< aux(2)+aux(4)+aux(56) 0.92/0.97 it(21) =< aux(2)+aux(4)+aux(56) 0.92/0.97 s(6) =< it(19)+aux(48) 0.92/0.97 s(6) =< it(19)+aux(34) 0.92/0.97 0.92/0.97 with precondition: [G=4,I+1=0,K=0,H=J,A>=0,C>=0,H+1>=0,B>=A,A>=H] 0.92/0.97 0.92/0.97 * Chain [28]: 0 0.92/0.97 with precondition: [G=3,A>=0,C>=0,B>=A] 0.92/0.97 0.92/0.97 * Chain [27]: 1*s(7)+0 0.92/0.97 Such that:s(7) =< B-C+1 0.92/0.97 0.92/0.97 with precondition: [G=3,A>=0,C>=0,B>=A,B>=C] 0.92/0.97 0.92/0.97 * Chain [26]: 0 0.92/0.97 with precondition: [G=3,C+1>=0,B>=A] 0.92/0.97 0.92/0.97 * Chain [25]: 0 0.92/0.97 with precondition: [G=4,J=D,K=E,A=H,C=I,0>=A+1,C+1>=0,B>=A] 0.92/0.97 0.92/0.97 0.92/0.97 #### Cost of chains of evalfbb7in_loop_cont(A,B,C,D,E,F,G): 0.92/0.97 * Chain [30]: 0 0.92/0.97 with precondition: [A=3] 0.92/0.97 0.92/0.97 * Chain [29]: 0 0.92/0.97 with precondition: [A=4] 0.92/0.97 0.92/0.97 0.92/0.97 #### Cost of chains of evalfentryin(A,B,C,D,E,G): 0.92/0.97 * Chain [34]: 0 0.92/0.97 with precondition: [] 0.92/0.97 0.92/0.97 * Chain [33]: 0 0.92/0.97 with precondition: [0>=B+1] 0.92/0.97 0.92/0.97 * Chain [32]: 7*s(69)+6*s(70)+3*s(75)+2*s(79)+3*s(80)+1*s(116)+0 0.92/0.97 Such that:aux(67) =< 1 0.92/0.97 aux(68) =< B 0.92/0.97 aux(69) =< B+1 0.92/0.97 aux(70) =< 2*B+1 0.92/0.97 s(69) =< aux(69) 0.92/0.97 s(70) =< aux(69) 0.92/0.97 s(71) =< aux(68)+1 0.92/0.97 s(72) =< aux(68) 0.92/0.97 s(73) =< s(69)*aux(68) 0.92/0.97 s(74) =< s(69)*aux(68) 0.92/0.97 s(75) =< s(69)*aux(68) 0.92/0.97 s(76) =< s(69)*s(72) 0.92/0.97 s(77) =< s(73) 0.92/0.97 s(74) =< s(69)*s(72) 0.92/0.97 s(77) =< s(76) 0.92/0.97 s(78) =< s(69)*s(71) 0.92/0.97 s(79) =< s(69)*s(71) 0.92/0.97 s(80) =< s(78)+s(74)+aux(67) 0.92/0.97 s(70) =< s(78)+s(74)+aux(67) 0.92/0.97 s(80) =< s(78)+s(77)+aux(67) 0.92/0.97 s(70) =< s(78)+s(77)+aux(67) 0.92/0.97 s(79) =< s(80)+aux(70) 0.92/0.97 s(116) =< s(69)*s(71) 0.92/0.97 s(116) =< s(80)+aux(69) 0.92/0.97 s(116) =< s(80)+aux(70) 0.92/0.97 0.92/0.97 with precondition: [B>=0] 0.92/0.97 0.92/0.97 * Chain [31]: 1*s(120)+4*s(128)+4*s(129)+2*s(134)+2*s(138)+2*s(139)+0 0.92/0.97 Such that:s(127) =< 1 0.92/0.97 s(123) =< 2*B+1 0.92/0.97 s(124) =< 3*B 0.92/0.97 aux(71) =< B 0.92/0.97 aux(72) =< B+1 0.92/0.97 aux(73) =< 2*B 0.92/0.97 s(120) =< aux(72) 0.92/0.97 s(118) =< aux(73) 0.92/0.97 s(118) =< s(124) 0.92/0.97 s(128) =< aux(72) 0.92/0.97 s(129) =< aux(72) 0.92/0.97 s(128) =< aux(71) 0.92/0.97 s(129) =< aux(71) 0.92/0.97 s(130) =< aux(71)+1 0.92/0.97 s(131) =< aux(71) 0.92/0.97 s(132) =< s(128)*aux(71) 0.92/0.97 s(133) =< s(128)*aux(71) 0.92/0.97 s(134) =< s(128)*aux(71) 0.92/0.97 s(135) =< s(128)*s(131) 0.92/0.97 s(136) =< s(132) 0.92/0.97 s(133) =< s(128)*s(131) 0.92/0.97 s(136) =< s(135) 0.92/0.97 s(137) =< s(128)*s(130) 0.92/0.97 s(138) =< s(128)*s(130) 0.92/0.97 s(139) =< s(137)+s(133)+s(127) 0.92/0.97 s(129) =< s(137)+s(133)+s(127) 0.92/0.97 s(139) =< s(137)+s(136) 0.92/0.97 s(129) =< s(137)+s(136) 0.92/0.97 s(138) =< s(139)+s(118) 0.92/0.97 s(138) =< s(139)+s(123) 0.92/0.97 0.92/0.97 with precondition: [B>=1] 0.92/0.97 0.92/0.97 0.92/0.97 #### Cost of chains of evalfstart(A,B,C,D,E,G): 0.92/0.97 * Chain [38]: 0 0.92/0.97 with precondition: [] 0.92/0.97 0.92/0.97 * Chain [37]: 0 0.92/0.97 with precondition: [0>=B+1] 0.92/0.97 0.92/0.97 * Chain [36]: 7*s(145)+6*s(146)+3*s(151)+2*s(155)+3*s(156)+1*s(157)+0 0.92/0.97 Such that:s(141) =< 1 0.92/0.97 s(142) =< B 0.92/0.97 s(143) =< B+1 0.92/0.97 s(144) =< 2*B+1 0.92/0.97 s(145) =< s(143) 0.92/0.97 s(146) =< s(143) 0.92/0.97 s(147) =< s(142)+1 0.92/0.97 s(148) =< s(142) 0.92/0.97 s(149) =< s(145)*s(142) 0.92/0.97 s(150) =< s(145)*s(142) 0.92/0.97 s(151) =< s(145)*s(142) 0.92/0.97 s(152) =< s(145)*s(148) 0.92/0.97 s(153) =< s(149) 0.92/0.97 s(150) =< s(145)*s(148) 0.92/0.97 s(153) =< s(152) 0.92/0.97 s(154) =< s(145)*s(147) 0.92/0.97 s(155) =< s(145)*s(147) 0.92/0.97 s(156) =< s(154)+s(150)+s(141) 0.92/0.97 s(146) =< s(154)+s(150)+s(141) 0.92/0.97 s(156) =< s(154)+s(153)+s(141) 0.92/0.97 s(146) =< s(154)+s(153)+s(141) 0.92/0.97 s(155) =< s(156)+s(144) 0.92/0.97 s(157) =< s(145)*s(147) 0.92/0.97 s(157) =< s(156)+s(143) 0.92/0.97 s(157) =< s(156)+s(144) 0.92/0.97 0.92/0.97 with precondition: [B>=0] 0.92/0.97 0.92/0.97 * Chain [35]: 1*s(164)+4*s(166)+4*s(167)+2*s(172)+2*s(176)+2*s(177)+0 0.92/0.97 Such that:s(158) =< 1 0.92/0.97 s(161) =< B 0.92/0.97 s(162) =< B+1 0.92/0.97 s(163) =< 2*B 0.92/0.97 s(159) =< 2*B+1 0.92/0.97 s(160) =< 3*B 0.92/0.97 s(164) =< s(162) 0.92/0.97 s(165) =< s(163) 0.92/0.97 s(165) =< s(160) 0.92/0.97 s(166) =< s(162) 0.92/0.97 s(167) =< s(162) 0.92/0.97 s(166) =< s(161) 0.92/0.97 s(167) =< s(161) 0.92/0.97 s(168) =< s(161)+1 0.92/0.97 s(169) =< s(161) 0.92/0.97 s(170) =< s(166)*s(161) 0.92/0.97 s(171) =< s(166)*s(161) 0.92/0.97 s(172) =< s(166)*s(161) 0.92/0.97 s(173) =< s(166)*s(169) 0.92/0.97 s(174) =< s(170) 0.92/0.97 s(171) =< s(166)*s(169) 0.92/0.97 s(174) =< s(173) 0.92/0.97 s(175) =< s(166)*s(168) 0.92/0.97 s(176) =< s(166)*s(168) 0.92/0.97 s(177) =< s(175)+s(171)+s(158) 0.92/0.97 s(167) =< s(175)+s(171)+s(158) 0.92/0.97 s(177) =< s(175)+s(174) 0.92/0.97 s(167) =< s(175)+s(174) 0.92/0.97 s(176) =< s(177)+s(165) 0.92/0.97 s(176) =< s(177)+s(159) 0.92/0.97 0.92/0.97 with precondition: [B>=1] 0.92/0.97 0.92/0.97 0.92/0.97 Closed-form bounds of evalfstart(A,B,C,D,E,G): 0.92/0.97 ------------------------------------- 0.92/0.97 * Chain [38] with precondition: [] 0.92/0.97 - Upper bound: 0 0.92/0.97 - Complexity: constant 0.92/0.97 * Chain [37] with precondition: [0>=B+1] 0.92/0.97 - Upper bound: 0 0.92/0.97 - Complexity: constant 0.92/0.97 * Chain [36] with precondition: [B>=0] 0.92/0.97 - Upper bound: (B+1)*(12*B)+3+(19*B+19) 0.92/0.97 - Complexity: n^2 0.92/0.97 * Chain [35] with precondition: [B>=1] 0.92/0.97 - Upper bound: (B+1)*(8*B)+2+(13*B+13) 0.92/0.97 - Complexity: n^2 0.92/0.97 0.92/0.97 ### Maximum cost of evalfstart(A,B,C,D,E,G): nat(B)*8*nat(B+1)+2+nat(B+1)*13+(nat(B)*4*nat(B+1)+1+nat(B+1)*6) 0.92/0.97 Asymptotic class: n^2 0.92/0.97 * Total analysis performed in 839 ms. 0.92/0.97 0.98/1.07 EOF