0.03/0.16 MAYBE 0.03/0.16 0.03/0.16 Preprocessing Cost Relations 0.03/0.16 ===================================== 0.03/0.16 0.03/0.16 #### Computed strongly connected components 0.03/0.16 0. non_recursive : [f1/12] 0.03/0.16 1. recursive : [f2/13] 0.03/0.16 2. non_recursive : [exit_location/1] 0.03/0.16 3. non_recursive : [f2_loop_cont/13] 0.03/0.16 4. non_recursive : [f300/12] 0.03/0.16 0.03/0.16 #### Obtained direct recursion through partial evaluation 0.03/0.16 0. SCC is completely evaluated into other SCCs 0.03/0.16 1. SCC is partially evaluated into f2/13 0.03/0.16 2. SCC is completely evaluated into other SCCs 0.03/0.16 3. SCC is partially evaluated into f2_loop_cont/13 0.03/0.16 4. SCC is partially evaluated into f300/12 0.03/0.16 0.03/0.16 Control-Flow Refinement of Cost Relations 0.03/0.16 ===================================== 0.03/0.16 0.03/0.16 ### Specialization of cost equations f2/13 0.03/0.16 * CE 5 is refined into CE [8] 0.03/0.16 * CE 4 is refined into CE [9] 0.03/0.16 * CE 3 is refined into CE [10] 0.03/0.16 0.03/0.16 0.03/0.16 ### Cost equations --> "Loop" of f2/13 0.03/0.16 * CEs [10] --> Loop 8 0.03/0.16 * CEs [8] --> Loop 9 0.03/0.16 * CEs [9] --> Loop 10 0.03/0.16 0.03/0.16 ### Ranking functions of CR f2(A,B,C,D,E,F,G,S,T,U,V,W,X) 0.03/0.16 0.03/0.16 #### Partial ranking functions of CR f2(A,B,C,D,E,F,G,S,T,U,V,W,X) 0.03/0.16 0.03/0.16 0.03/0.16 ### Specialization of cost equations f2_loop_cont/13 0.03/0.16 * CE 7 is refined into CE [11] 0.03/0.16 * CE 6 is refined into CE [12] 0.03/0.16 0.03/0.16 0.03/0.16 ### Cost equations --> "Loop" of f2_loop_cont/13 0.03/0.17 * CEs [11] --> Loop 11 0.03/0.17 * CEs [12] --> Loop 12 0.03/0.17 0.03/0.17 ### Ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M) 0.03/0.17 0.03/0.17 #### Partial ranking functions of CR f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M) 0.03/0.17 0.03/0.17 0.03/0.17 ### Specialization of cost equations f300/12 0.03/0.17 * CE 2 is refined into CE [13,14,15,16,17] 0.03/0.17 * CE 1 is refined into CE [18] 0.03/0.17 0.03/0.17 0.03/0.17 ### Cost equations --> "Loop" of f300/12 0.03/0.17 * CEs [14] --> Loop 13 0.03/0.17 * CEs [15] --> Loop 14 0.03/0.17 * CEs [18] --> Loop 15 0.03/0.17 * CEs [13] --> Loop 16 0.03/0.17 * CEs [16,17] --> Loop 17 0.03/0.17 0.03/0.17 ### Ranking functions of CR f300(A,B,C,D,E,F,G,H,I,J,K,S) 0.03/0.17 0.03/0.17 #### Partial ranking functions of CR f300(A,B,C,D,E,F,G,H,I,J,K,S) 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 f2(A,B,C,D,E,F,G,S,T,U,V,W,X): 0.03/0.17 * Chain [[8]]...: 1*it(8)+0 0.03/0.17 with precondition: [E=F,A>=2] 0.03/0.17 0.03/0.17 * Chain [[8],9]: 1*it(8)+0 0.03/0.17 with precondition: [S=3,E=F,A>=2] 0.03/0.17 0.03/0.17 * Chain [10]: 0 0.03/0.17 with precondition: [S=2,V=D,F=E,F=W,1>=A] 0.03/0.17 0.03/0.17 * Chain [9]: 0 0.03/0.17 with precondition: [S=3,F=E] 0.03/0.17 0.03/0.17 0.03/0.17 #### Cost of chains of f2_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M): 0.03/0.17 * Chain [12]: 0 0.03/0.17 with precondition: [A=2,I>=1] 0.03/0.17 0.03/0.17 * Chain [11]: 0 0.03/0.17 with precondition: [A=3,I>=1] 0.03/0.17 0.03/0.17 0.03/0.17 #### Cost of chains of f300(A,B,C,D,E,F,G,H,I,J,K,S): 0.03/0.17 * Chain [17]...: 1*aux(1)+0 0.03/0.17 with precondition: [A>=2,H>=1] 0.03/0.17 0.03/0.17 * Chain [16]: 0 0.03/0.17 with precondition: [1>=A,H>=1] 0.03/0.17 0.03/0.17 * Chain [15]: 0 0.03/0.17 with precondition: [0>=H] 0.03/0.17 0.03/0.17 * Chain [14]: 1*s(3)+0 0.03/0.17 with precondition: [A>=2,H>=1] 0.03/0.17 0.03/0.17 * Chain [13]: 0 0.03/0.17 with precondition: [H>=1] 0.03/0.17 0.03/0.17 0.03/0.17 Closed-form bounds of f300(A,B,C,D,E,F,G,H,I,J,K,S): 0.03/0.17 ------------------------------------- 0.03/0.17 * Chain [17]... with precondition: [A>=2,H>=1] 0.03/0.17 - Upper bound: inf 0.03/0.17 - Complexity: infinity 0.03/0.17 * Chain [16] with precondition: [1>=A,H>=1] 0.03/0.17 - Upper bound: 0 0.03/0.17 - Complexity: constant 0.03/0.17 * Chain [15] with precondition: [0>=H] 0.03/0.17 - Upper bound: 0 0.03/0.17 - Complexity: constant 0.03/0.17 * Chain [14] with precondition: [A>=2,H>=1] 0.03/0.17 - Upper bound: inf 0.03/0.17 - Complexity: infinity 0.03/0.17 * Chain [13] with precondition: [H>=1] 0.03/0.17 - Upper bound: 0 0.03/0.17 - Complexity: constant 0.03/0.17 0.03/0.17 ### Maximum cost of f300(A,B,C,D,E,F,G,H,I,J,K,S): inf 0.03/0.17 Asymptotic class: infinity 0.03/0.17 * Total analysis performed in 105 ms. 0.03/0.17 0.03/0.27 EOF