/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE

Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. non_recursive  : [f1/66]
1. recursive  : [f16/45]
2. non_recursive  : [exit_location/1]
3. recursive  : [f4/49]
4. recursive  : [f14/28]
5. non_recursive  : [f14_loop_cont/67]
6. non_recursive  : [f4_loop_cont/67]
7. non_recursive  : [f16_loop_cont/67]
8. non_recursive  : [f0/66]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f16/45
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f4/49
4. SCC is partially evaluated into f14/28
5. SCC is partially evaluated into f14_loop_cont/67
6. SCC is partially evaluated into f4_loop_cont/67
7. SCC is partially evaluated into f16_loop_cont/67
8. SCC is partially evaluated into f0/66

Control-Flow Refinement of Cost Relations
=====================================

### Specialization of cost equations f16/45 
* CE 6 is refined into CE [30] 
* CE 5 is refined into CE [31] 
* CE 4 is refined into CE [32] 
* CE 3 is refined into CE [33] 


### Cost equations --> "Loop" of f16/45 
* CEs [33] --> Loop 30 
* CEs [30] --> Loop 31 
* CEs [31] --> Loop 32 
* CEs [32] --> Loop 33 

### Ranking functions of CR f16(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,U1,A2,C2,D2,E2,F2,G2,H2,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4) 
* RF of phase [30]: [A-B,-B+N]

#### Partial ranking functions of CR f16(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,U1,A2,C2,D2,E2,F2,G2,H2,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4) 
* Partial RF of phase [30]:
  - RF of loop [30:1]:
    A-B
    -B+N


### Specialization of cost equations f4/49 
* CE 21 is refined into CE [34] 
* CE 18 is discarded (unfeasible) 
* CE 20 is discarded (unfeasible) 
* CE 17 is discarded (unfeasible) 
* CE 19 is discarded (unfeasible) 
* CE 16 is refined into CE [35] 
* CE 15 is refined into CE [36] 
* CE 14 is discarded (unfeasible) 
* CE 13 is discarded (unfeasible) 
* CE 12 is discarded (unfeasible) 
* CE 11 is discarded (unfeasible) 
* CE 10 is refined into CE [37] 
* CE 9 is refined into CE [38] 


### Cost equations --> "Loop" of f4/49 
* CEs [35] --> Loop 34 
* CEs [36] --> Loop 35 
* CEs [37] --> Loop 36 
* CEs [38] --> Loop 37 
* CEs [34] --> Loop 38 

### Ranking functions of CR f4(I,K,L,M,N,O,P,Q,R,S,V,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,I2,K2,L2,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4) 
* RF of phase [34,35]: [S+1]
* RF of phase [36,37]: [S+1]

#### Partial ranking functions of CR f4(I,K,L,M,N,O,P,Q,R,S,V,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,I2,K2,L2,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4) 
* Partial RF of phase [34,35]:
  - RF of loop [34:1,35:1]:
    S+1
* Partial RF of phase [36,37]:
  - RF of loop [36:1,37:1]:
    S+1


### Specialization of cost equations f14/28 
* CE 27 is refined into CE [39] 
* CE 26 is refined into CE [40] 
* CE 25 is refined into CE [41] 
* CE 24 is refined into CE [42] 


### Cost equations --> "Loop" of f14/28 
* CEs [41] --> Loop 39 
* CEs [42] --> Loop 40 
* CEs [39] --> Loop 41 
* CEs [40] --> Loop 42 

### Ranking functions of CR f14(I,N,V,M1,O1,P1,Q1,R1,S1,T1,U1,W1,X1,Y1,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3) 
* RF of phase [39,40]: [W1+1]

#### Partial ranking functions of CR f14(I,N,V,M1,O1,P1,Q1,R1,S1,T1,U1,W1,X1,Y1,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3) 
* Partial RF of phase [39,40]:
  - RF of loop [39:1,40:1]:
    W1+1


### Specialization of cost equations f14_loop_cont/67 
* CE 29 is refined into CE [43] 
* CE 28 is refined into CE [44] 


### Cost equations --> "Loop" of f14_loop_cont/67 
* CEs [43] --> Loop 43 
* CEs [44] --> Loop 44 

### Ranking functions of CR f14_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2) 

#### Partial ranking functions of CR f14_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2) 


### Specialization of cost equations f4_loop_cont/67 
* CE 23 is refined into CE [45,46,47,48] 
* CE 22 is refined into CE [49] 


### Cost equations --> "Loop" of f4_loop_cont/67 
* CEs [48] --> Loop 45 
* CEs [47] --> Loop 46 
* CEs [46] --> Loop 47 
* CEs [45] --> Loop 48 
* CEs [49] --> Loop 49 

### Ranking functions of CR f4_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2) 

#### Partial ranking functions of CR f4_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2) 


### Specialization of cost equations f16_loop_cont/67 
* CE 8 is refined into CE [50,51,52] 
* CE 7 is refined into CE [53] 


### Cost equations --> "Loop" of f16_loop_cont/67 
* CEs [51] --> Loop 50 
* CEs [50] --> Loop 51 
* CEs [52] --> Loop 52 
* CEs [53] --> Loop 53 

### Ranking functions of CR f16_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2) 

#### Partial ranking functions of CR f16_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2) 


### Specialization of cost equations f0/66 
* CE 1 is refined into CE [54] 
* CE 2 is refined into CE [55,56,57,58,59,60,61,62,63,64] 


### Cost equations --> "Loop" of f0/66 
* CEs [54] --> Loop 54 
* CEs [57,61] --> Loop 55 
* CEs [58,62] --> Loop 56 
* CEs [55,59] --> Loop 57 
* CEs [56,60] --> Loop 58 
* CEs [63,64] --> Loop 59 

### Ranking functions of CR f0(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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,L3) 

#### Partial ranking functions of CR f0(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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,L3) 


Computing Bounds
=====================================

#### Cost of chains of f16(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,U1,A2,C2,D2,E2,F2,G2,H2,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4):
* Chain [[30],33]: 1*it(30)+0
  Such that:it(30) =< -B+N

  with precondition: [M=0,L3=5,U3=0,C=E,K=L,A=N,A=S3+1,I=T3,W3=X3,0>=K+1,B>=2,V3>=2,A>=B+1,C2>=V3] 

* Chain [[30],32]: 1*it(30)+0
  Such that:it(30) =< -B+N

  with precondition: [M=0,L3=5,U3=0,C=E,K=L,A=N,A=S3+1,I=T3,W3=X3,B>=2,K>=1,V3>=2,A>=B+1,C2>=V3] 

* Chain [[30],31]: 1*it(30)+0
  Such that:it(30) =< A-B

  with precondition: [L3=3,C=E,A=N,B>=2,A>=B+1] 

* Chain [33]: 0
  with precondition: [M=0,L3=5,U3=0,A=B,E=C,R3=F,S3=G,T3=H,K=L,A=N,X3=W3,0>=K+1,A>=2,V3>=2,C2>=V3] 

* Chain [32]: 0
  with precondition: [M=0,L3=5,U3=0,A=B,E=C,R3=F,S3=G,T3=H,K=L,A=N,X3=W3,A>=2,K>=1,V3>=2,C2>=V3] 

* Chain [31]: 0
  with precondition: [L3=3,N=A,E=C,B>=2,N>=B] 


#### Cost of chains of f4(I,K,L,M,N,O,P,Q,R,S,V,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,I2,K2,L2,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3,Z3,A4,B4,C4,D4,E4):
* Chain [[36,37],38]: 2*it(36)+0
  Such that:aux(3) =< S+1
it(36) =< aux(3)

  with precondition: [L3=3,R=K,R=L,R=P,0>=R+1,S>=0] 

* Chain [[34,35],38]: 2*it(34)+0
  Such that:aux(6) =< S+1
it(34) =< aux(6)

  with precondition: [L3=3,R=K,R=L,R=P,R>=1,S>=0] 

* Chain [38]: 0
  with precondition: [L3=3,K=L,K=P,K=R] 


#### Cost of chains of f14(I,N,V,M1,O1,P1,Q1,R1,S1,T1,U1,W1,X1,Y1,L3,M3,N3,O3,P3,Q3,R3,S3,T3,U3,V3,W3,X3,Y3):
* Chain [[39,40],42]: 2*it(39)+0
  Such that:aux(7) =< W1+1
aux(8) =< W1-W3
it(39) =< aux(7)
it(39) =< aux(8)

  with precondition: [M1=0,O1=0,T1=0,L3=2,P1=R1,P1=S1,I=X3,W3=Y3,M3>=2,W3>=0,W1>=W3+1] 

* Chain [[39,40],41]: 2*it(39)+0
  Such that:aux(9) =< W1+1
it(39) =< aux(9)

  with precondition: [O1=0,L3=3,P1=R1,P1=S1,M1=T1,W1>=0] 

* Chain [42]: 0
  with precondition: [L3=2,N3=V,M1=O1,R1=P1,R1=S1,M1=T1,X3=X1,Y3=Y1,W1=W3,W1>=0,M3>=2] 

* Chain [41]: 0
  with precondition: [L3=3,T1=M1,R1=P1,R1=S1] 


#### Cost of chains of f14_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2):
* Chain [44]: 0
  with precondition: [A=2,G2=J,G2=L2] 

* Chain [43]: 0
  with precondition: [A=3,G2=J,G2=L2] 


#### Cost of chains of f4_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2):
* Chain [49]: 0
  with precondition: [A=3,G2=J,F2=W,Q1=N1,X1=O1,Q1=S1,Q1=T1,Q1=U1,G2=L2] 

* Chain [48]: 2*s(3)+0
  Such that:s(2) =< X1
s(1) =< X1+1
s(3) =< s(1)
s(3) =< s(2)

  with precondition: [A=4,N1=0,P1=0,Q1=0,S1=0,T1=0,U1=0,G2=J,F2=W,X1=O1,G2=L2,X1>=1] 

* Chain [47]: 2*s(5)+0
  Such that:s(4) =< O1+1
s(5) =< s(4)

  with precondition: [A=4,P1=0,G2=J,F2=W,Q1=N1,X1=O1,Q1=S1,Q1=T1,Q1=U1,G2=L2,X1>=0] 

* Chain [46]: 0
  with precondition: [A=4,G2=J,F2=W,X1=O1,N1=P1,N1=Q1,N1=S1,N1=T1,N1=U1,G2=L2,X1>=0] 

* Chain [45]: 0
  with precondition: [A=4,G2=J,F2=W,Q1=N1,X1=O1,Q1=S1,Q1=T1,Q1=U1,G2=L2] 


#### Cost of chains of f16_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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2):
* Chain [53]: 0
  with precondition: [A=3,G2=J,T=K,M=L,M=Q,M=S,F2=W] 

* Chain [52]: 0
  with precondition: [A=5,G2=J,T=K,M=L,M=Q,M=S,F2=W] 

* Chain [51]: 2*s(7)+0
  Such that:s(6) =< K+1
s(7) =< s(6)

  with precondition: [A=5,G2=J,T=K,M=L,M=Q,M=S,F2=W,0>=M+1,T>=0] 

* Chain [50]: 2*s(9)+0
  Such that:s(8) =< K+1
s(9) =< s(8)

  with precondition: [A=5,G2=J,T=K,M=L,M=Q,M=S,F2=W,M>=1,T>=0] 


#### Cost of chains of f0(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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,L3):
* Chain [59]: 1*aux(10)+0
  with precondition: [] 

* Chain [58]: 4*s(12)+1*s(13)+0
  Such that:aux(11) =< S+1
s(12) =< aux(11)

  with precondition: [M=0,K=L,0>=K+1,S>=0,C2>=2] 

* Chain [57]: 1*aux(12)+0
  with precondition: [M=0,K=L,0>=K+1,C2>=2] 

* Chain [56]: 4*s(18)+1*s(19)+0
  Such that:aux(13) =< S+1
s(18) =< aux(13)

  with precondition: [M=0,K=L,K>=1,S>=0,C2>=2] 

* Chain [55]: 1*aux(14)+0
  with precondition: [M=0,K=L,K>=1,C2>=2] 

* Chain [54]: 0
  with precondition: [S1=0] 


Closed-form bounds of f0(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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,L3): 
-------------------------------------
* Chain [59] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [58] with precondition: [M=0,K=L,0>=K+1,S>=0,C2>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [57] with precondition: [M=0,K=L,0>=K+1,C2>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [56] with precondition: [M=0,K=L,K>=1,S>=0,C2>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [55] with precondition: [M=0,K=L,K>=1,C2>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [54] with precondition: [S1=0] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of f0(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,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,L3): inf 
Asymptotic class: infinity 
* Total analysis performed in 3704 ms.