/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. recursive  : [f1/33]
1. non_recursive  : [f16/39]
2. non_recursive  : [exit_location/1]
3. recursive  : [f14/36]
4. recursive  : [f8/25]
5. non_recursive  : [f8_loop_cont/40]
6. non_recursive  : [f14_loop_cont/40]
7. non_recursive  : [f1_loop_cont/40]
8. non_recursive  : [f15/39]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f1/33
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f14/36
4. SCC is partially evaluated into f8/25
5. SCC is partially evaluated into f8_loop_cont/40
6. SCC is partially evaluated into f14_loop_cont/40
7. SCC is partially evaluated into f1_loop_cont/40
8. SCC is partially evaluated into f15/39

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

### Specialization of cost equations f1/33 
* CE 6 is refined into CE [24] 
* CE 4 is refined into CE [25] 
* CE 3 is refined into CE [26] 
* CE 5 is refined into CE [27] 


### Cost equations --> "Loop" of f1/33 
* CEs [27] --> Loop 23 
* CEs [24] --> Loop 24 
* CEs [25] --> Loop 25 
* CEs [26] --> Loop 26 

### Ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2) 
* RF of phase [23]: [-A+B,-A+F]

#### Partial ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2) 
* Partial RF of phase [23]:
  - RF of loop [23:1]:
    -A+B
    -A+F


### Specialization of cost equations f14/36 
* CE 15 is refined into CE [28] 
* CE 13 is refined into CE [29] 
* CE 14 is refined into CE [30] 
* CE 12 is refined into CE [31] 
* CE 11 is refined into CE [32] 
* CE 10 is refined into CE [33] 
* CE 9 is refined into CE [34] 


### Cost equations --> "Loop" of f14/36 
* CEs [31] --> Loop 27 
* CEs [32] --> Loop 28 
* CEs [33] --> Loop 29 
* CEs [34] --> Loop 30 
* CEs [28] --> Loop 31 
* CEs [29] --> Loop 32 
* CEs [30] --> Loop 33 

### Ranking functions of CR f14(D,E,F,L,M,N,R,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 
* RF of phase [27,28,29,30]: [D+1]

#### Partial ranking functions of CR f14(D,E,F,L,M,N,R,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 
* Partial RF of phase [27,28,29,30]:
  - RF of loop [27:1,28:1,29:1,30:1]:
    D+1


### Specialization of cost equations f8/25 
* CE 21 is refined into CE [35] 
* CE 20 is refined into CE [36] 
* CE 19 is refined into CE [37] 
* CE 18 is refined into CE [38] 


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

### Ranking functions of CR f8(F,H,L,R,B1,D1,E1,F1,G1,H1,I1,J1,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2) 
* RF of phase [34,35]: [I1+1]

#### Partial ranking functions of CR f8(F,H,L,R,B1,D1,E1,F1,G1,H1,I1,J1,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2) 
* Partial RF of phase [34,35]:
  - RF of loop [34:1,35:1]:
    I1+1


### Specialization of cost equations f8_loop_cont/40 
* CE 23 is refined into CE [39] 
* CE 22 is refined into CE [40] 


### Cost equations --> "Loop" of f8_loop_cont/40 
* CEs [39] --> Loop 38 
* CEs [40] --> Loop 39 

### 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,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1) 

#### 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,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1) 


### Specialization of cost equations f14_loop_cont/40 
* CE 17 is refined into CE [41,42,43,44] 
* CE 16 is refined into CE [45] 


### Cost equations --> "Loop" of f14_loop_cont/40 
* CEs [44] --> Loop 40 
* CEs [43] --> Loop 41 
* CEs [42] --> Loop 42 
* CEs [41] --> Loop 43 
* CEs [45] --> 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) 

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


### Specialization of cost equations f1_loop_cont/40 
* CE 8 is refined into CE [46,47,48,49,50,51,52,53,54,55] 
* CE 7 is refined into CE [56] 


### Cost equations --> "Loop" of f1_loop_cont/40 
* CEs [55] --> Loop 45 
* CEs [54] --> Loop 46 
* CEs [46,48] --> Loop 47 
* CEs [47,49] --> Loop 48 
* CEs [52] --> Loop 49 
* CEs [53] --> Loop 50 
* CEs [50] --> Loop 51 
* CEs [51] --> Loop 52 
* CEs [56] --> Loop 53 

### 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,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1) 

#### 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,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1) 


### Specialization of cost equations f15/39 
* CE 1 is refined into CE [57] 
* CE 2 is refined into CE [58,59,60,61,62,63,64,65,66,67] 


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

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

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


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

#### Cost of chains of f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2):
* Chain [[23],26]: 1*it(23)+0
  Such that:it(23) =< -A+B

  with precondition: [E=0,H2=5,K2=0,B=F,C=J,R2=S2,R2=T2,B=W2+1,0>=R2+1,A>=2,L2>=2,B>=A+1,D>=L2,U2>=L2] 

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

  with precondition: [E=0,H2=5,K2=0,B=F,C=J,R2=S2,R2=T2,B=W2+1,A>=2,L2>=2,R2>=1,B>=A+1,D>=L2,U2>=L2] 

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

  with precondition: [H2=3,B=F,C=J,A>=2,B>=A+1] 

* Chain [26]: 0
  with precondition: [E=0,H2=5,K2=0,B=A,J=C,B=F,V2=P,W2=Q,J=R2,J=S2,J=T2,0>=J+1,B>=2,L2>=2,D>=L2,U2>=L2] 

* Chain [25]: 0
  with precondition: [E=0,H2=5,K2=0,B=A,J=C,B=F,V2=P,W2=Q,J=R2,J=S2,J=T2,B>=2,J>=1,L2>=2,D>=L2,U2>=L2] 

* Chain [24]: 0
  with precondition: [H2=3,F=B,J=C,A>=2,F>=A] 


#### Cost of chains of f14(D,E,F,L,M,N,R,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2):
* Chain [[27,28,29,30],33]: 4*it(27)+0
  Such that:aux(1) =< D+1
aux(2) =< -E+R2
it(27) =< aux(1)
it(27) =< aux(2)

  with precondition: [N=0,H2=4,P2=0,U2=0,W2=0,I2=S2,L2=T2,L2=V2,L2=X2,L2=Y2,I2+R2=D+E,0>=L2+1,E>=0,I2>=0,K2>=2,D>=I2+1] 

* Chain [[27,28,29,30],32]: 4*it(27)+0
  Such that:aux(1) =< D+1
aux(2) =< -E+R2
it(27) =< aux(1)
it(27) =< aux(2)

  with precondition: [N=0,H2=4,P2=0,U2=0,W2=0,I2=S2,L2=T2,L2=V2,L2=X2,L2=Y2,I2+R2=D+E,E>=0,I2>=0,K2>=2,L2>=1,D>=I2+1] 

* Chain [[27,28,29,30],31]: 4*it(27)+0
  Such that:aux(3) =< D+1
it(27) =< aux(3)

  with precondition: [H2=3,D>=0,E>=0] 

* Chain [33]: 0
  with precondition: [N=0,H2=4,U2=0,W2=0,O2=R,P2=X,Q2=Y,R2=Z,S2=A1,D=I2,L=L2,L=T2,L=V2,L=X2,L=Y2,0>=L+1,D>=0,E>=0,K2>=2] 

* Chain [32]: 0
  with precondition: [N=0,H2=4,U2=0,W2=0,O2=R,P2=X,Q2=Y,R2=Z,S2=A1,D=I2,L=L2,L=T2,L=V2,L=X2,L=Y2,D>=0,E>=0,L>=1,K2>=2] 

* Chain [31]: 0
  with precondition: [H2=3] 


#### Cost of chains of f8(F,H,L,R,B1,D1,E1,F1,G1,H1,I1,J1,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2):
* Chain [[34,35],37]: 2*it(34)+0
  Such that:aux(4) =< I1+1
aux(5) =< I1-S2
it(34) =< aux(4)
it(34) =< aux(5)

  with precondition: [B1=0,D1=0,H2=2,S2=T2,I2>=2,S2>=0,I1>=S2+1] 

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

  with precondition: [D1=0,H2=3,I1>=0] 

* Chain [37]: 0
  with precondition: [H2=2,K2=L,L2=R,D1=B1,T2=J1,I1=S2,I1>=0,I2>=2] 

* Chain [36]: 0
  with precondition: [H2=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,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1):
* Chain [39]: 0
  with precondition: [A=2] 

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


#### 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):
* Chain [44]: 0
  with precondition: [A=3,J1=D1] 

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

  with precondition: [A=4,C1=0,E1=0,J1=D1,J1>=1] 

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

  with precondition: [A=4,E1=0,J1=D1,J1>=0] 

* Chain [41]: 0
  with precondition: [A=4,E1=C1,J1=D1,J1>=0] 

* Chain [40]: 0
  with precondition: [A=4,J1=D1] 


#### 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,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1):
* Chain [53]: 0
  with precondition: [A=3,E=B] 

* Chain [52]: 0
  with precondition: [A=5,O=0,E=B,0>=M+1,E>=0,F>=0] 

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

  with precondition: [A=5,O=0,E=B,0>=M+1,E>=0,F>=0,J1>=0] 

* Chain [50]: 0
  with precondition: [A=5,O=0,E=B,E>=0,F>=0,M>=1] 

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

  with precondition: [A=5,O=0,E=B,E>=0,F>=0,M>=1,J1>=0] 

* Chain [48]: 8*s(12)+0
  Such that:aux(7) =< E
aux(8) =< E+1
s(12) =< aux(8)
s(12) =< aux(7)

  with precondition: [A=5,O=0,E=B,E>=1,F>=0] 

* Chain [47]: 8*s(18)+4*s(20)+0
  Such that:aux(9) =< E
aux(10) =< E+1
aux(11) =< J1+1
s(20) =< aux(11)
s(18) =< aux(10)
s(18) =< aux(9)

  with precondition: [A=5,O=0,E=B,E>=1,F>=0,J1>=0] 

* Chain [46]: 0
  with precondition: [A=5,E=B] 

* Chain [45]: 4*s(27)+0
  Such that:s(26) =< E+1
s(27) =< s(26)

  with precondition: [A=5,E=B,E>=0,F>=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,H2):
* Chain [55]: 1*aux(12)+0
  with precondition: [] 

* Chain [54]: 16*s(30)+4*s(33)+0
  Such that:aux(13) =< D+1
s(30) =< aux(13)

  with precondition: [E=0,D>=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,H2): 
-------------------------------------
* Chain [55] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [54] with precondition: [E=0,D>=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,H2): inf 
Asymptotic class: infinity 
* Total analysis performed in 2297 ms.