/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. recursive  : [f1/45]
1. non_recursive  : [exit_location/1]
2. recursive  : [f10/28]
3. non_recursive  : [f4/33]
4. non_recursive  : [f10_loop_cont/34]
5. non_recursive  : [f1_loop_cont/34]
6. non_recursive  : [f3/33]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f1/45
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f10/28
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f10_loop_cont/34
5. SCC is partially evaluated into f1_loop_cont/34
6. SCC is partially evaluated into f3/33

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

### Specialization of cost equations f1/45 
* CE 4 is refined into CE [14] 
* CE 5 is refined into CE [15] 
* CE 6 is refined into CE [16] 
* CE 3 is refined into CE [17] 


### Cost equations --> "Loop" of f1/45 
* CEs [17] --> Loop 13 
* CEs [14] --> Loop 14 
* CEs [15] --> Loop 15 
* CEs [16] --> Loop 16 

### Ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,Z,A1,B1,D1,E1,F1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2) 
* RF of phase [13]: [A-B,-B+O]

#### Partial ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,Z,A1,B1,D1,E1,F1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2) 
* Partial RF of phase [13]:
  - RF of loop [13:1]:
    A-B
    -B+O


### Specialization of cost equations f10/28 
* CE 11 is refined into CE [18] 
* CE 10 is refined into CE [19] 
* CE 9 is refined into CE [20] 


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

### Ranking functions of CR f10(I,J,L,M,N,O,P,Q,R,S,T,U,V,W,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2) 
* RF of phase [17]: [T+1]

#### Partial ranking functions of CR f10(I,J,L,M,N,O,P,Q,R,S,T,U,V,W,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2) 
* Partial RF of phase [17]:
  - RF of loop [17:1]:
    T+1


### Specialization of cost equations f10_loop_cont/34 
* CE 13 is refined into CE [21] 
* CE 12 is refined into CE [22] 


### Cost equations --> "Loop" of f10_loop_cont/34 
* CEs [21] --> Loop 20 
* CEs [22] --> Loop 21 

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

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


### Specialization of cost equations f1_loop_cont/34 
* CE 8 is refined into CE [23,24,25,26] 
* CE 7 is refined into CE [27] 


### Cost equations --> "Loop" of f1_loop_cont/34 
* CEs [26] --> Loop 22 
* CEs [25] --> Loop 23 
* CEs [24] --> Loop 24 
* CEs [23] --> Loop 25 
* CEs [27] --> Loop 26 

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

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


### Specialization of cost equations f3/33 
* CE 1 is refined into CE [28] 
* CE 2 is refined into CE [29,30,31,32,33,34,35,36,37,38] 


### Cost equations --> "Loop" of f3/33 
* CEs [32,34,36,38] --> Loop 27 
* CEs [28,29,30,31,33,35,37] --> Loop 28 

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

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


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

#### Cost of chains of f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,Z,A1,B1,D1,E1,F1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2,M2,N2,O2,P2,Q2,R2):
* Chain [[13],16]: 1*it(13)+0
  Such that:it(13) =< -B+O

  with precondition: [Y1=3,C=E,L=N,A=O,L=Z,B>=2,A>=B+1] 

* Chain [[13],15]: 1*it(13)+0
  Such that:it(13) =< -B+O

  with precondition: [Y1=4,C=E,L=N,A=O,L=Z,A=F2+1,I=G2,H2=J2,H2=K2,H2=L2,B>=2,A2>=2,I2>=2,A>=B+1,L>=H2+1] 

* Chain [[13],14]: 1*it(13)+0
  Such that:it(13) =< -B+O

  with precondition: [Y1=4,C=E,L=N,A=O,L=Z,A=F2+1,I=G2,H2=J2,H2=K2,H2=L2,B>=2,A2>=2,I2>=2,A>=B+1,H2>=L+1] 

* Chain [16]: 0
  with precondition: [Y1=3,O=A,E=C,L=N,L=Z,B>=2,O>=B] 

* Chain [15]: 0
  with precondition: [Y1=4,A=B,E=C,E2=F,F2=G,G2=H,L=N,A=O,L=Z,E=H2,E=J2,E=K2,E=L2,A>=2,A2>=2,I2>=2,L>=E+1] 

* Chain [14]: 0
  with precondition: [Y1=4,A=B,E=C,E2=F,F2=G,G2=H,L=N,A=O,L=Z,E=H2,E=J2,E=K2,E=L2,A>=2,A2>=2,I2>=2,E>=L+1] 


#### Cost of chains of f10(I,J,L,M,N,O,P,Q,R,S,T,U,V,W,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2,I2,J2,K2,L2):
* Chain [[17],19]: 1*it(17)+0
  Such that:it(17) =< T-L2

  with precondition: [Y1=2,J=L,J=M,J=N,J=A2,J=C2,I=K2,I2=L2,D2>=2,I2>=0,T>=I2+1] 

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

  with precondition: [Y1=3,L=M,L=N,T>=0] 

* Chain [19]: 0
  with precondition: [Y1=2,L=J,L=M,L=N,E2=P,J2=U,K2=V,L2=W,L=A2,L=C2,T=I2,T>=0,D2>=2] 

* Chain [18]: 0
  with precondition: [Y1=3,L=M,L=N] 


#### Cost of chains of f10_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):
* Chain [21]: 0
  with precondition: [A=2,F1=J] 

* Chain [20]: 0
  with precondition: [A=3,F1=J] 


#### 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):
* Chain [26]: 0
  with precondition: [A=3,F1=J,U=L,N=M,N=O] 

* Chain [25]: 0
  with precondition: [A=4,F1=J,M=K,U=L,M=N,M=O,U>=0] 

* Chain [24]: 1*s(1)+0
  Such that:s(1) =< U

  with precondition: [A=4,F1=J,M=K,U=L,M=N,M=O,U>=1] 

* Chain [23]: 0
  with precondition: [A=4,F1=J,U=L,N=M,N=O] 

* Chain [22]: 1*s(2)+0
  Such that:s(2) =< L+1

  with precondition: [A=4,F1=J,U=L,N=M,N=O,U>=0] 


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

* Chain [27]: 4*s(6)+2*s(8)+0
  Such that:aux(2) =< T+1
s(6) =< aux(2)

  with precondition: [T>=0] 


Closed-form bounds of f3(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,Y1): 
-------------------------------------
* Chain [28] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [27] with precondition: [T>=0] 
    - Upper bound: inf 
    - Complexity: infinity 

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