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