0.03/0.10 MAYBE 0.03/0.10 0.03/0.10 Preprocessing Cost Relations 0.03/0.10 ===================================== 0.03/0.10 0.03/0.10 #### Computed strongly connected components 0.03/0.10 0. recursive : [f2/4] 0.03/0.10 1. non_recursive : [exit_location/1] 0.03/0.10 2. non_recursive : [f1/3] 0.03/0.10 3. non_recursive : [f2_loop_cont/4] 0.03/0.10 4. non_recursive : [f300/3] 0.03/0.10 0.03/0.10 #### Obtained direct recursion through partial evaluation 0.03/0.10 0. SCC is partially evaluated into f2/4 0.03/0.10 1. SCC is completely evaluated into other SCCs 0.03/0.10 2. SCC is completely evaluated into other SCCs 0.03/0.10 3. SCC is partially evaluated into f2_loop_cont/4 0.03/0.10 4. SCC is partially evaluated into f300/3 0.03/0.10 0.03/0.10 Control-Flow Refinement of Cost Relations 0.03/0.10 ===================================== 0.03/0.10 0.03/0.10 ### Specialization of cost equations f2/4 0.03/0.10 * CE 4 is refined into CE [7] 0.03/0.10 * CE 3 is refined into CE [8] 0.03/0.10 * CE 2 is refined into CE [9] 0.03/0.10 0.03/0.10 0.03/0.10 ### Cost equations --> "Loop" of f2/4 0.03/0.10 * CEs [9] --> Loop 7 0.03/0.10 * CEs [7] --> Loop 8 0.03/0.10 * CEs [8] --> Loop 9 0.03/0.10 0.03/0.10 ### Ranking functions of CR f2(A,B,D,E) 0.03/0.10 0.03/0.10 #### Partial ranking functions of CR f2(A,B,D,E) 0.03/0.10 0.03/0.10 0.03/0.10 ### Specialization of cost equations f2_loop_cont/4 0.03/0.10 * CE 6 is refined into CE [10] 0.03/0.10 * CE 5 is refined into CE [11] 0.03/0.10 0.03/0.10 0.03/0.10 ### Cost equations --> "Loop" of f2_loop_cont/4 0.03/0.10 * CEs [10] --> Loop 10 0.03/0.10 * CEs [11] --> Loop 11 0.03/0.10 0.03/0.10 ### Ranking functions of CR f2_loop_cont(A,B,C,D) 0.03/0.10 0.03/0.10 #### Partial ranking functions of CR f2_loop_cont(A,B,C,D) 0.03/0.10 0.03/0.10 0.03/0.10 ### Specialization of cost equations f300/3 0.03/0.10 * CE 1 is refined into CE [12,13,14,15,16] 0.03/0.10 0.03/0.10 0.03/0.10 ### Cost equations --> "Loop" of f300/3 0.03/0.10 * CEs [15,16] --> Loop 12 0.03/0.10 * CEs [14] --> Loop 13 0.03/0.10 * CEs [12] --> Loop 14 0.03/0.10 * CEs [13] --> Loop 15 0.03/0.10 0.03/0.10 ### Ranking functions of CR f300(A,B,D) 0.03/0.10 0.03/0.10 #### Partial ranking functions of CR f300(A,B,D) 0.03/0.10 0.03/0.10 0.03/0.10 Computing Bounds 0.03/0.10 ===================================== 0.03/0.10 0.03/0.10 #### Cost of chains of f2(A,B,D,E): 0.03/0.10 * Chain [[7]]...: 1*it(7)+0 0.03/0.10 with precondition: [A>=0] 0.03/0.10 0.03/0.10 * Chain [[7],8]: 1*it(7)+0 0.03/0.10 with precondition: [D=3,A>=0] 0.03/0.10 0.03/0.10 * Chain [9]: 0 0.03/0.10 with precondition: [D=2,0>=A+1] 0.03/0.10 0.03/0.10 * Chain [8]: 0 0.03/0.10 with precondition: [D=3] 0.03/0.10 0.03/0.10 0.03/0.10 #### Cost of chains of f2_loop_cont(A,B,C,D): 0.03/0.10 * Chain [11]: 0 0.03/0.10 with precondition: [A=2] 0.03/0.10 0.03/0.10 * Chain [10]: 0 0.03/0.10 with precondition: [A=3] 0.03/0.10 0.03/0.10 0.03/0.10 #### Cost of chains of f300(A,B,D): 0.03/0.10 * Chain [15]: 0 0.03/0.10 with precondition: [] 0.03/0.10 0.03/0.10 * Chain [14]: 0 0.03/0.10 with precondition: [0>=A+1] 0.03/0.10 0.03/0.10 * Chain [13]: 1*s(1)+0 0.03/0.10 with precondition: [A>=0] 0.03/0.10 0.03/0.10 * Chain [12]...: 1*aux(1)+0 0.03/0.10 with precondition: [A>=0] 0.03/0.10 0.03/0.10 0.03/0.10 Closed-form bounds of f300(A,B,D): 0.03/0.10 ------------------------------------- 0.03/0.10 * Chain [15] with precondition: [] 0.03/0.10 - Upper bound: 0 0.03/0.10 - Complexity: constant 0.03/0.10 * Chain [14] with precondition: [0>=A+1] 0.03/0.10 - Upper bound: 0 0.03/0.10 - Complexity: constant 0.03/0.10 * Chain [13] with precondition: [A>=0] 0.03/0.10 - Upper bound: inf 0.03/0.10 - Complexity: infinity 0.03/0.10 * Chain [12]... with precondition: [A>=0] 0.03/0.10 - Upper bound: inf 0.03/0.10 - Complexity: infinity 0.03/0.10 0.03/0.10 ### Maximum cost of f300(A,B,D): inf 0.03/0.10 Asymptotic class: infinity 0.03/0.10 * Total analysis performed in 45 ms. 0.03/0.10 0.03/0.20 EOF