/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  : [f18/41]
1. recursive  : [f9/53]
2. non_recursive  : [exit_location/1]
3. recursive  : [f16/39]
4. recursive  : [f7/27]
5. non_recursive  : [f7_loop_cont/42]
6. non_recursive  : [f16_loop_cont/42]
7. non_recursive  : [f9_loop_cont/42]
8. non_recursive  : [f17/41]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f9/53
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f16/39
4. SCC is partially evaluated into f7/27
5. SCC is partially evaluated into f7_loop_cont/42
6. SCC is partially evaluated into f16_loop_cont/42
7. SCC is partially evaluated into f9_loop_cont/42
8. SCC is partially evaluated into f17/41

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

### Specialization of cost equations f9/53 
* CE 9 is refined into CE [25] 
* CE 8 is refined into CE [26] 
* CE 7 is refined into CE [27] 
* CE 5 is refined into CE [28] 
* CE 6 is refined into CE [29] 
* CE 4 is refined into CE [30] 
* CE 3 is refined into CE [31] 


### Cost equations --> "Loop" of f9/53 
* CEs [31] --> Loop 24 
* CEs [25] --> Loop 25 
* CEs [26] --> Loop 26 
* CEs [27] --> Loop 27 
* CEs [28] --> Loop 28 
* CEs [29] --> Loop 29 
* CEs [30] --> Loop 30 

### Ranking functions of CR f9(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,S,X,Z,A1,B1,C1,H1,I1,K1,L1,M1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3) 
* RF of phase [24]: [A-B,-B+J]

#### Partial ranking functions of CR f9(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,S,X,Z,A1,B1,C1,H1,I1,K1,L1,M1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3) 
* Partial RF of phase [24]:
  - RF of loop [24:1]:
    A-B
    -B+J


### Specialization of cost equations f16/39 
* CE 14 is refined into CE [32] 
* CE 15 is refined into CE [33] 
* CE 16 is refined into CE [34] 
* CE 13 is refined into CE [35] 


### Cost equations --> "Loop" of f16/39 
* CEs [35] --> Loop 31 
* CEs [32] --> Loop 32 
* CEs [33] --> Loop 33 
* CEs [34] --> Loop 34 

### Ranking functions of CR f16(H,J,K,L,M,N,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,N1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 
* RF of phase [31]: [R+1]

#### Partial ranking functions of CR f16(H,J,K,L,M,N,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,N1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 
* Partial RF of phase [31]:
  - RF of loop [31:1]:
    R+1


### Specialization of cost equations f7/27 
* CE 22 is refined into CE [36] 
* CE 21 is refined into CE [37] 
* CE 19 is refined into CE [38] 
* CE 20 is refined into CE [39] 


### Cost equations --> "Loop" of f7/27 
* CEs [38] --> Loop 35 
* CEs [39] --> Loop 36 
* CEs [36] --> Loop 37 
* CEs [37] --> Loop 38 

### Ranking functions of CR f7(J,K,M,R,S,X,Z,A1,B1,C1,D1,E1,F1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2) 

#### Partial ranking functions of CR f7(J,K,M,R,S,X,Z,A1,B1,C1,D1,E1,F1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2) 


### Specialization of cost equations f7_loop_cont/42 
* CE 24 is refined into CE [40] 
* CE 23 is refined into CE [41] 


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

### Ranking functions of CR f7_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) 

#### Partial ranking functions of CR f7_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) 


### Specialization of cost equations f16_loop_cont/42 
* CE 18 is refined into CE [42,43,44,45,46,47] 
* CE 17 is refined into CE [48] 


### Cost equations --> "Loop" of f16_loop_cont/42 
* CEs [45] --> Loop 41 
* CEs [42] --> Loop 42 
* CEs [43] --> Loop 43 
* CEs [44] --> Loop 44 
* CEs [48] --> Loop 45 
* CEs [46,47] --> Loop 46 

### 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) 

#### 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) 


### Specialization of cost equations f9_loop_cont/42 
* CE 12 is refined into CE [49,50,51,52,53,54,55,56,57,58,59,60,61,62] 
* CE 11 is refined into CE [63] 
* CE 10 is refined into CE [64] 


### Cost equations --> "Loop" of f9_loop_cont/42 
* CEs [50] --> Loop 47 
* CEs [58,61] --> Loop 48 
* CEs [57,60] --> Loop 49 
* CEs [54] --> Loop 50 
* CEs [51] --> Loop 51 
* CEs [55] --> Loop 52 
* CEs [52] --> Loop 53 
* CEs [49] --> Loop 54 
* CEs [63] --> Loop 55 
* CEs [64] --> Loop 56 
* CEs [59,62] --> Loop 57 
* CEs [56] --> Loop 58 
* CEs [53] --> Loop 59 

### Ranking functions of CR f9_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) 

#### Partial ranking functions of CR f9_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) 


### Specialization of cost equations f17/41 
* CE 1 is refined into CE [65] 
* CE 2 is refined into CE [66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85] 


### Cost equations --> "Loop" of f17/41 
* CEs [67,69,71,73,75,77,79,81] --> Loop 60 
* CEs [66,68,70,72,74,76,78,80] --> Loop 61 
* CEs [65,82,83,84,85] --> Loop 62 

### Ranking functions of CR f17(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,J2) 

#### Partial ranking functions of CR f17(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,J2) 


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

#### Cost of chains of f9(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Q,S,X,Z,A1,B1,C1,H1,I1,K1,L1,M1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3):
* Chain [[24],30]: 1*it(24)+0
  Such that:it(24) =< -B+Q2+1

  with precondition: [Q=1,J2=5,Y2=1,C=E,A=J,K=H1,A=Q2+1,K=U2,K=V2,W2=X2,X=A3,Z=B3,A1=C3,B1=D3,S2+1=I3,B>=2,L2>=2,T2>=2,A>=B+1,W2>=K+1,K>=R2+1] 

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

  with precondition: [Q=1,J2=5,Y2=1,C=E,A=J,K=H1,A=Q2+1,K=U2,K=V2,W2=X2,X=A3,Z=B3,A1=C3,B1=D3,S2+1=I3,B>=2,L2>=2,T2>=2,A>=B+1,K>=R2+1,K>=W2+1] 

* Chain [[24],28]: 1*it(24)+0
  Such that:it(24) =< -B+Q2+1

  with precondition: [Q=1,J2=5,Y2=1,C=E,A=J,K=H1,A=Q2+1,K=U2,K=V2,W2=X2,X=A3,Z=B3,A1=C3,B1=D3,S2+1=I3,B>=2,L2>=2,T2>=2,A>=B+1,R2>=K+1,W2>=K+1] 

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

  with precondition: [Q=1,J2=5,Y2=1,C=E,A=J,K=H1,A=Q2+1,K=U2,K=V2,W2=X2,X=A3,Z=B3,A1=C3,B1=D3,S2+1=I3,B>=2,L2>=2,T2>=2,A>=B+1,R2>=K+1,K>=W2+1] 

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

  with precondition: [J2=2,C=E,A=J,K=H1,A=Q2+1,I=S2,K=U2,K=W2,Q=Y2,S=Z2,L1=I3,M1=J3,B>=2,T2>=2,A>=B+1,L2>=T2] 

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

  with precondition: [J2=3,C=E,A=J,K=H1,B>=2,A>=B+1] 

* Chain [30]: 0
  with precondition: [Q=1,J2=5,Y2=1,A=B,E=C,P2=F,Q2=G,A=J,H1=K,A3=X,B3=Z,C3=A1,D3=B1,E=R2,I3=S2+1,H1=U2,H1=V2,W2=X2,A>=2,L2>=2,T2>=2,H1>=E+1,W2>=H1+1] 

* Chain [29]: 0
  with precondition: [Q=1,J2=5,Y2=1,A=B,E=C,P2=F,Q2=G,A=J,H1=K,A3=X,B3=Z,C3=A1,D3=B1,E=R2,I3=S2+1,H1=U2,H1=V2,W2=X2,A>=2,L2>=2,T2>=2,H1>=E+1,H1>=W2+1] 

* Chain [28]: 0
  with precondition: [Q=1,J2=5,Y2=1,A=B,E=C,P2=F,Q2=G,A=J,H1=K,A3=X,B3=Z,C3=A1,D3=B1,E=R2,I3=S2+1,H1=U2,H1=V2,W2=X2,A>=2,L2>=2,T2>=2,E>=H1+1,W2>=H1+1] 

* Chain [27]: 0
  with precondition: [Q=1,J2=5,Y2=1,A=B,E=C,P2=F,Q2=G,A=J,H1=K,A3=X,B3=Z,C3=A1,D3=B1,E=R2,I3=S2+1,H1=U2,H1=V2,W2=X2,A>=2,L2>=2,T2>=2,E>=H1+1,H1>=W2+1] 

* Chain [26]: 0
  with precondition: [J2=2,A=B,K=C,K=E,P2=F,Q2=G,S2=I,A=J,Y2=Q,Z2=S,K=H1,I3=L1,J3=M1,K=U2,K=W2,A>=2,T2>=2,L2>=T2] 

* Chain [25]: 0
  with precondition: [J2=3,J=A,E=C,H1=K,B>=2,J>=B] 


#### Cost of chains of f16(H,J,K,L,M,N,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,N1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3):
* Chain [[31],34]: 1*it(31)+0
  Such that:it(31) =< R+1

  with precondition: [J2=3,Q>=0,R>=0] 

* Chain [[31],33]: 1*it(31)+0
  Such that:it(31) =< -Q+V2

  with precondition: [J2=4,C3=0,H=L,H=M2,H=T2,R2=W2,O2=X2,Q2=Y2+1,H=Z2,O2=A3,O2=B3,R2+V2=Q+R,Q>=0,L2>=2,R2>=0,O2>=H+1,R>=R2+1] 

* Chain [[31],32]: 1*it(31)+0
  Such that:it(31) =< -Q+V2

  with precondition: [J2=4,C3=0,H=L,H=M2,H=T2,R2=W2,O2=X2,Q2=Y2+1,H=Z2,O2=A3,O2=B3,R2+V2=Q+R,Q>=0,L2>=2,R2>=0,H>=O2+1,R>=R2+1] 

* Chain [34]: 0
  with precondition: [J2=3] 

* Chain [33]: 0
  with precondition: [J2=4,C3=0,L=H,S2=S,T2=T,U2=U,V2=V,W2=W,K=M2,M=O2,Y2+1=Q2,R=R2,M=X2,K=Z2,M=A3,M=B3,Q>=0,R>=0,L2>=2,M>=K+1] 

* Chain [32]: 0
  with precondition: [J2=4,C3=0,L=H,S2=S,T2=T,U2=U,V2=V,W2=W,K=M2,M=O2,Y2+1=Q2,R=R2,M=X2,K=Z2,M=A3,M=B3,Q>=0,R>=0,L2>=2,K>=M+1] 


#### Cost of chains of f7(J,K,M,R,S,X,Z,A1,B1,C1,D1,E1,F1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2):
* Chain [[35,36]]...: 2*it(35)+0
  with precondition: [D1>=0] 

* Chain [[35,36],38]: 2*it(35)+0
  with precondition: [J2=2,N2=0,V2=0,X=Z,X=L2,U2=W2,D1>=0,K2>=2,U2>=0,R+D1>=U2+1] 

* Chain [[35,36],37]: 2*it(35)+0
  with precondition: [J2=3,D1>=0] 

* Chain [38]: 0
  with precondition: [J2=2,L2=K,M2=M,O2=S,Z=X,V2=E1,W2=F1,R=N2,D1=U2,R>=0,D1>=0,K2>=2] 

* Chain [37]: 0
  with precondition: [J2=3] 


#### Cost of chains of f7_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):
* Chain [40]: 0
  with precondition: [A=2] 

* Chain [39]: 0
  with precondition: [A=3] 


#### 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):
* Chain [46]...: 1*aux(1)+0
  with precondition: [A=4,E1>=0] 

* Chain [45]: 0
  with precondition: [A=3] 

* Chain [44]: 0
  with precondition: [A=4] 

* Chain [43]: 0
  with precondition: [A=4,A1=Y,S>=0,E1>=0] 

* Chain [42]: 2*s(3)+0
  with precondition: [A=4,A1=Y,E1>=0,S+E1>=1] 

* Chain [41]: 2*s(4)+0
  with precondition: [A=4,E1>=0] 


#### Cost of chains of f9_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):
* Chain [59]...: 1*s(5)+0
  with precondition: [A=5,M=I,R>=0,S>=0,E1>=0,N>=L+1] 

* Chain [58]...: 1*s(6)+0
  with precondition: [A=5,M=I,R>=0,S>=0,E1>=0,L>=N+1] 

* Chain [57]...: 2*s(7)+2*s(8)+0
  Such that:aux(2) =< S
s(7) =< aux(2)

  with precondition: [A=5,M=I,R>=0,S>=1,E1>=0] 

* Chain [56]: 0
  with precondition: [A=2] 

* Chain [55]: 0
  with precondition: [A=3] 

* Chain [54]: 0
  with precondition: [A=5] 

* Chain [53]: 2*s(11)+0
  with precondition: [A=5,M=I,R>=0,S>=0,E1>=0,N>=L+1] 

* Chain [52]: 2*s(12)+0
  with precondition: [A=5,M=I,R>=0,S>=0,E1>=0,L>=N+1] 

* Chain [51]: 0
  with precondition: [A=5,M=I,R>=0,S>=0,N>=L+1] 

* Chain [50]: 0
  with precondition: [A=5,M=I,R>=0,S>=0,L>=N+1] 

* Chain [49]: 2*s(13)+0
  Such that:aux(3) =< S
s(13) =< aux(3)

  with precondition: [A=5,M=I,R>=0,S>=1] 

* Chain [48]: 2*s(15)+4*s(16)+0
  Such that:aux(4) =< S
s(15) =< aux(4)

  with precondition: [A=5,M=I,R>=0,S>=1,E1>=0] 

* Chain [47]: 1*s(19)+0
  Such that:s(19) =< S+1

  with precondition: [A=5,R>=0,S>=0] 


#### Cost of chains of f17(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,J2):
* Chain [62]: 1*aux(5)+0
  with precondition: [] 

* Chain [61]: 1*aux(6)+0
  with precondition: [Q=1] 

* Chain [60]: 8*s(26)+4*s(30)+0
  Such that:aux(7) =< R+1
s(26) =< aux(7)

  with precondition: [Q=1,R>=0] 


Closed-form bounds of f17(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,J2): 
-------------------------------------
* Chain [62] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [61] with precondition: [Q=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [60] with precondition: [Q=1,R>=0] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f17(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,J2): inf 
Asymptotic class: infinity 
* Total analysis performed in 3425 ms.