0.03/0.32 MAYBE 0.03/0.32 0.03/0.32 Preprocessing Cost Relations 0.03/0.32 ===================================== 0.03/0.32 0.03/0.32 #### Computed strongly connected components 0.03/0.32 0. recursive : [f6/8] 0.03/0.32 1. non_recursive : [exit_location/1] 0.03/0.32 2. non_recursive : [f14/5] 0.03/0.32 3. non_recursive : [f6_loop_cont/6] 0.03/0.32 4. non_recursive : [f0/5] 0.03/0.32 0.03/0.32 #### Obtained direct recursion through partial evaluation 0.03/0.32 0. SCC is partially evaluated into f6/8 0.03/0.32 1. SCC is completely evaluated into other SCCs 0.03/0.32 2. SCC is completely evaluated into other SCCs 0.03/0.32 3. SCC is partially evaluated into f6_loop_cont/6 0.03/0.32 4. SCC is partially evaluated into f0/5 0.03/0.32 0.03/0.32 Control-Flow Refinement of Cost Relations 0.03/0.32 ===================================== 0.03/0.32 0.03/0.32 ### Specialization of cost equations f6/8 0.03/0.32 * CE 7 is refined into CE [10] 0.03/0.32 * CE 5 is refined into CE [11] 0.03/0.32 * CE 4 is refined into CE [12] 0.03/0.32 * CE 6 is refined into CE [13] 0.03/0.32 * CE 3 is refined into CE [14] 0.03/0.32 * CE 2 is refined into CE [15] 0.03/0.32 0.03/0.32 0.03/0.32 ### Cost equations --> "Loop" of f6/8 0.03/0.32 * CEs [14] --> Loop 10 0.03/0.32 * CEs [15] --> Loop 11 0.03/0.32 * CEs [10] --> Loop 12 0.03/0.32 * CEs [11] --> Loop 13 0.03/0.32 * CEs [12] --> Loop 14 0.03/0.32 * CEs [13] --> Loop 15 0.03/0.32 0.03/0.32 ### Ranking functions of CR f6(A,B,C,D,E,F,G,H) 0.03/0.32 * RF of phase [10]: [A,B+C-D] 0.03/0.32 0.03/0.32 #### Partial ranking functions of CR f6(A,B,C,D,E,F,G,H) 0.03/0.32 * Partial RF of phase [10]: 0.03/0.32 - RF of loop [10:1]: 0.03/0.32 A 0.03/0.32 B+C-D 0.03/0.32 0.03/0.32 0.03/0.32 ### Specialization of cost equations f6_loop_cont/6 0.03/0.32 * CE 9 is refined into CE [16] 0.03/0.32 * CE 8 is refined into CE [17] 0.03/0.32 0.03/0.32 0.03/0.32 ### Cost equations --> "Loop" of f6_loop_cont/6 0.03/0.32 * CEs [16] --> Loop 16 0.03/0.32 * CEs [17] --> Loop 17 0.03/0.32 0.03/0.32 ### Ranking functions of CR f6_loop_cont(A,B,C,D,E,F) 0.03/0.32 0.03/0.32 #### Partial ranking functions of CR f6_loop_cont(A,B,C,D,E,F) 0.03/0.32 0.03/0.32 0.03/0.32 ### Specialization of cost equations f0/5 0.03/0.32 * CE 1 is refined into CE [18,19,20,21,22,23,24,25,26,27,28] 0.03/0.32 0.03/0.32 0.03/0.32 ### Cost equations --> "Loop" of f0/5 0.03/0.32 * CEs [27,28] --> Loop 18 0.03/0.32 * CEs [23] --> Loop 19 0.03/0.32 * CEs [22] --> Loop 20 0.03/0.32 * CEs [26] --> Loop 21 0.03/0.32 * CEs [25] --> Loop 22 0.03/0.32 * CEs [21] --> Loop 23 0.03/0.32 * CEs [19] --> Loop 24 0.03/0.32 * CEs [20] --> Loop 25 0.03/0.32 * CEs [18] --> Loop 26 0.03/0.32 * CEs [24] --> Loop 27 0.03/0.32 0.03/0.32 ### Ranking functions of CR f0(A,B,C,D,E) 0.03/0.32 0.03/0.32 #### Partial ranking functions of CR f0(A,B,C,D,E) 0.03/0.32 0.03/0.32 0.03/0.32 Computing Bounds 0.03/0.32 ===================================== 0.03/0.32 0.03/0.32 #### Cost of chains of f6(A,B,C,D,E,F,G,H): 0.03/0.32 * Chain [[11]]...: 1*it(11)+0 0.03/0.32 with precondition: [0>=A+1,B>=A,A+D=B+C] 0.03/0.32 0.03/0.32 * Chain [[11],12]: 1*it(11)+0 0.03/0.32 with precondition: [E=3,A+D=B+C,0>=A+1,B>=A] 0.03/0.32 0.03/0.32 * Chain [[10],15]: 1*it(10)+0 0.03/0.32 Such that:it(10) =< A 0.03/0.32 0.03/0.32 with precondition: [E=2,F=0,G=0,A=C,B=D,B=H,A>=1,B>=A] 0.03/0.32 0.03/0.32 * Chain [[10],14]: 1*it(10)+0 0.03/0.32 Such that:it(10) =< A 0.03/0.32 0.03/0.32 with precondition: [E=2,F=0,A+G=C,A+D=B+C,A+H=B+C,A>=1,B>=A,C>=A+1] 0.03/0.32 0.03/0.32 * Chain [[10],13]: 1*it(10)+0 0.03/0.32 Such that:it(10) =< A 0.03/0.32 0.03/0.32 with precondition: [E=2,F=0,A+G=C,A+D=B+C,A+H=B+C,A>=1,B>=A,A>=C+1] 0.03/0.32 0.03/0.32 * Chain [[10],12]: 1*it(10)+0 0.03/0.32 Such that:it(10) =< A 0.03/0.32 0.03/0.32 with precondition: [E=3,A+D=B+C,A>=1,B>=A] 0.03/0.32 0.03/0.32 * Chain [15]: 0 0.03/0.32 with precondition: [A=0,C=0,E=2,F=0,G=0,D=B,D=H,D>=0] 0.03/0.32 0.03/0.32 * Chain [14]: 0 0.03/0.32 with precondition: [A=0,E=2,F=0,D=H,D=B+C,D=B+G,B>=0,D>=B+1] 0.03/0.32 0.03/0.32 * Chain [13]: 0 0.03/0.32 with precondition: [A=0,E=2,F=0,D=H,D=B+C,D=B+G,B>=0,B>=D+1] 0.03/0.32 0.03/0.32 * Chain [12]: 0 0.03/0.32 with precondition: [E=3,B+C=A+D,B>=A] 0.03/0.32 0.03/0.32 0.03/0.32 #### Cost of chains of f6_loop_cont(A,B,C,D,E,F): 0.03/0.32 * Chain [17]: 0 0.03/0.32 with precondition: [A=2] 0.03/0.32 0.03/0.32 * Chain [16]: 0 0.03/0.32 with precondition: [A=3] 0.03/0.32 0.03/0.32 0.03/0.32 #### Cost of chains of f0(A,B,C,D,E): 0.03/0.32 * Chain [27]: 0 0.03/0.32 with precondition: [] 0.03/0.32 0.03/0.32 * Chain [26]: 0 0.03/0.32 with precondition: [B=0,D=0] 0.03/0.32 0.03/0.32 * Chain [25]: 0 0.03/0.32 with precondition: [B=0,0>=D+1] 0.03/0.32 0.03/0.32 * Chain [24]: 0 0.03/0.32 with precondition: [B=0,D>=1] 0.03/0.32 0.03/0.32 * Chain [23]: 1*s(1)+0 0.03/0.32 Such that:s(1) =< B 0.03/0.32 0.03/0.32 with precondition: [B=D,B>=1] 0.03/0.32 0.03/0.32 * Chain [22]: 1*s(2)+0 0.03/0.32 with precondition: [0>=B+1] 0.03/0.32 0.03/0.32 * Chain [21]: 1*s(3)+0 0.03/0.32 Such that:s(3) =< B 0.03/0.32 0.03/0.32 with precondition: [B>=1] 0.03/0.32 0.03/0.32 * Chain [20]: 1*s(4)+0 0.03/0.32 Such that:s(4) =< B 0.03/0.32 0.03/0.32 with precondition: [B>=1,D>=B+1] 0.03/0.32 0.03/0.32 * Chain [19]: 1*s(5)+0 0.03/0.32 Such that:s(5) =< B 0.03/0.32 0.03/0.32 with precondition: [B>=1,B>=D+1] 0.03/0.32 0.03/0.32 * Chain [18]...: 1*aux(1)+0 0.03/0.32 with precondition: [0>=B+1] 0.03/0.32 0.03/0.32 0.03/0.32 Closed-form bounds of f0(A,B,C,D,E): 0.03/0.32 ------------------------------------- 0.03/0.32 * Chain [27] with precondition: [] 0.03/0.32 - Upper bound: 0 0.03/0.32 - Complexity: constant 0.03/0.32 * Chain [26] with precondition: [B=0,D=0] 0.03/0.32 - Upper bound: 0 0.03/0.32 - Complexity: constant 0.03/0.32 * Chain [25] with precondition: [B=0,0>=D+1] 0.03/0.32 - Upper bound: 0 0.03/0.32 - Complexity: constant 0.03/0.32 * Chain [24] with precondition: [B=0,D>=1] 0.03/0.32 - Upper bound: 0 0.03/0.32 - Complexity: constant 0.03/0.32 * Chain [23] with precondition: [B=D,B>=1] 0.03/0.32 - Upper bound: B 0.03/0.32 - Complexity: n 0.03/0.32 * Chain [22] with precondition: [0>=B+1] 0.03/0.32 - Upper bound: inf 0.03/0.32 - Complexity: infinity 0.03/0.32 * Chain [21] with precondition: [B>=1] 0.03/0.32 - Upper bound: B 0.03/0.32 - Complexity: n 0.03/0.32 * Chain [20] with precondition: [B>=1,D>=B+1] 0.03/0.32 - Upper bound: B 0.03/0.32 - Complexity: n 0.03/0.32 * Chain [19] with precondition: [B>=1,B>=D+1] 0.03/0.32 - Upper bound: B 0.03/0.32 - Complexity: n 0.03/0.32 * Chain [18]... with precondition: [0>=B+1] 0.03/0.32 - Upper bound: inf 0.03/0.32 - Complexity: infinity 0.03/0.32 0.03/0.32 ### Maximum cost of f0(A,B,C,D,E): inf 0.03/0.32 Asymptotic class: infinity 0.03/0.32 * Total analysis performed in 259 ms. 0.03/0.32 0.03/0.43 EOF