/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  : [f12/39]
1. recursive  : [f9/53]
2. non_recursive  : [exit_location/1]
3. recursive  : [f20/35]
4. non_recursive  : [f20_loop_cont/40]
5. non_recursive  : [f9_loop_cont/40]
6. non_recursive  : [f11/39]

#### 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 f20/35
4. SCC is partially evaluated into f20_loop_cont/40
5. SCC is partially evaluated into f9_loop_cont/40
6. SCC is partially evaluated into f11/39

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

### Specialization of cost equations f9/53 
* CE 8 is refined into CE [20] 
* CE 9 is refined into CE [21] 
* CE 6 is refined into CE [22] 
* CE 7 is refined into CE [23] 
* CE 11 is refined into CE [24] 
* CE 10 is refined into CE [25] 
* CE 5 is refined into CE [26] 


### Cost equations --> "Loop" of f9/53 
* CEs [26] --> Loop 20 
* CEs [20] --> Loop 21 
* CEs [21] --> Loop 22 
* CEs [22] --> Loop 23 
* CEs [23] --> Loop 24 
* CEs [24] --> Loop 25 
* CEs [25] --> Loop 26 

### 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,E1,F1,H1,I1,J1,K1,L1,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) 
* RF of phase [20]: [B-D,C-D]

#### 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,E1,F1,H1,I1,J1,K1,L1,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) 
* Partial RF of phase [20]:
  - RF of loop [20:1]:
    B-D
    C-D


### Specialization of cost equations f20/35 
* CE 17 is refined into CE [27] 
* CE 16 is refined into CE [28] 
* CE 15 is refined into CE [29] 


### Cost equations --> "Loop" of f20/35 
* CEs [29] --> Loop 27 
* CEs [27] --> Loop 28 
* CEs [28] --> Loop 29 

### Ranking functions of CR f20(A,B,K,L,N,O,P,Q,R,S,T,U,X,Y,Z,A1,B1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3) 

#### Partial ranking functions of CR f20(A,B,K,L,N,O,P,Q,R,S,T,U,X,Y,Z,A1,B1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3) 


### Specialization of cost equations f20_loop_cont/40 
* CE 19 is refined into CE [30] 
* CE 18 is refined into CE [31] 


### Cost equations --> "Loop" of f20_loop_cont/40 
* CEs [30] --> Loop 30 
* CEs [31] --> Loop 31 

### Ranking functions of CR f20_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 f20_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 f9_loop_cont/40 
* CE 14 is refined into CE [32,33,34,35,36] 
* CE 13 is refined into CE [37] 
* CE 12 is refined into CE [38] 


### Cost equations --> "Loop" of f9_loop_cont/40 
* CEs [32,33] --> Loop 32 
* CEs [34] --> Loop 33 
* CEs [37] --> Loop 34 
* CEs [38] --> Loop 35 
* CEs [35,36] --> Loop 36 

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

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


### Specialization of cost equations f11/39 
* CE 2 is refined into CE [39] 
* CE 1 is refined into CE [40] 
* CE 3 is refined into CE [41] 
* CE 4 is refined into CE [42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61] 


### Cost equations --> "Loop" of f11/39 
* CEs [49,59] --> Loop 37 
* CEs [51,57] --> Loop 38 
* CEs [47,53,55,61] --> Loop 39 
* CEs [48,58] --> Loop 40 
* CEs [50,56] --> Loop 41 
* CEs [42,43,46,52,54,60] --> Loop 42 
* CEs [39] --> Loop 43 
* CEs [40] --> Loop 44 
* CEs [41] --> Loop 45 
* CEs [44,45] --> Loop 46 

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

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


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

#### 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,E1,F1,H1,I1,J1,K1,L1,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):
* Chain [[20],26]: 1*it(20)+0
  Such that:it(20) =< B-D

  with precondition: [J2=2,B=C,E=G,N=S,N=E1,B=S2+1,K=T2,L=U2,M=V2,N=W2,H1=X2,Q=Y2,R=Z2,N=A3,T=B3,J1=G3,K1=H3,L1=I3,D>=2,L2>=2,B>=D+1,J1>=L2] 

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

  with precondition: [J2=3,B=C,E=G,N=S,N=E1,D>=2,B>=D+1] 

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

  with precondition: [J2=4,B=C,E=G,N=S,N=E1,B=S2+1,K=T2,U2=X2,P=Y2,U2=Z2,W2=A3,U2=B3,V2+1=G3,K=H3,D>=2,L2>=2,B>=D+1,J1>=L2,P>=U2+1,H1>=U2+1] 

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

  with precondition: [J2=4,B=C,E=G,N=S,N=E1,B=S2+1,K=T2,U2=X2,P=Y2,U2=Z2,W2=A3,U2=B3,V2+1=G3,K=H3,D>=2,L2>=2,B>=D+1,U2>=H1+1,J1>=L2,P>=U2+1] 

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

  with precondition: [J2=4,B=C,E=G,N=S,N=E1,B=S2+1,K=T2,U2=X2,P=Y2,U2=Z2,W2=A3,U2=B3,V2+1=G3,K=H3,D>=2,L2>=2,B>=D+1,U2>=P+1,J1>=L2,H1>=U2+1] 

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

  with precondition: [J2=4,B=C,E=G,N=S,N=E1,B=S2+1,K=T2,U2=X2,P=Y2,U2=Z2,W2=A3,U2=B3,V2+1=G3,K=H3,D>=2,L2>=2,B>=D+1,U2>=P+1,U2>=H1+1,J1>=L2] 

* Chain [26]: 0
  with precondition: [J2=2,C=B,C=D,G=E,R2=H,S2=I,T2=J,U2=L,V2=M,Y2=Q,Z2=R,N=S,B3=T,N=E1,G=H1,H3=K1,I3=L1,N=W2,G=X2,N=A3,J1=G3,C>=2,L2>=2,J1>=L2] 

* Chain [25]: 0
  with precondition: [J2=3,C=B,G=E,N=S,N=E1,D>=2,C>=D] 

* Chain [24]: 0
  with precondition: [J2=4,C=B,C=D,G=E,R2=H,S2=I,T2=J,H3=K,N=S,N=E1,G=U2,G3=V2+1,A3=W2,G=X2,P=Y2,G=Z2,G=B3,C>=2,L2>=2,P>=G+1,H1>=G+1,J1>=L2] 

* Chain [23]: 0
  with precondition: [J2=4,C=B,C=D,G=E,R2=H,S2=I,T2=J,H3=K,N=S,N=E1,G=U2,G3=V2+1,A3=W2,G=X2,P=Y2,G=Z2,G=B3,C>=2,L2>=2,P>=G+1,G>=H1+1,J1>=L2] 

* Chain [22]: 0
  with precondition: [J2=4,C=B,C=D,G=E,R2=H,S2=I,T2=J,H3=K,N=S,N=E1,G=U2,G3=V2+1,A3=W2,G=X2,P=Y2,G=Z2,G=B3,C>=2,L2>=2,H1>=G+1,G>=P+1,J1>=L2] 

* Chain [21]: 0
  with precondition: [J2=4,C=B,C=D,G=E,R2=H,S2=I,T2=J,H3=K,N=S,N=E1,G=U2,G3=V2+1,A3=W2,G=X2,P=Y2,G=Z2,G=B3,C>=2,L2>=2,G>=P+1,G>=H1+1,J1>=L2] 


#### Cost of chains of f20(A,B,K,L,N,O,P,Q,R,S,T,U,X,Y,Z,A1,B1,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3):
* Chain [[27]]...: 1*it(27)+0
  with precondition: [] 

* Chain [[27],29]: 1*it(27)+0
  with precondition: [J2=2,L=Q,O2=T2,M2=Z2,V2=A3,L2>=2] 

* Chain [[27],28]: 1*it(27)+0
  with precondition: [J2=3] 

* Chain [29]: 0
  with precondition: [J2=2,M2=K,Q=L,O2=N,T2=S,V2=U,W2=X,X2=Y,Y2=Z,Z2=A1,A3=B1,L2>=2] 

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


#### Cost of chains of f20_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 [31]: 0
  with precondition: [A=2] 

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


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

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

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

* Chain [33]: 1*s(4)+0
  with precondition: [A=4] 

* Chain [32]: 1*aux(3)+0
  with precondition: [A=4,R=M] 


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

* Chain [45]: 0
  with precondition: [H1=F] 

* Chain [44]: 0
  with precondition: [C1=H1,C1>=P+1] 

* Chain [43]: 0
  with precondition: [C1=H1,P>=C1+1] 

* Chain [42]: 1*aux(5)+0
  with precondition: [J1>=2] 

* Chain [41]: 1*aux(6)+0
  with precondition: [J1>=2,H1>=P+2] 

* Chain [40]: 1*aux(7)+0
  with precondition: [J1>=2,P>=H1+2] 

* Chain [39]...: 1*aux(8)+0
  with precondition: [J1>=2] 

* Chain [38]...: 1*aux(9)+0
  with precondition: [J1>=2,H1>=P+2] 

* Chain [37]...: 1*aux(10)+0
  with precondition: [J1>=2,P>=H1+2] 


Closed-form bounds of f11(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,J2): 
-------------------------------------
* Chain [46] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [45] with precondition: [H1=F] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [44] with precondition: [C1=H1,C1>=P+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [43] with precondition: [C1=H1,P>=C1+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [42] with precondition: [J1>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [41] with precondition: [J1>=2,H1>=P+2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [40] with precondition: [J1>=2,P>=H1+2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [39]... with precondition: [J1>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [38]... with precondition: [J1>=2,H1>=P+2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [37]... with precondition: [J1>=2,P>=H1+2] 
    - Upper bound: inf 
    - Complexity: infinity 

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