0.77/0.83 MAYBE 0.77/0.83 0.77/0.83 Preprocessing Cost Relations 0.77/0.83 ===================================== 0.77/0.83 0.77/0.83 #### Computed strongly connected components 0.77/0.83 0. recursive : [f1/29] 0.77/0.83 1. non_recursive : [exit_location/1] 0.77/0.83 2. recursive : [f12/29] 0.77/0.83 3. non_recursive : [f9/29] 0.77/0.83 4. non_recursive : [f12_loop_cont/30] 0.77/0.83 5. non_recursive : [f1_loop_cont/30] 0.77/0.83 6. non_recursive : [f8/29] 0.77/0.83 0.77/0.83 #### Obtained direct recursion through partial evaluation 0.77/0.83 0. SCC is partially evaluated into f1/29 0.77/0.83 1. SCC is completely evaluated into other SCCs 0.77/0.83 2. SCC is partially evaluated into f12/29 0.77/0.83 3. SCC is completely evaluated into other SCCs 0.77/0.83 4. SCC is partially evaluated into f12_loop_cont/30 0.77/0.83 5. SCC is partially evaluated into f1_loop_cont/30 0.77/0.83 6. SCC is partially evaluated into f8/29 0.77/0.83 0.77/0.83 Control-Flow Refinement of Cost Relations 0.77/0.83 ===================================== 0.77/0.83 0.77/0.83 ### Specialization of cost equations f1/29 0.77/0.83 * CE 4 is refined into CE [13] 0.77/0.83 * CE 5 is refined into CE [14] 0.77/0.83 * CE 3 is refined into CE [15] 0.77/0.83 0.77/0.83 0.77/0.83 ### Cost equations --> "Loop" of f1/29 0.77/0.83 * CEs [15] --> Loop 12 0.77/0.83 * CEs [13] --> Loop 13 0.77/0.83 * CEs [14] --> Loop 14 0.77/0.83 0.77/0.83 ### Ranking functions of CR f1(B,C,E,I,J,K,L,M,N,O,Q,Y,Z,B1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2) 0.77/0.83 * RF of phase [12]: [B-J,I-J] 0.77/0.83 0.77/0.83 #### Partial ranking functions of CR f1(B,C,E,I,J,K,L,M,N,O,Q,Y,Z,B1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2) 0.77/0.83 * Partial RF of phase [12]: 0.77/0.83 - RF of loop [12:1]: 0.77/0.83 B-J 0.77/0.83 I-J 0.77/0.83 0.77/0.83 0.77/0.83 ### Specialization of cost equations f12/29 0.77/0.83 * CE 10 is refined into CE [16] 0.77/0.83 * CE 9 is refined into CE [17] 0.77/0.83 * CE 8 is refined into CE [18] 0.77/0.83 0.77/0.83 0.77/0.83 ### Cost equations --> "Loop" of f12/29 0.77/0.83 * CEs [18] --> Loop 15 0.77/0.83 * CEs [16] --> Loop 16 0.77/0.83 * CEs [17] --> Loop 17 0.77/0.83 0.77/0.83 ### Ranking functions of CR f12(A,B,C,D,E,F,G,H,T,U,V,W,X,Z,A1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2) 0.77/0.83 0.77/0.83 #### Partial ranking functions of CR f12(A,B,C,D,E,F,G,H,T,U,V,W,X,Z,A1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2) 0.77/0.83 0.77/0.83 0.77/0.83 ### Specialization of cost equations f12_loop_cont/30 0.77/0.83 * CE 12 is refined into CE [19] 0.77/0.83 * CE 11 is refined into CE [20] 0.77/0.83 0.77/0.83 0.77/0.83 ### Cost equations --> "Loop" of f12_loop_cont/30 0.77/0.83 * CEs [19] --> Loop 18 0.77/0.83 * CEs [20] --> Loop 19 0.77/0.83 0.77/0.83 ### Ranking functions of CR f12_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,Z,A1,B1,C1,D1) 0.77/0.83 0.77/0.83 #### Partial ranking functions of CR f12_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,Z,A1,B1,C1,D1) 0.77/0.83 0.77/0.83 0.77/0.83 ### Specialization of cost equations f1_loop_cont/30 0.77/0.83 * CE 7 is refined into CE [21,22,23,24,25,26] 0.77/0.83 * CE 6 is refined into CE [27] 0.77/0.83 0.77/0.83 0.77/0.83 ### Cost equations --> "Loop" of f1_loop_cont/30 0.77/0.83 * CEs [24] --> Loop 20 0.77/0.83 * CEs [23] --> Loop 21 0.77/0.83 * CEs [22] --> Loop 22 0.77/0.83 * CEs [21] --> Loop 23 0.77/0.83 * CEs [27] --> Loop 24 0.77/0.83 * CEs [25,26] --> Loop 25 0.77/0.83 0.77/0.83 ### 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,Z,A1,B1,C1,D1) 0.77/0.83 0.77/0.83 #### 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,Z,A1,B1,C1,D1) 0.77/0.83 0.77/0.83 0.77/0.83 ### Specialization of cost equations f8/29 0.77/0.83 * CE 1 is refined into CE [28] 0.77/0.83 * CE 2 is refined into CE [29,30,31,32,33,34,35,36,37,38,39,40] 0.77/0.83 0.77/0.83 0.77/0.83 ### Cost equations --> "Loop" of f8/29 0.77/0.83 * CEs [35,40] --> Loop 26 0.77/0.83 * CEs [31,32,34,36,37,39] --> Loop 27 0.77/0.83 * CEs [28,29,30,33,38] --> Loop 28 0.77/0.83 0.77/0.83 ### Ranking functions of CR f8(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,V1) 0.77/0.83 0.77/0.83 #### Partial ranking functions of CR f8(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,V1) 0.77/0.83 0.77/0.83 0.77/0.83 Computing Bounds 0.77/0.83 ===================================== 0.77/0.83 0.77/0.83 #### Cost of chains of f1(B,C,E,I,J,K,L,M,N,O,Q,Y,Z,B1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2): 0.77/0.83 * Chain [[12],14]: 1*it(12)+0 0.77/0.83 Such that:it(12) =< B-J 0.77/0.83 0.77/0.83 with precondition: [V1=3,B=I,K=M,J>=2,B>=J+1] 0.77/0.83 0.77/0.83 * Chain [[12],13]: 1*it(12)+0 0.77/0.83 Such that:it(12) =< B-J 0.77/0.83 0.77/0.83 with precondition: [V1=4,B=I,K=M,B=F2+1,J>=2,W1>=2,A2>=2,B>=J+1,J2>=W1] 0.77/0.83 0.77/0.83 * Chain [14]: 0 0.77/0.83 with precondition: [V1=3,I=B,M=K,J>=2,I>=J] 0.77/0.83 0.77/0.83 * Chain [13]: 0 0.77/0.83 with precondition: [V1=4,I=B,I=J,M=K,E2=N,F2=O,M=Y1,I>=2,W1>=2,A2>=2,J2>=W1] 0.77/0.83 0.77/0.83 0.77/0.83 #### Cost of chains of f12(A,B,C,D,E,F,G,H,T,U,V,W,X,Z,A1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2): 0.77/0.83 * Chain [[15]]...: 1*it(15)+0 0.77/0.83 with precondition: [A>=0] 0.77/0.83 0.77/0.83 * Chain [[15],17]: 1*it(15)+0 0.77/0.83 with precondition: [E=0,V1=2,X1=0,Y1=0,Z1=0,G=A2,A=B2,A>=0,W1>=2] 0.77/0.83 0.77/0.83 * Chain [[15],16]: 1*it(15)+0 0.77/0.83 with precondition: [V1=3,A>=0] 0.77/0.83 0.77/0.83 * Chain [17]: 0 0.77/0.83 with precondition: [C=0,E=0,V1=2,X1=0,Z1=0,Y1=D,A2=F,B2=H,A>=0,W1>=2] 0.77/0.83 0.77/0.83 * Chain [16]: 0 0.77/0.83 with precondition: [V1=3] 0.77/0.83 0.77/0.83 0.77/0.83 #### Cost of chains of f12_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,Z,A1,B1,C1,D1): 0.77/0.83 * Chain [19]: 0 0.77/0.83 with precondition: [A=2,T=2] 0.77/0.83 0.77/0.83 * Chain [18]: 0 0.77/0.83 with precondition: [A=3,T=2] 0.77/0.83 0.77/0.83 0.77/0.83 #### 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,Z,A1,B1,C1,D1): 0.77/0.83 * Chain [25]...: 1*aux(1)+0 0.77/0.83 with precondition: [A=4,T=2,B>=0] 0.77/0.83 0.77/0.83 * Chain [24]: 0 0.77/0.83 with precondition: [A=3,T=2] 0.77/0.83 0.77/0.83 * Chain [23]: 0 0.77/0.83 with precondition: [A=4,D=0,F=0,T=2,B>=0] 0.77/0.83 0.77/0.83 * Chain [22]: 1*s(3)+0 0.77/0.83 with precondition: [A=4,F=0,T=2,B>=0] 0.77/0.83 0.77/0.83 * Chain [21]: 0 0.77/0.83 with precondition: [A=4,T=2] 0.77/0.83 0.77/0.83 * Chain [20]: 1*s(4)+0 0.77/0.83 with precondition: [A=4,T=2,B>=0] 0.77/0.83 0.77/0.83 0.77/0.83 #### Cost of chains of f8(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,V1): 0.77/0.83 * Chain [28]: 1*aux(2)+0 0.77/0.83 with precondition: [] 0.77/0.83 0.77/0.83 * Chain [27]: 1*aux(3)+0 0.77/0.83 with precondition: [A>=0] 0.77/0.83 0.77/0.83 * Chain [26]...: 1*aux(4)+0 0.77/0.83 with precondition: [A>=0] 0.77/0.83 0.77/0.83 0.77/0.83 Closed-form bounds of f8(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,V1): 0.77/0.83 ------------------------------------- 0.77/0.83 * Chain [28] with precondition: [] 0.77/0.83 - Upper bound: inf 0.77/0.83 - Complexity: infinity 0.77/0.83 * Chain [27] with precondition: [A>=0] 0.77/0.83 - Upper bound: inf 0.77/0.83 - Complexity: infinity 0.77/0.83 * Chain [26]... with precondition: [A>=0] 0.77/0.83 - Upper bound: inf 0.77/0.83 - Complexity: infinity 0.77/0.83 0.77/0.83 ### Maximum cost of f8(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,V1): inf 0.77/0.83 Asymptotic class: infinity 0.77/0.83 * Total analysis performed in 718 ms. 0.77/0.83 0.82/0.93 EOF