0.03/0.08 WORST_CASE(?,O(1)) 0.03/0.08 0.03/0.08 Preprocessing Cost Relations 0.03/0.08 ===================================== 0.03/0.08 0.03/0.08 #### Computed strongly connected components 0.03/0.08 0. non_recursive : [f75/49] 0.03/0.08 1. non_recursive : [f0/49] 0.03/0.08 0.03/0.08 #### Obtained direct recursion through partial evaluation 0.03/0.08 0. SCC is completely evaluated into other SCCs 0.03/0.08 1. SCC is partially evaluated into f0/49 0.03/0.08 0.03/0.08 Control-Flow Refinement of Cost Relations 0.03/0.08 ===================================== 0.03/0.08 0.03/0.08 ### Specialization of cost equations f0/49 0.03/0.08 * CE 1 is refined into CE [2] 0.03/0.08 0.03/0.08 0.03/0.08 ### Cost equations --> "Loop" of f0/49 0.03/0.08 * CEs [2] --> Loop 2 0.03/0.08 0.03/0.08 ### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,E2) 0.03/0.08 0.03/0.08 #### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,E2) 0.03/0.08 0.03/0.08 0.03/0.08 Computing Bounds 0.03/0.08 ===================================== 0.03/0.08 0.03/0.08 #### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,E2): 0.03/0.08 * Chain [2]: 0 0.03/0.08 with precondition: [] 0.03/0.08 0.03/0.08 0.03/0.08 Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,E2): 0.03/0.08 ------------------------------------- 0.03/0.08 * Chain [2] with precondition: [] 0.03/0.08 - Upper bound: 0 0.03/0.08 - Complexity: constant 0.03/0.08 0.03/0.08 ### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,E2): 0 0.03/0.08 Asymptotic class: constant 0.03/0.08 * Total analysis performed in 22 ms. 0.03/0.08 0.03/0.09 EOF