0.03/0.30 MAYBE 0.03/0.30 0.03/0.30 Preprocessing Cost Relations 0.03/0.30 ===================================== 0.03/0.30 0.03/0.30 #### Computed strongly connected components 0.03/0.30 0. recursive : [f1/25] 0.03/0.30 1. non_recursive : [exit_location/1] 0.03/0.30 2. non_recursive : [f4/15] 0.03/0.30 3. non_recursive : [f1_loop_cont/16] 0.03/0.30 4. non_recursive : [f3/15] 0.03/0.30 0.03/0.30 #### Obtained direct recursion through partial evaluation 0.03/0.30 0. SCC is partially evaluated into f1/25 0.03/0.30 1. SCC is completely evaluated into other SCCs 0.03/0.30 2. SCC is completely evaluated into other SCCs 0.03/0.30 3. SCC is partially evaluated into f1_loop_cont/16 0.03/0.30 4. SCC is partially evaluated into f3/15 0.03/0.30 0.03/0.30 Control-Flow Refinement of Cost Relations 0.03/0.30 ===================================== 0.03/0.30 0.03/0.30 ### Specialization of cost equations f1/25 0.03/0.30 * CE 5 is refined into CE [8] 0.03/0.30 * CE 4 is refined into CE [9] 0.03/0.30 * CE 3 is refined into CE [10] 0.03/0.30 0.03/0.30 0.03/0.30 ### Cost equations --> "Loop" of f1/25 0.03/0.30 * CEs [10] --> Loop 7 0.03/0.30 * CEs [8] --> Loop 8 0.03/0.30 * CEs [9] --> Loop 9 0.03/0.30 0.03/0.30 ### Ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1) 0.03/0.30 * RF of phase [7]: [A-B,-B+H] 0.03/0.30 0.03/0.30 #### Partial ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1) 0.03/0.30 * Partial RF of phase [7]: 0.03/0.30 - RF of loop [7:1]: 0.03/0.30 A-B 0.03/0.30 -B+H 0.03/0.30 0.03/0.30 0.03/0.30 ### Specialization of cost equations f1_loop_cont/16 0.03/0.30 * CE 7 is refined into CE [11] 0.03/0.30 * CE 6 is refined into CE [12] 0.03/0.30 0.03/0.30 0.03/0.31 ### Cost equations --> "Loop" of f1_loop_cont/16 0.03/0.31 * CEs [11] --> Loop 10 0.03/0.31 * CEs [12] --> Loop 11 0.03/0.31 0.03/0.31 ### Ranking functions of CR f1_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) 0.03/0.31 0.03/0.31 #### Partial ranking functions of CR f1_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) 0.03/0.31 0.03/0.31 0.03/0.31 ### Specialization of cost equations f3/15 0.03/0.31 * CE 1 is refined into CE [13] 0.03/0.31 * CE 2 is refined into CE [14,15,16,17] 0.03/0.31 0.03/0.31 0.03/0.31 ### Cost equations --> "Loop" of f3/15 0.03/0.31 * CEs [13,14,15,16,17] --> Loop 12 0.03/0.31 0.03/0.31 ### Ranking functions of CR f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Z) 0.03/0.31 0.03/0.31 #### Partial ranking functions of CR f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Z) 0.03/0.31 0.03/0.31 0.03/0.31 Computing Bounds 0.03/0.31 ===================================== 0.03/0.31 0.03/0.31 #### Cost of chains of f1(A,B,C,D,E,F,G,H,I,J,K,L,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1): 0.03/0.31 * Chain [[7],9]: 1*it(7)+0 0.03/0.31 Such that:it(7) =< -B+H 0.03/0.31 0.03/0.31 with precondition: [Z=2,C=E,A=H,A=G1+1,B>=2,H1>=2,A>=B+1,B1>=H1] 0.03/0.31 0.03/0.31 * Chain [[7],8]: 1*it(7)+0 0.03/0.31 Such that:it(7) =< A-B 0.03/0.31 0.03/0.31 with precondition: [Z=3,C=E,A=H,B>=2,A>=B+1] 0.03/0.31 0.03/0.31 * Chain [9]: 0 0.03/0.31 with precondition: [Z=2,A=B,E=C,F1=F,G1=G,A=H,E=L1,A>=2,H1>=2,B1>=H1] 0.03/0.31 0.03/0.31 * Chain [8]: 0 0.03/0.31 with precondition: [Z=3,H=A,E=C,B>=2,H>=B] 0.03/0.31 0.03/0.31 0.03/0.31 #### Cost of chains of f1_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P): 0.03/0.31 * Chain [11]: 0 0.03/0.31 with precondition: [A=2] 0.03/0.31 0.03/0.31 * Chain [10]: 0 0.03/0.31 with precondition: [A=3] 0.03/0.31 0.03/0.31 0.03/0.31 #### Cost of chains of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Z): 0.03/0.31 * Chain [12]: 1*aux(1)+0 0.03/0.31 with precondition: [] 0.03/0.31 0.03/0.31 0.03/0.31 Closed-form bounds of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Z): 0.03/0.31 ------------------------------------- 0.03/0.31 * Chain [12] with precondition: [] 0.03/0.31 - Upper bound: inf 0.03/0.31 - Complexity: infinity 0.03/0.31 0.03/0.31 ### Maximum cost of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Z): inf 0.03/0.31 Asymptotic class: infinity 0.03/0.31 * Total analysis performed in 227 ms. 0.03/0.31 0.03/0.41 EOF