0.04/0.20 WORST_CASE(?,O(1)) 0.04/0.20 0.04/0.20 Preprocessing Cost Relations 0.04/0.20 ===================================== 0.04/0.20 0.04/0.20 #### Computed strongly connected components 0.04/0.20 0. non_recursive : [f32/15] 0.04/0.20 1. non_recursive : [f26/15] 0.04/0.20 2. non_recursive : [f23/15] 0.04/0.20 3. non_recursive : [f36/15] 0.04/0.20 4. non_recursive : [f11/15] 0.04/0.20 5. non_recursive : [f0/15] 0.04/0.20 0.04/0.20 #### Obtained direct recursion through partial evaluation 0.04/0.20 0. SCC is completely evaluated into other SCCs 0.04/0.20 1. SCC is completely evaluated into other SCCs 0.04/0.20 2. SCC is partially evaluated into f23/15 0.04/0.20 3. SCC is completely evaluated into other SCCs 0.04/0.20 4. SCC is partially evaluated into f11/15 0.04/0.20 5. SCC is partially evaluated into f0/15 0.04/0.20 0.04/0.20 Control-Flow Refinement of Cost Relations 0.04/0.20 ===================================== 0.04/0.20 0.04/0.20 ### Specialization of cost equations f23/15 0.04/0.20 * CE 8 is discarded (unfeasible) 0.04/0.20 * CE 7 is refined into CE [10] 0.04/0.20 * CE 9 is refined into CE [11] 0.04/0.20 0.04/0.20 0.04/0.20 ### Cost equations --> "Loop" of f23/15 0.04/0.20 * CEs [11] --> Loop 8 0.04/0.20 * CEs [10] --> Loop 9 0.04/0.20 0.04/0.20 ### Ranking functions of CR f23(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 0.04/0.20 0.04/0.20 #### Partial ranking functions of CR f23(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 0.04/0.20 0.04/0.20 0.04/0.20 ### Specialization of cost equations f11/15 0.04/0.20 * CE 6 is discarded (unfeasible) 0.04/0.20 * CE 5 is refined into CE [12] 0.04/0.20 * CE 3 is refined into CE [13] 0.04/0.20 * CE 4 is refined into CE [14] 0.04/0.20 0.04/0.20 0.04/0.20 ### Cost equations --> "Loop" of f11/15 0.04/0.20 * CEs [13,14] --> Loop 10 0.04/0.20 * CEs [12] --> Loop 11 0.04/0.20 0.04/0.20 ### Ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 0.04/0.20 0.04/0.20 #### Partial ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 0.04/0.20 0.04/0.20 0.04/0.20 ### Specialization of cost equations f0/15 0.04/0.20 * CE 1 is refined into CE [15] 0.04/0.20 * CE 2 is refined into CE [16] 0.04/0.20 0.04/0.20 0.04/0.20 ### Cost equations --> "Loop" of f0/15 0.04/0.20 * CEs [15,16] --> Loop 12 0.04/0.20 0.04/0.20 ### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 0.04/0.20 0.04/0.20 #### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q) 0.04/0.20 0.04/0.20 0.04/0.20 Computing Bounds 0.04/0.20 ===================================== 0.04/0.20 0.04/0.20 #### Cost of chains of f23(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q): 0.04/0.20 * Chain [9]: 0 0.04/0.20 with precondition: [A=100,C=1,D=1,E=1,F=100,H=0] 0.04/0.20 0.04/0.20 * Chain [8]: 0 0.04/0.20 with precondition: [A=100,C=1,D=1,E=1,F=100,H=1] 0.04/0.20 0.04/0.20 0.04/0.20 #### Cost of chains of f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q): 0.04/0.20 * Chain [11]: 0 0.04/0.20 with precondition: [A=100,C=0] 0.04/0.20 0.04/0.20 * Chain [10]: 0 0.04/0.20 with precondition: [A=100,C=1] 0.04/0.20 0.04/0.20 0.04/0.20 #### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q): 0.04/0.20 * Chain [12]: 0 0.04/0.20 with precondition: [] 0.04/0.20 0.04/0.20 0.04/0.20 Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q): 0.04/0.20 ------------------------------------- 0.04/0.20 * Chain [12] with precondition: [] 0.04/0.20 - Upper bound: 0 0.04/0.20 - Complexity: constant 0.04/0.20 0.04/0.20 ### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q): 0 0.04/0.20 Asymptotic class: constant 0.04/0.20 * Total analysis performed in 125 ms. 0.04/0.20 0.04/0.30 EOF