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