/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  : [f16/53]
1. recursive  : [f7/44]
2. non_recursive  : [exit_location/1]
3. recursive  : [f14/44]
4. recursive  : [f5/28]
5. non_recursive  : [f5_loop_cont/54]
6. non_recursive  : [f14_loop_cont/54]
7. non_recursive  : [f7_loop_cont/54]
8. non_recursive  : [f15/53]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f7/44
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f14/44
4. SCC is partially evaluated into f5/28
5. SCC is partially evaluated into f5_loop_cont/54
6. SCC is partially evaluated into f14_loop_cont/54
7. SCC is partially evaluated into f7_loop_cont/54
8. SCC is partially evaluated into f15/53

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

### Specialization of cost equations f7/44 
* CE 6 is refined into CE [21] 
* CE 3 is refined into CE [22] 
* CE 4 is refined into CE [23] 
* CE 5 is refined into CE [24] 


### Cost equations --> "Loop" of f7/44 
* CEs [24] --> Loop 20 
* CEs [21] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [23] --> Loop 23 

### Ranking functions of CR f7(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,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3) 
* RF of phase [20]: [-A+B,-A+H]

#### Partial ranking functions of CR f7(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,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3) 
* Partial RF of phase [20]:
  - RF of loop [20:1]:
    -A+B
    -A+H


### Specialization of cost equations f14/44 
* CE 11 is refined into CE [25] 
* CE 10 is refined into CE [26] 
* CE 12 is refined into CE [27] 
* CE 9 is refined into CE [28] 


### Cost equations --> "Loop" of f14/44 
* CEs [28] --> Loop 24 
* CEs [25] --> Loop 25 
* CEs [26] --> Loop 26 
* CEs [27] --> Loop 27 

### Ranking functions of CR f14(D,E,F,G,H,O,P,Q,R,T,Z,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,Y1,Z1,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3) 
* RF of phase [24]: [E+1]

#### Partial ranking functions of CR f14(D,E,F,G,H,O,P,Q,R,T,Z,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,Y1,Z1,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3) 
* Partial RF of phase [24]:
  - RF of loop [24:1]:
    E+1


### Specialization of cost equations f5/28 
* CE 18 is refined into CE [29] 
* CE 17 is refined into CE [30] 
* CE 15 is refined into CE [31] 
* CE 16 is refined into CE [32] 


### Cost equations --> "Loop" of f5/28 
* CEs [31] --> Loop 28 
* CEs [32] --> Loop 29 
* CEs [29] --> Loop 30 
* CEs [30] --> Loop 31 

### Ranking functions of CR f5(D,G,H,K,O,T,Z,M1,O1,P1,Q1,R1,S1,T1,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3) 
* RF of phase [28,29]: [R1+1]

#### Partial ranking functions of CR f5(D,G,H,K,O,T,Z,M1,O1,P1,Q1,R1,S1,T1,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3) 
* Partial RF of phase [28,29]:
  - RF of loop [28:1,29:1]:
    R1+1


### Specialization of cost equations f5_loop_cont/54 
* CE 20 is refined into CE [33] 
* CE 19 is refined into CE [34] 


### Cost equations --> "Loop" of f5_loop_cont/54 
* CEs [33] --> Loop 32 
* CEs [34] --> Loop 33 

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

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


### Specialization of cost equations f14_loop_cont/54 
* CE 14 is refined into CE [35,36,37,38] 
* CE 13 is refined into CE [39] 


### Cost equations --> "Loop" of f14_loop_cont/54 
* CEs [38] --> Loop 34 
* CEs [37] --> Loop 35 
* CEs [36] --> Loop 36 
* CEs [35] --> Loop 37 
* CEs [39] --> Loop 38 

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

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


### Specialization of cost equations f7_loop_cont/54 
* CE 8 is refined into CE [40,41,42,43,44,45,46,47,48,49] 
* CE 7 is refined into CE [50] 


### Cost equations --> "Loop" of f7_loop_cont/54 
* CEs [41] --> Loop 39 
* CEs [40] --> Loop 40 
* CEs [47,49] --> Loop 41 
* CEs [46,48] --> Loop 42 
* CEs [44] --> Loop 43 
* CEs [42] --> Loop 44 
* CEs [45] --> Loop 45 
* CEs [43] --> Loop 46 
* CEs [50] --> Loop 47 

### 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,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2) 

#### 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,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2) 


### Specialization of cost equations f15/53 
* CE 1 is refined into CE [51] 
* CE 2 is refined into CE [52,53,54,55,56,57,58,59,60,61] 


### Cost equations --> "Loop" of f15/53 
* CEs [52,53,54,55,56,57,58,59] --> Loop 48 
* CEs [51,60,61] --> Loop 49 

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

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


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

#### Cost of chains of f7(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,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3):
* Chain [[20],23]: 1*it(20)+0
  Such that:it(20) =< -A+B

  with precondition: [F=0,W2=5,Z2=0,D=G,B=H,D=I,C=M,H3=I3,H3=J3,B=N3+1,T=O3,A>=2,A3>=2,B>=A+1,E>=A3,K3>=A3,D>=H3+1] 

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

  with precondition: [F=0,W2=5,Z2=0,D=G,B=H,D=I,C=M,H3=I3,H3=J3,B=N3+1,T=O3,A>=2,A3>=2,B>=A+1,H3>=D+1,E>=A3,K3>=A3] 

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

  with precondition: [W2=3,D=G,B=H,D=I,C=M,A>=2,B>=A+1] 

* Chain [23]: 0
  with precondition: [F=0,W2=5,Z2=0,B=A,M=C,D=G,B=H,D=I,M3=W,N3=X,O3=Y,M=H3,M=I3,M=J3,B>=2,A3>=2,D>=M+1,E>=A3,K3>=A3] 

* Chain [22]: 0
  with precondition: [F=0,W2=5,Z2=0,B=A,M=C,D=G,B=H,D=I,M3=W,N3=X,O3=Y,M=H3,M=I3,M=J3,B>=2,A3>=2,M>=D+1,E>=A3,K3>=A3] 

* Chain [21]: 0
  with precondition: [W2=3,H=B,M=C,D=G,D=I,A>=2,H>=A] 


#### Cost of chains of f14(D,E,F,G,H,O,P,Q,R,T,Z,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,Y1,Z1,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3):
* Chain [[24],27]: 1*it(24)+0
  Such that:it(24) =< E+1

  with precondition: [W2=3,D=G,D=Q,E>=0,F>=0] 

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

  with precondition: [W2=4,D=G,D=Q,D=R,D=X2,D=A3,D=H3,T=J3,Y2=L3,C3=M3,D=N3,C3=O3,C3=P3,Y2+K3=E+F,F>=0,Y2>=0,B3>=2,C3>=D+1,E>=Y2+1] 

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

  with precondition: [W2=4,D=G,D=Q,D=R,D=X2,D=A3,D=H3,T=J3,Y2=L3,C3=M3,D=N3,C3=O3,C3=P3,Y2+K3=E+F,F>=0,Y2>=0,B3>=2,E>=Y2+1,D>=C3+1] 

* Chain [27]: 0
  with precondition: [W2=3,D=G,D=Q] 

* Chain [26]: 0
  with precondition: [W2=4,D=G,D=Q,D=R,G3=Z,H3=H1,I3=I1,J3=J1,K3=K1,L3=L1,D=X2,E=Y2,D=A3,O=C3,O=M3,D=N3,O=O3,O=P3,E>=0,F>=0,B3>=2,O>=D+1] 

* Chain [25]: 0
  with precondition: [W2=4,D=G,D=Q,D=R,G3=Z,H3=H1,I3=I1,J3=J1,K3=K1,L3=L1,D=X2,E=Y2,D=A3,O=C3,O=M3,D=N3,O=O3,O=P3,E>=0,F>=0,B3>=2,D>=O+1] 


#### Cost of chains of f5(D,G,H,K,O,T,Z,M1,O1,P1,Q1,R1,S1,T1,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3):
* Chain [[28,29],31]: 2*it(28)+0
  Such that:aux(1) =< R1+1
aux(2) =< R1-J3
it(28) =< aux(1)
it(28) =< aux(2)

  with precondition: [W2=2,M1=O1,M1=X2,M1=Y2,T=I3,H3=J3,Z2>=2,H3>=0,R1>=H3+1] 

* Chain [[28,29],30]: 2*it(28)+0
  Such that:aux(3) =< R1+1
it(28) =< aux(3)

  with precondition: [W2=3,R1>=0] 

* Chain [31]: 0
  with precondition: [W2=2,X2=D,Y2=G,B3=O,C3=Z,O1=M1,I3=S1,J3=T1,R1=H3,R1>=0,Z2>=2] 

* Chain [30]: 0
  with precondition: [W2=3] 


#### Cost of chains of f5_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):
* Chain [33]: 0
  with precondition: [A=2,U=T,U=Z1] 

* Chain [32]: 0
  with precondition: [A=3,U=T,U=Z1] 


#### 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):
* Chain [38]: 0
  with precondition: [A=3,U=T,S1=O1,U=Z1] 

* Chain [37]: 0
  with precondition: [A=4,U=T,P1=N1,S1=O1,U=Z1,S1>=0] 

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

  with precondition: [A=4,U=T,P1=N1,S1=O1,U=Z1,S1>=1] 

* Chain [35]: 0
  with precondition: [A=4,U=T,S1=O1,U=Z1] 

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

  with precondition: [A=4,U=T,S1=O1,U=Z1,S1>=0] 


#### 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,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2):
* Chain [47]: 0
  with precondition: [A=3,F=B,H=E,H=R,U=T] 

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

  with precondition: [A=5,F=B,H=E,H=R,H=S,U=T,F>=0,G>=0,S1>=0,P>=H+1] 

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

  with precondition: [A=5,F=B,H=E,H=R,H=S,U=T,F>=0,G>=0,S1>=0,H>=P+1] 

* Chain [44]: 0
  with precondition: [A=5,F=B,H=E,H=R,H=S,U=T,F>=0,G>=0,P>=H+1] 

* Chain [43]: 0
  with precondition: [A=5,F=B,H=E,H=R,H=S,U=T,F>=0,G>=0,H>=P+1] 

* Chain [42]: 2*s(10)+0
  Such that:aux(4) =< B
s(10) =< aux(4)

  with precondition: [A=5,F=B,H=E,H=R,H=S,U=T,F>=1,G>=0] 

* Chain [41]: 2*s(12)+4*s(14)+0
  Such that:aux(5) =< B
aux(6) =< S1+1
s(12) =< aux(5)
s(14) =< aux(6)

  with precondition: [A=5,F=B,H=E,H=R,H=S,U=T,F>=1,G>=0,S1>=0] 

* Chain [40]: 0
  with precondition: [A=5,F=B,H=E,H=R,U=T] 

* Chain [39]: 1*s(18)+0
  Such that:s(18) =< F+1

  with precondition: [A=5,F=B,H=E,H=R,U=T,F>=0,G>=0] 


#### Cost of chains of f15(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,W2):
* Chain [49]: 1*aux(7)+0
  with precondition: [] 

* Chain [48]: 4*s(20)+4*s(22)+0
  Such that:aux(8) =< E+1
s(20) =< aux(8)

  with precondition: [F=0,E>=2] 


Closed-form bounds of f15(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,W2): 
-------------------------------------
* Chain [49] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [48] with precondition: [F=0,E>=2] 
    - Upper bound: inf 
    - Complexity: infinity 

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