/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  : [f6/32]
1. non_recursive  : [exit_location/1]
2. recursive  : [f11/5]
3. non_recursive  : [f11_loop_cont/2]
4. non_recursive  : [f6_loop_cont/33]
5. non_recursive  : [f26/32]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f6/32
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f11/5
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f6_loop_cont/33
5. SCC is partially evaluated into f26/32

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

### Specialization of cost equations f6/32 
* CE 4 is refined into CE [12] 
* CE 5 is refined into CE [13] 
* CE 6 is refined into CE [14] 
* CE 2 is refined into CE [15] 
* CE 3 is refined into CE [16] 


### Cost equations --> "Loop" of f6/32 
* CEs [15] --> Loop 12 
* CEs [16] --> Loop 13 
* CEs [12] --> Loop 14 
* CEs [13] --> Loop 15 
* CEs [14] --> Loop 16 

### Ranking functions of CR f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Z,E1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2) 
* RF of phase [12,13]: [-G+5,H,-I+5,J]

#### Partial ranking functions of CR f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Z,E1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2) 
* Partial RF of phase [12,13]:
  - RF of loop [12:1,13:1]:
    -G+5
    H
    -I+5
    J


### Specialization of cost equations f11/5 
* CE 11 is refined into CE [17] 
* CE 9 is refined into CE [18] 
* CE 10 is refined into CE [19] 


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

### Ranking functions of CR f11(A,B,C,D,Q1) 

#### Partial ranking functions of CR f11(A,B,C,D,Q1) 


### Specialization of cost equations f6_loop_cont/33 
* CE 8 is refined into CE [20,21,22,23,24] 
* CE 7 is refined into CE [25] 


### Cost equations --> "Loop" of f6_loop_cont/33 
* CEs [22] --> Loop 20 
* CEs [21] --> Loop 21 
* CEs [20] --> Loop 22 
* CEs [25] --> Loop 23 
* CEs [24] --> Loop 24 
* CEs [23] --> Loop 25 

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

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


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


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

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

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


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

#### Cost of chains of f6(A,B,C,D,E,F,G,H,I,J,K,L,M,N,Z,E1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2):
* Chain [[12,13],16]: 2*it(12)+0
  Such that:aux(9) =< J
it(12) =< aux(9)

  with precondition: [Q1=2,G=I,G+H=5,G+J=5,4>=G,G>=1] 

* Chain [[12,13],15]: 2*it(12)+0
  Such that:aux(10) =< J
aux(11) =< J-Z1
it(12) =< aux(10)
it(12) =< aux(11)

  with precondition: [Q1=3,G=I,R1=S1,R1=T1,E=U1,E=V1,W1=Y1,G+H=5,G+J=5,W1+X1=5,W1+Z1=5,W1+C2=5,4>=W1,G>=1,R1>=A+1,W1>=G+1] 

* Chain [[12,13],14]: 2*it(12)+0
  Such that:aux(12) =< J
aux(13) =< J-Z1
it(12) =< aux(12)
it(12) =< aux(13)

  with precondition: [Q1=3,G=I,R1=S1,R1=T1,E=U1,E=V1,W1=Y1,G+H=5,G+J=5,W1+X1=5,W1+Z1=5,W1+C2=5,4>=W1,G>=1,W1>=G+1,A>=R1+1] 

* Chain [16]: 0
  with precondition: [Q1=2,J=H,G+J=5,I+J=5,4>=J] 

* Chain [15]: 0
  with precondition: [Q1=3,E=F,J=H,A2=K,B2=L,C2=M,R1=S1,R1=T1,E=U1,E=V1,J=X1,J=Z1,G+J=5,I+J=5,J+W1=5,J+Y1=5,4>=J,J>=1,R1>=A+1] 

* Chain [14]: 0
  with precondition: [Q1=3,E=F,J=H,A2=K,B2=L,C2=M,R1=S1,R1=T1,E=U1,E=V1,J=X1,J=Z1,G+J=5,I+J=5,J+W1=5,J+Y1=5,4>=J,J>=1,A>=R1+1] 


#### Cost of chains of f11(A,B,C,D,Q1):
* Chain [[18]]...: 1*it(18)+0
  with precondition: [B>=A+1,Q1=2] 

* Chain [[18],19]: 1*it(18)+0
  with precondition: [Q1=2,B>=A+1] 

* Chain [[17]]...: 1*it(17)+0
  with precondition: [A>=B+1,Q1=2] 

* Chain [[17],19]: 1*it(17)+0
  with precondition: [Q1=2,A>=B+1] 

* Chain [19]: 0
  with precondition: [Q1=2] 


#### Cost of chains of f6_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):
* Chain [25]...: 1*s(1)+0
  with precondition: [A=3,P=2,Q=3,T=4,V=0,E1=4,Y=X,Y=Z,C>=B+1] 

* Chain [24]...: 1*s(2)+0
  with precondition: [A=3,P=2,Q=3,T=4,V=0,E1=4,Y=X,Y=Z,B>=C+1] 

* Chain [23]: 0
  with precondition: [A=2,P=2,Q=3,T=4,V=0,E1=4,Y=X,Y=Z] 

* Chain [22]: 0
  with precondition: [A=3,P=2,Q=3,T=4,V=0,E1=4,Y=X,Y=Z] 

* Chain [21]: 1*s(3)+0
  with precondition: [A=3,P=2,Q=3,T=4,V=0,E1=4,Y=X,Y=Z,C>=B+1] 

* Chain [20]: 1*s(4)+0
  with precondition: [A=3,P=2,Q=3,T=4,V=0,E1=4,Y=X,Y=Z,B>=C+1] 


#### Cost of chains of f26(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,Q1):
* Chain [27]: 1*aux(16)+0
  with precondition: [] 

* Chain [26]...: 1*aux(19)+0
  with precondition: [] 


Closed-form bounds of f26(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,Q1): 
-------------------------------------
* Chain [27] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [26]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

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