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