0.03/0.32 WORST_CASE(?,O(1)) 0.03/0.32 0.03/0.32 Preprocessing Cost Relations 0.03/0.32 ===================================== 0.03/0.32 0.03/0.32 #### Computed strongly connected components 0.03/0.32 0. recursive : [f5/19] 0.03/0.32 1. non_recursive : [exit_location/1] 0.03/0.32 2. non_recursive : [f28/11] 0.03/0.32 3. non_recursive : [f5_loop_cont/12] 0.03/0.32 4. non_recursive : [f0/11] 0.03/0.32 0.03/0.32 #### Obtained direct recursion through partial evaluation 0.03/0.32 0. SCC is partially evaluated into f5/19 0.03/0.32 1. SCC is completely evaluated into other SCCs 0.03/0.32 2. SCC is completely evaluated into other SCCs 0.03/0.32 3. SCC is partially evaluated into f5_loop_cont/12 0.03/0.32 4. SCC is partially evaluated into f0/11 0.03/0.32 0.03/0.32 Control-Flow Refinement of Cost Relations 0.03/0.32 ===================================== 0.03/0.32 0.03/0.32 ### Specialization of cost equations f5/19 0.03/0.32 * CE 5 is refined into CE [8] 0.03/0.32 * CE 4 is refined into CE [9] 0.03/0.32 * CE 2 is refined into CE [10] 0.03/0.32 * CE 3 is refined into CE [11] 0.03/0.32 0.03/0.32 0.03/0.32 ### Cost equations --> "Loop" of f5/19 0.03/0.32 * CEs [10] --> Loop 8 0.03/0.32 * CEs [11] --> Loop 9 0.03/0.32 * CEs [8] --> Loop 10 0.03/0.32 * CEs [9] --> Loop 11 0.03/0.32 0.03/0.32 ### Ranking functions of CR f5(B,C,D,E,F,G,H,I,J,M,N,O,P,Q,R,S,T,U,V) 0.03/0.32 * RF of phase [8,9]: [-C+32] 0.03/0.32 0.03/0.32 #### Partial ranking functions of CR f5(B,C,D,E,F,G,H,I,J,M,N,O,P,Q,R,S,T,U,V) 0.03/0.32 * Partial RF of phase [8,9]: 0.03/0.32 - RF of loop [8:1]: 0.03/0.32 -B+32 0.03/0.32 - RF of loop [8:1,9:1]: 0.03/0.32 -C+32 0.03/0.32 0.03/0.32 0.03/0.32 ### Specialization of cost equations f5_loop_cont/12 0.03/0.32 * CE 7 is refined into CE [12] 0.03/0.32 * CE 6 is refined into CE [13] 0.03/0.32 0.03/0.32 0.03/0.32 ### Cost equations --> "Loop" of f5_loop_cont/12 0.03/0.32 * CEs [12] --> Loop 12 0.03/0.32 * CEs [13] --> Loop 13 0.03/0.32 0.03/0.32 ### Ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L) 0.03/0.32 0.03/0.32 #### Partial ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L) 0.03/0.32 0.03/0.32 0.03/0.32 ### Specialization of cost equations f0/11 0.03/0.32 * CE 1 is refined into CE [14,15,16] 0.03/0.32 0.03/0.32 0.03/0.32 ### Cost equations --> "Loop" of f0/11 0.03/0.32 * CEs [14,15,16] --> Loop 14 0.03/0.32 0.03/0.32 ### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,M) 0.03/0.32 0.03/0.32 #### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,M) 0.03/0.32 0.03/0.32 0.03/0.32 Computing Bounds 0.03/0.32 ===================================== 0.03/0.32 0.03/0.32 #### Cost of chains of f5(B,C,D,E,F,G,H,I,J,M,N,O,P,Q,R,S,T,U,V): 0.03/0.32 * Chain [[8,9],11]: 1*it(8)+1*it(9)+0 0.03/0.32 Such that:it(8) =< -B+R 0.03/0.32 aux(3) =< -C+32 0.03/0.32 it(8) =< aux(3) 0.03/0.32 it(9) =< aux(3) 0.03/0.32 0.03/0.32 with precondition: [M=2,O=32,N=Q,N=R,T=U,T=V,1>=P,B>=0,P>=0,C>=B,N>=B+P,B+P+31>=C+N] 0.03/0.32 0.03/0.32 * Chain [[8,9],10]: 2*it(8)+0 0.03/0.32 Such that:aux(4) =< -C+32 0.03/0.32 it(8) =< aux(4) 0.03/0.32 0.03/0.32 with precondition: [M=3,31>=C,B>=0,C>=B] 0.03/0.32 0.03/0.32 * Chain [10]: 0 0.03/0.32 with precondition: [M=3,B>=0,C>=B] 0.03/0.32 0.03/0.32 0.03/0.32 #### Cost of chains of f5_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L): 0.03/0.32 * Chain [13]: 0 0.03/0.32 with precondition: [A=2] 0.03/0.32 0.03/0.32 * Chain [12]: 0 0.03/0.32 with precondition: [A=3] 0.03/0.32 0.03/0.32 0.03/0.32 #### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,M): 0.03/0.32 * Chain [14]: 128 0.03/0.32 with precondition: [] 0.03/0.32 0.03/0.32 0.03/0.32 Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,M): 0.03/0.32 ------------------------------------- 0.03/0.32 * Chain [14] with precondition: [] 0.03/0.32 - Upper bound: 128 0.03/0.32 - Complexity: constant 0.03/0.32 0.03/0.32 ### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,M): 128 0.03/0.32 Asymptotic class: constant 0.03/0.32 * Total analysis performed in 252 ms. 0.03/0.32 0.03/0.43 EOF