/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  : [f13/37]
1. non_recursive  : [exit_location/1]
2. recursive  : [f54/1]
3. non_recursive  : [f54_loop_cont/2]
4. non_recursive  : [f47/24]
5. non_recursive  : [f39/24]
6. non_recursive  : [f13_loop_cont/25]
7. non_recursive  : [f0/24]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f13/37
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f54/1
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f47/24
5. SCC is partially evaluated into f39/24
6. SCC is partially evaluated into f13_loop_cont/25
7. SCC is partially evaluated into f0/24

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

### Specialization of cost equations f13/37 
* CE 8 is refined into CE [19] 
* CE 5 is refined into CE [20] 
* CE 6 is refined into CE [21] 
* CE 4 is refined into CE [22] 
* CE 3 is refined into CE [23] 
* CE 7 is refined into CE [24] 


### Cost equations --> "Loop" of f13/37 
* CEs [24] --> Loop 18 
* CEs [19] --> Loop 19 
* CEs [20] --> Loop 20 
* CEs [21] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [23] --> Loop 23 

### Ranking functions of CR f13(A,B,C,E,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1) 
* RF of phase [18]: [-A+B]

#### Partial ranking functions of CR f13(A,B,C,E,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1) 
* Partial RF of phase [18]:
  - RF of loop [18:1]:
    -A+B


### Specialization of cost equations f54/1 
* CE 18 is refined into CE [25] 
* CE 17 is refined into CE [26] 


### Cost equations --> "Loop" of f54/1 
* CEs [26] --> Loop 24 
* CEs [25] --> Loop 25 

### Ranking functions of CR f54(C1) 

#### Partial ranking functions of CR f54(C1) 


### Specialization of cost equations f47/24 
* CE 12 is refined into CE [27,28] 
* CE 13 is refined into CE [29,30] 


### Cost equations --> "Loop" of f47/24 
* CEs [28] --> Loop 26 
* CEs [30] --> Loop 27 
* CEs [27] --> Loop 28 
* CEs [29] --> Loop 29 

### Ranking functions of CR f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,C1) 

#### Partial ranking functions of CR f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,C1) 


### Specialization of cost equations f39/24 
* CE 14 is refined into CE [31,32,33,34] 
* CE 15 is refined into CE [35,36,37,38] 
* CE 16 is refined into CE [39,40,41,42] 


### Cost equations --> "Loop" of f39/24 
* CEs [34] --> Loop 30 
* CEs [33] --> Loop 31 
* CEs [38] --> Loop 32 
* CEs [37] --> Loop 33 
* CEs [42] --> Loop 34 
* CEs [41] --> Loop 35 
* CEs [32] --> Loop 36 
* CEs [31] --> Loop 37 
* CEs [36] --> Loop 38 
* CEs [35] --> Loop 39 
* CEs [40] --> Loop 40 
* CEs [39] --> Loop 41 

### Ranking functions of CR f39(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,C1) 

#### Partial ranking functions of CR f39(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,C1) 


### Specialization of cost equations f13_loop_cont/25 
* CE 11 is refined into CE [43] 
* CE 10 is refined into CE [44,45,46,47,48,49,50,51,52,53,54,55] 
* CE 9 is refined into CE [56,57,58,59] 


### Cost equations --> "Loop" of f13_loop_cont/25 
* CEs [55] --> Loop 42 
* CEs [54] --> Loop 43 
* CEs [53] --> Loop 44 
* CEs [52] --> Loop 45 
* CEs [51] --> Loop 46 
* CEs [50] --> Loop 47 
* CEs [59] --> Loop 48 
* CEs [58] --> Loop 49 
* CEs [43] --> Loop 50 
* CEs [49] --> Loop 51 
* CEs [48] --> Loop 52 
* CEs [47] --> Loop 53 
* CEs [46] --> Loop 54 
* CEs [45] --> Loop 55 
* CEs [44] --> Loop 56 
* CEs [57] --> Loop 57 
* CEs [56] --> Loop 58 

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

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


### Specialization of cost equations f0/24 
* CE 1 is refined into CE [60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81] 
* CE 2 is refined into CE [82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103] 


### Cost equations --> "Loop" of f0/24 
* CEs [66,88] --> Loop 59 
* CEs [62,74,76,77,84,96,98,99] --> Loop 60 
* CEs [60,64,68,70,71,81,82,86,90,92,93,103] --> Loop 61 
* CEs [80,102] --> Loop 62 
* CEs [67,89] --> Loop 63 
* CEs [63,75,78,79,85,97,100,101] --> Loop 64 
* CEs [61,65,69,72,73,83,87,91,94,95] --> Loop 65 

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

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


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

#### Cost of chains of f13(A,B,C,E,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1):
* Chain [[18],23]: 1*it(18)+0
  Such that:it(18) =< -A+B

  with precondition: [C1=2,E1=1,Q1=1,R1=1,S1=1,T1=0,B=D1,E=J1,F1=K1,F1=L1,F1=M1,F1=N1,R=O1,R=P1,0>=F1,B>=A+1] 

* Chain [[18],22]: 1*it(18)+0
  Such that:it(18) =< -A+D1

  with precondition: [C1=2,E1=1,Q1=1,R1=1,S1=1,T1=0,E=J1,F1=K1,F1=L1,F1=M1,R=O1,R=P1,0>=N1,F1>=1,D1>=A+1,B>=D1+1] 

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

  with precondition: [C1=3,P1=0,T1=0,E=J1,F1=K1,F1=L1,F1=M1,F1=N1,R=O1,E1=Q1,E1=R1,E1=S1,0>=E1,0>=F1,D1>=A+1,B>=D1+1] 

* Chain [[18],20]: 1*it(18)+0
  Such that:it(18) =< -A+D1

  with precondition: [C1=3,P1=0,T1=0,E=J1,F1=K1,F1=L1,F1=M1,F1=N1,R=O1,E1=Q1,E1=R1,E1=S1,0>=F1,E1>=2,D1>=A+1,B>=D1+1] 

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

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

* Chain [23]: 0
  with precondition: [C1=2,E1=C,F1=H,G1=I,H1=J,I1=K,J1=L,K1=M,L1=N,M1=O,N1=P,O1=Q,P1=R,Q1=S,R1=T,S1=U,T1=V,A=D1,A>=B] 

* Chain [22]: 0
  with precondition: [C1=2,E1=C,J1=E,N1=P,O1=Q,P1=R,Q1=S,R1=T,S1=U,T1=V,A=D1,F1=K1,F1=L1,F1=M1,F1>=1,B>=A+1] 

* Chain [21]: 0
  with precondition: [C1=3,P1=0,T1=0,J1=E,O1=R,A=D1,F1=K1,F1=L1,F1=M1,F1=N1,E1=Q1,E1=R1,E1=S1,0>=E1,0>=F1,B>=A+1] 

* Chain [20]: 0
  with precondition: [C1=3,P1=0,T1=0,J1=E,O1=R,A=D1,F1=K1,F1=L1,F1=M1,F1=N1,E1=Q1,E1=R1,E1=S1,0>=F1,E1>=2,B>=A+1] 

* Chain [19]: 0
  with precondition: [C1=4] 


#### Cost of chains of f54(C1):
* Chain [[24]]...: 1*it(24)+0
  with precondition: [C1=4] 

* Chain [[24],25]: 1*it(24)+0
  with precondition: [C1=4] 

* Chain [25]: 0
  with precondition: [C1=4] 


#### Cost of chains of f47(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,C1):
* Chain [29]: 1*s(2)+0
  with precondition: [F=0,W=0,0>=D] 

* Chain [28]: 1*s(3)+0
  with precondition: [F=0,W=0,D>=1] 

* Chain [27]...: 1*s(4)+0
  with precondition: [F=0,W=0,0>=D] 

* Chain [26]...: 1*s(5)+0
  with precondition: [F=0,W=0,D>=1] 


#### Cost of chains of f39(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,C1):
* Chain [41]: 1*s(6)+0
  with precondition: [C=2,F=0,W=0,0>=D] 

* Chain [40]: 1*s(7)+0
  with precondition: [C=2,F=0,W=0,D>=1] 

* Chain [39]: 1*s(8)+0
  with precondition: [F=0,W=0,1>=C,0>=D] 

* Chain [38]: 1*s(9)+0
  with precondition: [F=0,W=0,1>=C,D>=1] 

* Chain [37]: 1*s(10)+0
  with precondition: [F=0,W=0,0>=D,C>=3] 

* Chain [36]: 1*s(11)+0
  with precondition: [F=0,W=0,C>=3,D>=1] 

* Chain [35]...: 1*s(12)+0
  with precondition: [C=2,F=0,W=0,0>=D] 

* Chain [34]...: 1*s(13)+0
  with precondition: [C=2,F=0,W=0,D>=1] 

* Chain [33]...: 1*s(14)+0
  with precondition: [F=0,W=0,1>=C,0>=D] 

* Chain [32]...: 1*s(15)+0
  with precondition: [F=0,W=0,1>=C,D>=1] 

* Chain [31]...: 1*s(16)+0
  with precondition: [F=0,W=0,0>=D,C>=3] 

* Chain [30]...: 1*s(17)+0
  with precondition: [F=0,W=0,C>=3,D>=1] 


#### Cost of chains of f13_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):
* Chain [58]: 1*s(18)+0
  with precondition: [A=2,G=0,X=0,0>=E] 

* Chain [57]: 1*s(19)+0
  with precondition: [A=2,G=0,X=0,E>=1] 

* Chain [56]: 1*s(20)+0
  with precondition: [A=3,D=2,G=0,X=0,0>=E] 

* Chain [55]: 1*s(21)+0
  with precondition: [A=3,D=2,G=0,X=0,E>=1] 

* Chain [54]: 1*s(22)+0
  with precondition: [A=3,G=0,X=0,1>=D,0>=E] 

* Chain [53]: 1*s(23)+0
  with precondition: [A=3,G=0,X=0,1>=D,E>=1] 

* Chain [52]: 1*s(24)+0
  with precondition: [A=3,G=0,X=0,0>=E,D>=3] 

* Chain [51]: 1*s(25)+0
  with precondition: [A=3,G=0,X=0,D>=3,E>=1] 

* Chain [50]: 0
  with precondition: [A=4,G=0,X=0] 

* Chain [49]...: 1*s(26)+0
  with precondition: [A=2,G=0,X=0,0>=E] 

* Chain [48]...: 1*s(27)+0
  with precondition: [A=2,G=0,X=0,E>=1] 

* Chain [47]...: 1*s(28)+0
  with precondition: [A=3,D=2,G=0,X=0,0>=E] 

* Chain [46]...: 1*s(29)+0
  with precondition: [A=3,D=2,G=0,X=0,E>=1] 

* Chain [45]...: 1*s(30)+0
  with precondition: [A=3,G=0,X=0,1>=D,0>=E] 

* Chain [44]...: 1*s(31)+0
  with precondition: [A=3,G=0,X=0,1>=D,E>=1] 

* Chain [43]...: 1*s(32)+0
  with precondition: [A=3,G=0,X=0,0>=E,D>=3] 

* Chain [42]...: 1*s(33)+0
  with precondition: [A=3,G=0,X=0,D>=3,E>=1] 


#### 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,C1):
* Chain [65]...: 2*s(34)+10*s(35)+0
  Such that:aux(2) =< -A+B
s(34) =< aux(2)

  with precondition: [B>=A+1] 

* Chain [64]...: 8*s(46)+8*s(47)+0
  Such that:aux(3) =< -A+B
s(46) =< aux(3)

  with precondition: [B>=A+2] 

* Chain [63]...: 1*aux(4)+0
  with precondition: [A>=B] 

* Chain [62]: 0
  with precondition: [] 

* Chain [61]: 4*s(64)+10*s(65)+0
  Such that:aux(5) =< -A+B
s(64) =< aux(5)

  with precondition: [B>=A+1] 

* Chain [60]: 8*s(78)+8*s(79)+0
  Such that:aux(6) =< -A+B
s(78) =< aux(6)

  with precondition: [B>=A+2] 

* Chain [59]: 1*aux(7)+0
  with precondition: [A>=B] 


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,C1): 
-------------------------------------
* Chain [65]... with precondition: [B>=A+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [64]... with precondition: [B>=A+2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [63]... with precondition: [A>=B] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [62] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [61] with precondition: [B>=A+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [60] with precondition: [B>=A+2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [59] with precondition: [A>=B] 
    - 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,C1): inf 
Asymptotic class: infinity 
* Total analysis performed in 1890 ms.