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