0.03/0.24 WORST_CASE(?,O(1)) 0.03/0.24 0.03/0.24 Preprocessing Cost Relations 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 #### Computed strongly connected components 0.03/0.24 0. recursive : [f5/12] 0.03/0.24 1. non_recursive : [exit_location/1] 0.03/0.24 2. non_recursive : [f10/7] 0.03/0.24 3. non_recursive : [f11/7] 0.03/0.24 4. non_recursive : [f5_loop_cont/8] 0.03/0.24 5. non_recursive : [f12/7] 0.03/0.24 0.03/0.24 #### Obtained direct recursion through partial evaluation 0.03/0.24 0. SCC is partially evaluated into f5/12 0.03/0.24 1. SCC is completely evaluated into other SCCs 0.03/0.24 2. SCC is completely evaluated into other SCCs 0.03/0.24 3. SCC is completely evaluated into other SCCs 0.03/0.24 4. SCC is partially evaluated into f5_loop_cont/8 0.03/0.24 5. SCC is partially evaluated into f12/7 0.03/0.24 0.03/0.24 Control-Flow Refinement of Cost Relations 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 ### Specialization of cost equations f5/12 0.03/0.24 * CE 6 is refined into CE [10] 0.03/0.24 * CE 3 is refined into CE [11] 0.03/0.24 * CE 4 is refined into CE [12] 0.03/0.24 * CE 2 is refined into CE [13] 0.03/0.24 * CE 5 is refined into CE [14] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f5/12 0.03/0.24 * CEs [14] --> Loop 10 0.03/0.24 * CEs [10] --> Loop 11 0.03/0.24 * CEs [11] --> Loop 12 0.03/0.24 * CEs [12] --> Loop 13 0.03/0.24 * CEs [13] --> Loop 14 0.03/0.24 0.03/0.24 ### Ranking functions of CR f5(A,B,C,D,E,F,I,J,K,L,M,N) 0.03/0.24 * RF of phase [10]: [-B+4] 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f5(A,B,C,D,E,F,I,J,K,L,M,N) 0.03/0.24 * Partial RF of phase [10]: 0.03/0.24 - RF of loop [10:1]: 0.03/0.24 -B+4 0.03/0.24 0.03/0.24 0.03/0.24 ### Specialization of cost equations f5_loop_cont/8 0.03/0.24 * CE 9 is refined into CE [15] 0.03/0.24 * CE 8 is refined into CE [16] 0.03/0.24 * CE 7 is refined into CE [17] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f5_loop_cont/8 0.03/0.24 * CEs [15] --> Loop 15 0.03/0.24 * CEs [16] --> Loop 16 0.03/0.24 * CEs [17] --> Loop 17 0.03/0.24 0.03/0.24 ### Ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H) 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H) 0.03/0.24 0.03/0.24 0.03/0.24 ### Specialization of cost equations f12/7 0.03/0.24 * CE 1 is refined into CE [18,19,20,21,22] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f12/7 0.03/0.24 * CEs [18,19,20,21,22] --> Loop 18 0.03/0.24 0.03/0.24 ### Ranking functions of CR f12(A,B,C,D,E,F,I) 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f12(A,B,C,D,E,F,I) 0.03/0.24 0.03/0.24 0.03/0.24 Computing Bounds 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 #### Cost of chains of f5(A,B,C,D,E,F,I,J,K,L,M,N): 0.03/0.24 * Chain [[10],14]: 1*it(10)+0 0.03/0.24 Such that:it(10) =< -B+4 0.03/0.24 0.03/0.24 with precondition: [A=4,C=0,I=2,J=4,K=0,L=0,M=0,N=0,3>=B,B>=0] 0.03/0.24 0.03/0.24 * Chain [[10],13]: 1*it(10)+0 0.03/0.24 Such that:it(10) =< -B+J 0.03/0.24 0.03/0.24 with precondition: [A=4,C=0,I=3,K=L,K=M,K=N,4>=J,0>=K+1,B>=0,J>=B+1] 0.03/0.24 0.03/0.24 * Chain [[10],12]: 1*it(10)+0 0.03/0.24 Such that:it(10) =< -B+J 0.03/0.24 0.03/0.24 with precondition: [A=4,C=0,I=3,K=L,K=M,K=N,4>=J,B>=0,K>=1,J>=B+1] 0.03/0.24 0.03/0.24 * Chain [[10],11]: 1*it(10)+0 0.03/0.24 Such that:it(10) =< -B+4 0.03/0.24 0.03/0.24 with precondition: [A=4,C=0,I=4,3>=B,B>=0] 0.03/0.24 0.03/0.24 * Chain [11]: 0 0.03/0.24 with precondition: [A=4,I=4,B>=0] 0.03/0.24 0.03/0.24 0.03/0.24 #### Cost of chains of f5_loop_cont(A,B,C,D,E,F,G,H): 0.03/0.24 * Chain [17]: 0 0.03/0.24 with precondition: [A=2,B=4] 0.03/0.24 0.03/0.24 * Chain [16]: 0 0.03/0.24 with precondition: [A=3,B=4] 0.03/0.24 0.03/0.24 * Chain [15]: 0 0.03/0.24 with precondition: [A=4,B=4] 0.03/0.24 0.03/0.24 0.03/0.24 #### Cost of chains of f12(A,B,C,D,E,F,I): 0.03/0.24 * Chain [18]: 16 0.03/0.24 with precondition: [] 0.03/0.24 0.03/0.24 0.03/0.24 Closed-form bounds of f12(A,B,C,D,E,F,I): 0.03/0.24 ------------------------------------- 0.03/0.24 * Chain [18] with precondition: [] 0.03/0.24 - Upper bound: 16 0.03/0.24 - Complexity: constant 0.03/0.24 0.03/0.24 ### Maximum cost of f12(A,B,C,D,E,F,I): 16 0.03/0.24 Asymptotic class: constant 0.03/0.24 * Total analysis performed in 174 ms. 0.03/0.24 0.03/0.34 EOF