0.69/0.72 MAYBE 0.69/0.72 0.69/0.72 Preprocessing Cost Relations 0.69/0.72 ===================================== 0.69/0.72 0.69/0.72 #### Computed strongly connected components 0.69/0.72 0. recursive : [f1/28] 0.69/0.72 1. non_recursive : [exit_location/1] 0.69/0.72 2. non_recursive : [f300/24] 0.69/0.72 3. non_recursive : [f1_loop_cont/25] 0.69/0.72 4. non_recursive : [f2/24] 0.69/0.72 0.69/0.72 #### Obtained direct recursion through partial evaluation 0.69/0.72 0. SCC is partially evaluated into f1/28 0.69/0.72 1. SCC is completely evaluated into other SCCs 0.69/0.72 2. SCC is completely evaluated into other SCCs 0.69/0.72 3. SCC is partially evaluated into f1_loop_cont/25 0.69/0.72 4. SCC is partially evaluated into f2/24 0.69/0.72 0.69/0.72 Control-Flow Refinement of Cost Relations 0.69/0.72 ===================================== 0.69/0.72 0.69/0.72 ### Specialization of cost equations f1/28 0.69/0.72 * CE 9 is refined into CE [12] 0.69/0.72 * CE 6 is refined into CE [13] 0.69/0.72 * CE 7 is refined into CE [14] 0.69/0.72 * CE 8 is refined into CE [15] 0.69/0.72 * CE 2 is refined into CE [16] 0.69/0.72 * CE 3 is refined into CE [17] 0.69/0.72 * CE 4 is refined into CE [18] 0.69/0.72 * CE 5 is refined into CE [19] 0.69/0.72 0.69/0.72 0.69/0.72 ### Cost equations --> "Loop" of f1/28 0.69/0.72 * CEs [16] --> Loop 12 0.69/0.72 * CEs [17] --> Loop 13 0.69/0.72 * CEs [18] --> Loop 14 0.69/0.72 * CEs [19] --> Loop 15 0.69/0.72 * CEs [12] --> Loop 16 0.69/0.72 * CEs [13] --> Loop 17 0.69/0.72 * CEs [14] --> Loop 18 0.69/0.72 * CEs [15] --> Loop 19 0.69/0.72 0.69/0.72 ### Ranking functions of CR f1(J,K,L,M,N,O,P,Q,R,S,T,U,V,W,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1) 0.69/0.72 0.69/0.72 #### Partial ranking functions of CR f1(J,K,L,M,N,O,P,Q,R,S,T,U,V,W,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1) 0.69/0.72 0.69/0.72 0.69/0.72 ### Specialization of cost equations f1_loop_cont/25 0.69/0.72 * CE 11 is refined into CE [20] 0.69/0.72 * CE 10 is refined into CE [21] 0.69/0.72 0.69/0.72 0.69/0.72 ### Cost equations --> "Loop" of f1_loop_cont/25 0.69/0.72 * CEs [20] --> Loop 20 0.69/0.72 * CEs [21] --> Loop 21 0.69/0.72 0.69/0.72 ### Ranking functions of CR f1_loop_cont(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) 0.69/0.72 0.69/0.72 #### Partial ranking functions of CR f1_loop_cont(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) 0.69/0.72 0.69/0.72 0.69/0.72 ### Specialization of cost equations f2/24 0.69/0.72 * CE 1 is refined into CE [22,23,24,25,26,27,28,29,30,31,32,33] 0.69/0.72 0.69/0.72 0.69/0.72 ### Cost equations --> "Loop" of f2/24 0.69/0.72 * CEs [32,33] --> Loop 22 0.69/0.72 * CEs [30,31] --> Loop 23 0.69/0.72 * CEs [23,25,29] --> Loop 24 0.69/0.72 * CEs [24,26,28] --> Loop 25 0.69/0.72 * CEs [22] --> Loop 26 0.69/0.72 * CEs [27] --> Loop 27 0.69/0.72 0.69/0.72 ### Ranking functions of CR f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,H1) 0.69/0.72 0.69/0.72 #### Partial ranking functions of CR f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,H1) 0.69/0.72 0.69/0.72 0.69/0.72 Computing Bounds 0.69/0.72 ===================================== 0.69/0.72 0.69/0.72 #### Cost of chains of f1(J,K,L,M,N,O,P,Q,R,S,T,U,V,W,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1): 0.69/0.72 * Chain [[14,15]]...: 2*it(14)+0 0.69/0.72 with precondition: [J>=1] 0.69/0.72 0.69/0.72 * Chain [[14,15],18]: 2*it(14)+0 0.69/0.72 with precondition: [H1=2,L=J1,M=K1,J>=1] 0.69/0.72 0.69/0.73 * Chain [[14,15],16]: 2*it(14)+0 0.69/0.73 with precondition: [H1=3,J>=1] 0.69/0.73 0.69/0.73 * Chain [[12,13]]...: 2*it(12)+0 0.69/0.73 with precondition: [0>=J+1] 0.69/0.73 0.69/0.73 * Chain [[12,13],17]: 2*it(12)+0 0.69/0.73 with precondition: [H1=2,T=R1,U=S1,V=T1,0>=J+1] 0.69/0.73 0.69/0.73 * Chain [[12,13],16]: 2*it(12)+0 0.69/0.73 with precondition: [H1=3,0>=J+1] 0.69/0.73 0.69/0.73 * Chain [19]: 0 0.69/0.73 with precondition: [J=0,H1=2,J1=L,K1=M,L1=N,M1=O,N1=P,O1=Q,P1=R,Q1=S,S1=U,T1=V] 0.69/0.73 0.69/0.73 * Chain [18]: 0 0.69/0.73 with precondition: [H1=2,J1=L,K1=M,M1=O,N1=P,P1=R,Q1=S,J>=1] 0.69/0.73 0.69/0.73 * Chain [17]: 0 0.69/0.73 with precondition: [H1=2,M1=O,N1=P,P1=R,Q1=S,R1=T,S1=U,T1=V,0>=J+1] 0.69/0.73 0.69/0.73 * Chain [16]: 0 0.69/0.73 with precondition: [H1=3] 0.69/0.73 0.69/0.73 0.69/0.73 #### Cost of chains of f1_loop_cont(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): 0.69/0.73 * Chain [21]: 0 0.69/0.73 with precondition: [A=2,C=B,C=D,C=E,C=F,C=G,C=H,C=I,C=J] 0.69/0.73 0.69/0.73 * Chain [20]: 0 0.69/0.73 with precondition: [A=3,C=B,C=D,C=E,C=F,C=G,C=H,C=I,C=J] 0.69/0.73 0.69/0.73 0.69/0.73 #### Cost of chains of f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,H1): 0.69/0.73 * Chain [27]: 0 0.69/0.73 with precondition: [] 0.69/0.73 0.69/0.73 * Chain [26]: 0 0.69/0.73 with precondition: [J=0] 0.69/0.73 0.69/0.73 * Chain [25]: 1*aux(1)+0 0.69/0.73 with precondition: [0>=J+1] 0.69/0.73 0.69/0.73 * Chain [24]: 1*aux(2)+0 0.69/0.73 with precondition: [J>=1] 0.69/0.73 0.69/0.73 * Chain [23]...: 1*aux(3)+0 0.69/0.73 with precondition: [0>=J+1] 0.69/0.73 0.69/0.73 * Chain [22]...: 1*aux(4)+0 0.69/0.73 with precondition: [J>=1] 0.69/0.73 0.69/0.73 0.69/0.73 Closed-form bounds of f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,H1): 0.69/0.73 ------------------------------------- 0.69/0.73 * Chain [27] with precondition: [] 0.69/0.73 - Upper bound: 0 0.69/0.73 - Complexity: constant 0.69/0.73 * Chain [26] with precondition: [J=0] 0.69/0.73 - Upper bound: 0 0.69/0.73 - Complexity: constant 0.69/0.73 * Chain [25] with precondition: [0>=J+1] 0.69/0.73 - Upper bound: inf 0.69/0.73 - Complexity: infinity 0.69/0.73 * Chain [24] with precondition: [J>=1] 0.69/0.73 - Upper bound: inf 0.69/0.73 - Complexity: infinity 0.69/0.73 * Chain [23]... with precondition: [0>=J+1] 0.69/0.73 - Upper bound: inf 0.69/0.73 - Complexity: infinity 0.69/0.73 * Chain [22]... with precondition: [J>=1] 0.69/0.73 - Upper bound: inf 0.69/0.73 - Complexity: infinity 0.69/0.73 0.69/0.73 ### Maximum cost of f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,H1): inf 0.69/0.73 Asymptotic class: infinity 0.69/0.73 * Total analysis performed in 632 ms. 0.69/0.73 0.72/0.83 EOF