0.04/0.46 MAYBE 0.04/0.46 0.04/0.46 Preprocessing Cost Relations 0.04/0.46 ===================================== 0.04/0.46 0.04/0.46 #### Computed strongly connected components 0.04/0.46 0. recursive : [f1/25] 0.04/0.46 1. non_recursive : [exit_location/1] 0.04/0.46 2. non_recursive : [f2/19] 0.04/0.46 3. non_recursive : [f3/19] 0.04/0.46 4. non_recursive : [f1_loop_cont/20] 0.04/0.46 5. non_recursive : [f300/19] 0.04/0.46 0.04/0.46 #### Obtained direct recursion through partial evaluation 0.04/0.46 0. SCC is partially evaluated into f1/25 0.04/0.46 1. SCC is completely evaluated into other SCCs 0.04/0.46 2. SCC is completely evaluated into other SCCs 0.04/0.46 3. SCC is completely evaluated into other SCCs 0.04/0.46 4. SCC is partially evaluated into f1_loop_cont/20 0.04/0.46 5. SCC is partially evaluated into f300/19 0.04/0.46 0.04/0.46 Control-Flow Refinement of Cost Relations 0.04/0.46 ===================================== 0.04/0.46 0.04/0.46 ### Specialization of cost equations f1/25 0.04/0.46 * CE 7 is refined into CE [11] 0.04/0.46 * CE 5 is refined into CE [12] 0.04/0.46 * CE 6 is refined into CE [13] 0.04/0.46 * CE 4 is refined into CE [14] 0.04/0.46 * CE 3 is refined into CE [15] 0.04/0.46 * CE 2 is refined into CE [16] 0.04/0.46 0.04/0.46 0.04/0.46 ### Cost equations --> "Loop" of f1/25 0.04/0.46 * CEs [15] --> Loop 11 0.04/0.46 * CEs [16] --> Loop 12 0.04/0.46 * CEs [11] --> Loop 13 0.04/0.46 * CEs [12] --> Loop 14 0.04/0.46 * CEs [13] --> Loop 15 0.04/0.46 * CEs [14] --> Loop 16 0.04/0.46 0.04/0.46 ### Ranking functions of CR f1(F,G,H,I,J,K,L,M,N,O,P,Q,R,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1) 0.04/0.46 0.04/0.46 #### Partial ranking functions of CR f1(F,G,H,I,J,K,L,M,N,O,P,Q,R,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1) 0.04/0.46 0.04/0.46 0.04/0.46 ### Specialization of cost equations f1_loop_cont/20 0.04/0.46 * CE 10 is refined into CE [17] 0.04/0.46 * CE 9 is refined into CE [18] 0.04/0.46 * CE 8 is refined into CE [19] 0.04/0.46 0.04/0.46 0.04/0.46 ### Cost equations --> "Loop" of f1_loop_cont/20 0.04/0.46 * CEs [17] --> Loop 17 0.04/0.46 * CEs [18] --> Loop 18 0.04/0.46 * CEs [19] --> Loop 19 0.04/0.46 0.04/0.46 ### 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) 0.04/0.46 0.04/0.46 #### 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) 0.04/0.46 0.04/0.46 0.04/0.46 ### Specialization of cost equations f300/19 0.04/0.46 * CE 1 is refined into CE [20,21,22,23,24,25,26,27,28,29,30,31] 0.04/0.46 0.04/0.46 0.04/0.46 ### Cost equations --> "Loop" of f300/19 0.04/0.46 * CEs [29,30,31] --> Loop 20 0.04/0.46 * CEs [26,27,28] --> Loop 21 0.04/0.46 * CEs [21] --> Loop 22 0.04/0.46 * CEs [23] --> Loop 23 0.04/0.46 * CEs [25] --> Loop 24 0.04/0.46 * CEs [22] --> Loop 25 0.04/0.46 * CEs [20] --> Loop 26 0.04/0.46 * CEs [24] --> Loop 27 0.04/0.46 0.04/0.46 ### Ranking functions of CR f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,Z) 0.04/0.46 0.04/0.46 #### Partial ranking functions of CR f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,Z) 0.04/0.46 0.04/0.46 0.04/0.46 Computing Bounds 0.04/0.46 ===================================== 0.04/0.46 0.04/0.46 #### Cost of chains of f1(F,G,H,I,J,K,L,M,N,O,P,Q,R,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1): 0.04/0.46 * Chain [[12]]...: 1*it(12)+0 0.04/0.46 with precondition: [G>=F+1,H=256] 0.04/0.46 0.04/0.46 * Chain [[12],13]: 1*it(12)+0 0.04/0.46 with precondition: [H=256,Z=4,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [[11]]...: 1*it(11)+0 0.04/0.46 with precondition: [G>=F+1,0>=H] 0.04/0.46 0.04/0.46 * Chain [[11],13]: 1*it(11)+0 0.04/0.46 with precondition: [Z=4,0>=H,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [16]: 0 0.04/0.46 with precondition: [Z=2,H1=0,I1=0,J1=0,A1=H,D1=K,E1=L,F1=M,G1=N,K1=R,F>=G] 0.04/0.46 0.04/0.46 * Chain [15]: 0 0.04/0.46 with precondition: [Z=3,H=A1,H=H1,H=I1,H=J1,255>=H,H>=1,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [14]: 0 0.04/0.46 with precondition: [Z=3,H=A1,H=H1,H=I1,H=J1,H>=257,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [13]: 0 0.04/0.46 with precondition: [Z=4] 0.04/0.46 0.04/0.46 0.04/0.46 #### 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): 0.04/0.46 * Chain [19]: 0 0.04/0.46 with precondition: [A=2] 0.04/0.46 0.04/0.46 * Chain [18]: 0 0.04/0.46 with precondition: [A=3] 0.04/0.46 0.04/0.46 * Chain [17]: 0 0.04/0.46 with precondition: [A=4] 0.04/0.46 0.04/0.46 0.04/0.46 #### Cost of chains of f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,Z): 0.04/0.46 * Chain [27]: 0 0.04/0.46 with precondition: [] 0.04/0.46 0.04/0.46 * Chain [26]: 1*s(1)+0 0.04/0.46 with precondition: [H=256,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [25]: 0 0.04/0.46 with precondition: [255>=H,H>=1,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [24]: 1*s(2)+0 0.04/0.46 with precondition: [0>=H,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [23]: 0 0.04/0.46 with precondition: [H>=257,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [22]: 0 0.04/0.46 with precondition: [F>=G] 0.04/0.46 0.04/0.46 * Chain [21]...: 1*aux(1)+0 0.04/0.46 with precondition: [H=256,G>=F+1] 0.04/0.46 0.04/0.46 * Chain [20]...: 1*aux(2)+0 0.04/0.46 with precondition: [0>=H,G>=F+1] 0.04/0.46 0.04/0.46 0.04/0.46 Closed-form bounds of f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,Z): 0.04/0.46 ------------------------------------- 0.04/0.46 * Chain [27] with precondition: [] 0.04/0.46 - Upper bound: 0 0.04/0.46 - Complexity: constant 0.04/0.46 * Chain [26] with precondition: [H=256,G>=F+1] 0.04/0.46 - Upper bound: inf 0.04/0.46 - Complexity: infinity 0.04/0.46 * Chain [25] with precondition: [255>=H,H>=1,G>=F+1] 0.04/0.46 - Upper bound: 0 0.04/0.46 - Complexity: constant 0.04/0.46 * Chain [24] with precondition: [0>=H,G>=F+1] 0.04/0.46 - Upper bound: inf 0.04/0.46 - Complexity: infinity 0.04/0.46 * Chain [23] with precondition: [H>=257,G>=F+1] 0.04/0.46 - Upper bound: 0 0.04/0.46 - Complexity: constant 0.04/0.46 * Chain [22] with precondition: [F>=G] 0.04/0.46 - Upper bound: 0 0.04/0.46 - Complexity: constant 0.04/0.46 * Chain [21]... with precondition: [H=256,G>=F+1] 0.04/0.46 - Upper bound: inf 0.04/0.46 - Complexity: infinity 0.04/0.46 * Chain [20]... with precondition: [0>=H,G>=F+1] 0.04/0.46 - Upper bound: inf 0.04/0.46 - Complexity: infinity 0.04/0.46 0.04/0.46 ### Maximum cost of f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,Z): inf 0.04/0.46 Asymptotic class: infinity 0.04/0.46 * Total analysis performed in 374 ms. 0.04/0.46 0.46/0.56 EOF