/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/19,f300/19]
1. recursive  : [f1_loop_cont/20,f8/19]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f32/14]
4. non_recursive  : [f8_loop_cont/15]
5. non_recursive  : [f15/14]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f1/19
1. SCC is partially evaluated into f8/19
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f8_loop_cont/15
5. SCC is partially evaluated into f15/14

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

### Specialization of cost equations f1/19 
* CE 10 is refined into CE [13] 
* CE 12 is refined into CE [14] 
* CE 11 is refined into CE [15] 
* CE 9 is refined into CE [16] 


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

### Ranking functions of CR f1(A,B,C,E,F,G,H,J,K,M,Q,R,S,T,U,V,W,X,Y) 
* RF of phase [14]: [-B+E-1]

#### Partial ranking functions of CR f1(A,B,C,E,F,G,H,J,K,M,Q,R,S,T,U,V,W,X,Y) 
* Partial RF of phase [14]:
  - RF of loop [14:1]:
    -B+E-1


### Specialization of cost equations f8/19 
* CE 4 is refined into CE [17] 
* CE 3 is refined into CE [18,19,20,21] 
* CE 6 is refined into CE [22] 
* CE 2 is refined into CE [23,24,25] 
* CE 5 is refined into CE [26] 


### Cost equations --> "Loop" of f8/19 
* CEs [26] --> Loop 17 
* CEs [24] --> Loop 18 
* CEs [23] --> Loop 19 
* CEs [25] --> Loop 20 
* CEs [17] --> Loop 21 
* CEs [20] --> Loop 22 
* CEs [19] --> Loop 23 
* CEs [18] --> Loop 24 
* CEs [22] --> Loop 25 
* CEs [21] --> Loop 26 

### Ranking functions of CR f8(A,B,C,E,F,G,H,J,K,M,Q,R,S,T,U,V,W,X,Y) 
* RF of phase [17]: [-A+B]

#### Partial ranking functions of CR f8(A,B,C,E,F,G,H,J,K,M,Q,R,S,T,U,V,W,X,Y) 
* Partial RF of phase [17]:
  - RF of loop [17:1]:
    -A+B


### Specialization of cost equations f8_loop_cont/15 
* CE 7 is refined into CE [27] 
* CE 8 is refined into CE [28] 


### Cost equations --> "Loop" of f8_loop_cont/15 
* CEs [27] --> Loop 27 
* CEs [28] --> Loop 28 

### Ranking functions of CR f8_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) 

#### Partial ranking functions of CR f8_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) 


### Specialization of cost equations f15/14 
* CE 1 is refined into CE [29,30,31,32,33,34,35,36,37,38,39,40,41,42,43] 


### Cost equations --> "Loop" of f15/14 
* CEs [41,42,43] --> Loop 29 
* CEs [37] --> Loop 30 
* CEs [34,38] --> Loop 31 
* CEs [33] --> Loop 32 
* CEs [32,36] --> Loop 33 
* CEs [31,39,40] --> Loop 34 
* CEs [30,35] --> Loop 35 
* CEs [29] --> Loop 36 

### Ranking functions of CR f15(A,B,C,D,E,F,G,H,I,J,K,L,M,Q) 

#### Partial ranking functions of CR f15(A,B,C,D,E,F,G,H,I,J,K,L,M,Q) 


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

#### Cost of chains of f1(A,B,C,E,F,G,H,J,K,M,Q,R,S,T,U,V,W,X,Y):
* Chain [[14],16]: 1*it(14)+0
  Such that:it(14) =< -B+E

  with precondition: [H=0,J=0,K=0,Q=2,M>=5,B>=A+1,E>=B+2] 

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

  with precondition: [H=0,J=0,K=0,Q=3,W=1,X=1,Y=1,A+1=R,E=S,M>=5,B>=A+1,E>=B+2] 

* Chain [[13]]...: 1*it(13)+0
  with precondition: [E>=B+1,B>=A+1,H=0,J=0,K=0,4>=M,Q>=2,3>=Q] 

* Chain [[13],16]: 1*it(13)+0
  with precondition: [H=0,J=0,K=0,Q=2,4>=M,B>=A+1,E>=B+1] 

* Chain [16]: 0
  with precondition: [H=0,J=0,K=0,Q=2,B>=A+1,E>=B+1] 

* Chain [15]: 0
  with precondition: [H=0,J=0,K=0,Q=3,W=1,X=1,Y=1,B+1=E,V=G,A+1=R,B+1=S,M>=5,B>=A+1] 


#### Cost of chains of f8(A,B,C,E,F,G,H,J,K,M,Q,R,S,T,U,V,W,X,Y):
* Chain [[20]]...: 2*it(20)+0
  with precondition: [E>=B+1,B>=A+1,4>=M] 

* Chain [[20],[17],25]: 2*it(20)+1*s(4)+0
  with precondition: [Q=2,4>=M,B>=A+1,E>=B+1] 

* Chain [[20],[17],21]: 2*it(20)+1*s(5)+0
  with precondition: [Q=4,R=S,4>=M,B>=A+1,E>=B+1,R>=E] 

* Chain [[20],26]...: 3*it(20)+0
  with precondition: [Q=2,4>=M,B>=A+1,E>=B+1] 

* Chain [[20],25]: 2*it(20)+0
  with precondition: [Q=2,4>=M,B>=A+1,E>=B+1] 

* Chain [[20],24]: 3*it(20)+0
  with precondition: [Q=2,4>=M,B>=A+1,E>=B+1] 

* Chain [[20],22]: 2*it(20)+0
  with precondition: [Q=2,4>=M,B>=A+1,E>=B+1] 

* Chain [[20],21]: 2*it(20)+0
  with precondition: [Q=4,4>=M,B>=A+1,E>=B+1,R>=S] 

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

  with precondition: [Q=2,B>=A+1,B>=E] 

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

  with precondition: [Q=4,B=R,B=S,F=U,G=V,H=W,J=X,K=Y,B>=A+1,B>=E] 

* Chain [26]...: 1*s(6)+0
  with precondition: [Q=2,4>=M,B>=A+1,E>=B+1] 

* Chain [25]: 0
  with precondition: [Q=2] 

* Chain [24]: 1*s(7)+0
  with precondition: [Q=2,4>=M,B>=A+1,E>=B+1] 

* Chain [23]: 1*s(8)+0
  Such that:s(8) =< -B+E

  with precondition: [Q=2,M>=5,B>=A+1,E>=B+2] 

* Chain [22]: 0
  with precondition: [Q=2,B>=A+1,E>=B+1] 

* Chain [21]: 0
  with precondition: [Q=4,U=F,V=G,W=H,X=J,Y=K,A=R,B=S,A>=B] 

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

  with precondition: [Q=2,E=B+1,M>=5,E>=A+2] 

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

  with precondition: [Q=4,W=1,X=1,Y=1,E=B+1,E=R,E=S,M>=5,E>=A+2] 

* Chain [19,25]: 1
  with precondition: [Q=2,E=B+1,M>=5,E>=A+2] 

* Chain [18,[17],25]: 1*it(17)+1*s(9)+1
  Such that:it(17) =< -A+E
s(9) =< -B+E

  with precondition: [Q=2,M>=5,B>=A+1,E>=B+2] 

* Chain [18,[17],21]: 1*it(17)+1*s(9)+1
  Such that:it(17) =< -A+S
s(9) =< -B+S

  with precondition: [Q=4,W=1,X=1,Y=1,E=R,E=S,M>=5,B>=A+1,E>=B+2] 

* Chain [18,25]: 1*s(9)+1
  Such that:s(9) =< -B+E

  with precondition: [Q=2,M>=5,B>=A+1,E>=B+2] 


#### Cost of chains of f8_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O):
* Chain [28]: 0
  with precondition: [A=2] 

* Chain [27]: 0
  with precondition: [A=4] 


#### Cost of chains of f15(A,B,C,D,E,F,G,H,I,J,K,L,M,Q):
* Chain [36]: 0
  with precondition: [] 

* Chain [35]: 1*s(23)+1*s(24)+1
  Such that:s(23) =< -A+B
s(24) =< -A+E

  with precondition: [E=B+1,M>=5,E>=A+2] 

* Chain [34]: 1*aux(12)+0
  with precondition: [4>=M,B>=A+1,E>=B+1] 

* Chain [33]: 2*s(29)+4*s(31)+1
  Such that:aux(13) =< -A+E
aux(14) =< -B+E
s(29) =< aux(13)
s(31) =< aux(14)

  with precondition: [M>=5,B>=A+1,E>=B+2] 

* Chain [32]: 0
  with precondition: [B>=A+1,E>=B+1] 

* Chain [31]: 2*s(34)+0
  Such that:aux(15) =< -A+B
s(34) =< aux(15)

  with precondition: [B>=A+1,B>=E] 

* Chain [30]: 0
  with precondition: [A>=B] 

* Chain [29]...: 1*aux(16)+0
  with precondition: [4>=M,B>=A+1,E>=B+1] 


Closed-form bounds of f15(A,B,C,D,E,F,G,H,I,J,K,L,M,Q): 
-------------------------------------
* Chain [36] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [35] with precondition: [E=B+1,M>=5,E>=A+2] 
    - Upper bound: -2*A+B+E+1 
    - Complexity: n 
* Chain [34] with precondition: [4>=M,B>=A+1,E>=B+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [33] with precondition: [M>=5,B>=A+1,E>=B+2] 
    - Upper bound: -2*A-4*B+6*E+1 
    - Complexity: n 
* Chain [32] with precondition: [B>=A+1,E>=B+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [31] with precondition: [B>=A+1,B>=E] 
    - Upper bound: -2*A+2*B 
    - Complexity: n 
* Chain [30] with precondition: [A>=B] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [29]... with precondition: [4>=M,B>=A+1,E>=B+1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f15(A,B,C,D,E,F,G,H,I,J,K,L,M,Q): inf 
Asymptotic class: infinity 
* Total analysis performed in 970 ms.