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


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


MAYBE

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

#### Computed strongly connected components 
0. non_recursive  : [f1/35]
1. recursive  : [f11/34]
2. non_recursive  : [exit_location/1]
3. recursive  : [f2/11]
4. non_recursive  : [f2_loop_cont/2]
5. non_recursive  : [f11_loop_cont/36]
6. recursive  : [f5/11]
7. non_recursive  : [f5_loop_cont/2]
8. non_recursive  : [f0/35]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f11/34
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f2/11
4. SCC is completely evaluated into other SCCs
5. SCC is partially evaluated into f11_loop_cont/36
6. SCC is partially evaluated into f5/11
7. SCC is completely evaluated into other SCCs
8. SCC is partially evaluated into f0/35

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

### Specialization of cost equations f11/34 
* CE 7 is refined into CE [17] 
* CE 6 is refined into CE [18] 
* CE 8 is refined into CE [19] 
* CE 5 is refined into CE [20] 


### Cost equations --> "Loop" of f11/34 
* CEs [20] --> Loop 17 
* CEs [17] --> Loop 18 
* CEs [18] --> Loop 19 
* CEs [19] --> Loop 20 

### Ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,W,Z,A1,H1,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2) 
* RF of phase [17]: [A-B,-B+K]

#### Partial ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,W,Z,A1,H1,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2) 
* Partial RF of phase [17]:
  - RF of loop [17:1]:
    A-B
    -B+K


### Specialization of cost equations f2/11 
* CE 16 is refined into CE [21] 
* CE 15 is refined into CE [22] 
* CE 14 is refined into CE [23] 


### Cost equations --> "Loop" of f2/11 
* CEs [22] --> Loop 21 
* CEs [23] --> Loop 22 
* CEs [21] --> Loop 23 

### Ranking functions of CR f2(I,J,K,L,M,N,O,P,Q,R,F2) 

#### Partial ranking functions of CR f2(I,J,K,L,M,N,O,P,Q,R,F2) 


### Specialization of cost equations f11_loop_cont/36 
* CE 10 is refined into CE [24,25,26,27,28] 
* CE 9 is refined into CE [29] 


### Cost equations --> "Loop" of f11_loop_cont/36 
* CEs [25] --> Loop 24 
* CEs [24] --> Loop 25 
* CEs [26] --> Loop 26 
* CEs [29] --> Loop 27 
* CEs [28] --> Loop 28 
* CEs [27] --> Loop 29 

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

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


### Specialization of cost equations f5/11 
* CE 13 is refined into CE [30] 
* CE 12 is refined into CE [31] 
* CE 11 is refined into CE [32] 


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

### Ranking functions of CR f5(I,J,K,L,M,N,O,S,T,U,F2) 

#### Partial ranking functions of CR f5(I,J,K,L,M,N,O,S,T,U,F2) 


### Specialization of cost equations f0/35 
* CE 4 is refined into CE [33,34,35] 
* CE 3 is refined into CE [36,37,38] 
* CE 1 is refined into CE [39] 
* CE 2 is refined into CE [40,41,42,43,44,45,46,47,48,49,50,51,52,53] 


### Cost equations --> "Loop" of f0/35 
* CEs [47,53] --> Loop 33 
* CEs [35] --> Loop 34 
* CEs [44,50] --> Loop 35 
* CEs [38] --> Loop 36 
* CEs [45,46,51,52] --> Loop 37 
* CEs [33,34] --> Loop 38 
* CEs [42,43,48,49] --> Loop 39 
* CEs [36,37] --> Loop 40 
* CEs [39] --> Loop 41 
* CEs [40,41] --> Loop 42 

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

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


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

#### Cost of chains of f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,W,Z,A1,H1,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2):
* Chain [[17],20]: 1*it(17)+0
  Such that:it(17) =< A-B

  with precondition: [F2=2,C=E,A=K,B>=2,A>=B+1] 

* Chain [[17],19]: 1*it(17)+0
  Such that:it(17) =< -B+K

  with precondition: [F2=3,C=E,A=K,A=M2+1,I=N2,P2=Q2,0>=J+1,B>=2,H1>=2,O2>=2,A>=B+1] 

* Chain [[17],18]: 1*it(17)+0
  Such that:it(17) =< -B+K

  with precondition: [F2=3,C=E,A=K,A=M2+1,I=N2,P2=Q2,B>=2,J>=1,H1>=2,O2>=2,A>=B+1] 

* Chain [20]: 0
  with precondition: [F2=2,K=A,E=C,B>=2,K>=B] 

* Chain [19]: 0
  with precondition: [F2=3,A=B,E=C,L2=F,M2=G,N2=H,A=K,Q2=P2,0>=J+1,A>=2,H1>=2,O2>=2] 

* Chain [18]: 0
  with precondition: [F2=3,A=B,E=C,L2=F,M2=G,N2=H,A=K,Q2=P2,A>=2,J>=1,H1>=2,O2>=2] 


#### Cost of chains of f2(I,J,K,L,M,N,O,P,Q,R,F2):
* Chain [[22]]...: 1*it(22)+0
  with precondition: [J=O,J=M,0>=J+1,F2=2] 

* Chain [[22],23]: 1*it(22)+0
  with precondition: [F2=2,O=J,O=M,0>=O+1] 

* Chain [[21]]...: 1*it(21)+0
  with precondition: [J=O,J=M,J>=1,F2=2] 

* Chain [[21],23]: 1*it(21)+0
  with precondition: [F2=2,O=J,O=M,O>=1] 

* Chain [23]: 0
  with precondition: [F2=2,J=M,J=O] 


#### Cost of chains of f11_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):
* Chain [29]...: 1*s(1)+0
  with precondition: [A=3,N=K,N=P,0>=N+1] 

* Chain [28]...: 1*s(2)+0
  with precondition: [A=3,N=K,N=P,N>=1] 

* Chain [27]: 0
  with precondition: [A=2,N=K,N=P] 

* Chain [26]: 0
  with precondition: [A=3,N=K,N=P] 

* Chain [25]: 1*s(3)+0
  with precondition: [A=3,N=K,N=P,0>=N+1] 

* Chain [24]: 1*s(4)+0
  with precondition: [A=3,N=K,N=P,N>=1] 


#### Cost of chains of f5(I,J,K,L,M,N,O,S,T,U,F2):
* Chain [[31]]...: 1*it(31)+0
  with precondition: [J=O,L=N,J=M,0>=J+1,K=1,F2=2] 

* Chain [[31],32]: 1*it(31)+0
  with precondition: [K=1,F2=2,O=J,O=M,L=N,0>=O+1] 

* Chain [[30]]...: 1*it(30)+0
  with precondition: [J=O,L=N,J=M,J>=1,K=1,F2=2] 

* Chain [[30],32]: 1*it(30)+0
  with precondition: [K=1,F2=2,O=J,O=M,L=N,O>=1] 

* Chain [32]: 0
  with precondition: [K=1,F2=2,N=L,J=M,J=O] 


#### 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,F2):
* Chain [42]: 1*aux(1)+0
  with precondition: [] 

* Chain [41]: 0
  with precondition: [Y=0] 

* Chain [40]: 1*aux(2)+0
  with precondition: [0>=J+1] 

* Chain [39]: 1*aux(3)+0
  with precondition: [0>=J+1,H1>=2] 

* Chain [38]: 1*aux(4)+0
  with precondition: [J>=1] 

* Chain [37]: 1*aux(5)+0
  with precondition: [J>=1,H1>=2] 

* Chain [36]...: 1*s(16)+0
  with precondition: [0>=J+1] 

* Chain [35]...: 1*aux(6)+0
  with precondition: [0>=J+1,H1>=2] 

* Chain [34]...: 1*s(20)+0
  with precondition: [J>=1] 

* Chain [33]...: 1*aux(7)+0
  with precondition: [J>=1,H1>=2] 


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,F2): 
-------------------------------------
* Chain [42] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [41] with precondition: [Y=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [40] with precondition: [0>=J+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [39] with precondition: [0>=J+1,H1>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [38] with precondition: [J>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [37] with precondition: [J>=1,H1>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [36]... with precondition: [0>=J+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [35]... with precondition: [0>=J+1,H1>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [34]... with precondition: [J>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [33]... with precondition: [J>=1,H1>=2] 
    - Upper bound: inf 
    - Complexity: infinity 

### 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,F2): inf 
Asymptotic class: infinity 
* Total analysis performed in 964 ms.