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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [f14/9]
1. recursive  : [f11/21,f14_loop_cont/22]
2. non_recursive  : [exit_location/1]
3. recursive  : [f36/13]
4. recursive  : [f33/25,f36_loop_cont/26]
5. non_recursive  : [f58/18]
6. non_recursive  : [f33_loop_cont/19]
7. non_recursive  : [f11_loop_cont/19]
8. non_recursive  : [f0/18]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f14/9
1. SCC is partially evaluated into f11/21
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f36/13
4. SCC is partially evaluated into f33/25
5. SCC is completely evaluated into other SCCs
6. SCC is partially evaluated into f33_loop_cont/19
7. SCC is partially evaluated into f11_loop_cont/19
8. SCC is partially evaluated into f0/18

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

### Specialization of cost equations f14/9 
* CE 9 is refined into CE [21] 
* CE 10 is refined into CE [22] 
* CE 8 is refined into CE [23] 


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

### Ranking functions of CR f14(A,B,O,P,T,U,V,W,X) 
* RF of phase [21]: [-B+10]

#### Partial ranking functions of CR f14(A,B,O,P,T,U,V,W,X) 
* Partial RF of phase [21]:
  - RF of loop [21:1]:
    -B+10


### Specialization of cost equations f11/21 
* CE 2 is refined into CE [24,25] 
* CE 5 is refined into CE [26] 
* CE 4 is refined into CE [27] 
* CE 3 is refined into CE [28] 


### Cost equations --> "Loop" of f11/21 
* CEs [28] --> Loop 24 
* CEs [24,25] --> Loop 25 
* CEs [26] --> Loop 26 
* CEs [27] --> Loop 27 

### Ranking functions of CR f11(A,B,C,E,F,G,H,O,P,Q,T,U,V,W,X,Y,Z,A1,B1,C1,D1) 
* RF of phase [24]: [-A+10]

#### Partial ranking functions of CR f11(A,B,C,E,F,G,H,O,P,Q,T,U,V,W,X,Y,Z,A1,B1,C1,D1) 
* Partial RF of phase [24]:
  - RF of loop [24:1]:
    -A+10


### Specialization of cost equations f36/13 
* CE 20 is refined into CE [29] 
* CE 19 is refined into CE [30] 
* CE 17 is refined into CE [31] 
* CE 18 is refined into CE [32] 


### Cost equations --> "Loop" of f36/13 
* CEs [31] --> Loop 28 
* CEs [32] --> Loop 29 
* CEs [29] --> Loop 30 
* CEs [30] --> Loop 31 

### Ranking functions of CR f36(C,D,E,F,G,H,T,U,V,W,X,Y,Z) 
* RF of phase [28,29]: [-D+10]

#### Partial ranking functions of CR f36(C,D,E,F,G,H,T,U,V,W,X,Y,Z) 
* Partial RF of phase [28,29]:
  - RF of loop [28:1,29:1]:
    -D+10


### Specialization of cost equations f33/25 
* CE 13 is refined into CE [33] 
* CE 11 is refined into CE [34,35] 
* CE 14 is refined into CE [36] 
* CE 12 is refined into CE [37] 


### Cost equations --> "Loop" of f33/25 
* CEs [37] --> Loop 32 
* CEs [33] --> Loop 33 
* CEs [34,35] --> Loop 34 
* CEs [36] --> Loop 35 

### Ranking functions of CR f33(C,D,E,F,G,H,I,J,K,L,M,N,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 
* RF of phase [32]: [-C+10]

#### Partial ranking functions of CR f33(C,D,E,F,G,H,I,J,K,L,M,N,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1) 
* Partial RF of phase [32]:
  - RF of loop [32:1]:
    -C+10


### Specialization of cost equations f33_loop_cont/19 
* CE 15 is refined into CE [38] 
* CE 16 is refined into CE [39] 


### Cost equations --> "Loop" of f33_loop_cont/19 
* CEs [38] --> Loop 36 
* CEs [39] --> Loop 37 

### Ranking functions of CR f33_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S) 

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


### Specialization of cost equations f11_loop_cont/19 
* CE 6 is refined into CE [40] 
* CE 7 is refined into CE [41,42,43,44,45] 


### Cost equations --> "Loop" of f11_loop_cont/19 
* CEs [40] --> Loop 38 
* CEs [45] --> Loop 39 
* CEs [43] --> Loop 40 
* CEs [42,44] --> Loop 41 
* CEs [41] --> Loop 42 

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

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


### Specialization of cost equations f0/18 
* CE 1 is refined into CE [46,47,48,49,50,51] 


### Cost equations --> "Loop" of f0/18 
* CEs [46,47,48,49,50,51] --> Loop 43 

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

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


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

#### Cost of chains of f14(A,B,O,P,T,U,V,W,X):
* Chain [[21],23]: 1*it(21)+0
  Such that:it(21) =< -B+10

  with precondition: [T=3,9>=A,9>=B,B>=0] 

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

  with precondition: [T=4,V=10,A+1=U,W=X,9>=A,9>=B,B>=0] 

* Chain [23]: 0
  with precondition: [T=3,9>=A,B>=0] 


#### Cost of chains of f11(A,B,C,E,F,G,H,O,P,Q,T,U,V,W,X,Y,Z,A1,B1,C1,D1):
* Chain [[24],27]: 1*it(24)+1*s(3)+0
  Such that:aux(4) =< -A+10
it(24) =< aux(4)
s(3) =< aux(4)*10

  with precondition: [T=2,U=10,V=10,W=0,X=0,Y=0,Z=0,A1=0,D1=1000,B1=C1,9>=A] 

* Chain [[24],26]: 1*it(24)+1*s(3)+0
  Such that:aux(5) =< -A+10
it(24) =< aux(5)
s(3) =< aux(5)*10

  with precondition: [T=3,9>=A,A>=0] 

* Chain [[24],25]: 1*it(24)+1*s(3)+10
  Such that:aux(3) =< -A+9
aux(2) =< -A+10
aux(1) =< aux(2)
it(24) =< aux(2)
aux(1) =< aux(3)
it(24) =< aux(3)
s(3) =< aux(1)*10

  with precondition: [T=3,8>=A,A>=0] 

* Chain [26]: 0
  with precondition: [T=3,A>=0] 

* Chain [25]: 10
  with precondition: [T=3,9>=A,A>=0] 


#### Cost of chains of f36(C,D,E,F,G,H,T,U,V,W,X,Y,Z):
* Chain [[28,29],31]: 2*it(28)+0
  Such that:aux(8) =< -F-H+X+Z
it(28) =< aux(8)

  with precondition: [T=2,V=10,C+1=U,D+X+Z=F+H+10,9>=C,9>=D,D>=0,X>=F,F+10>=D+X] 

* Chain [[28,29],30]: 2*it(28)+0
  Such that:aux(9) =< -D+10
it(28) =< aux(9)

  with precondition: [T=3,9>=C,9>=D,D>=0] 

* Chain [30]: 0
  with precondition: [T=3,9>=C,D>=0] 


#### Cost of chains of f33(C,D,E,F,G,H,I,J,K,L,M,N,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1):
* Chain [[32],35]: 1*it(32)+2*s(12)+0
  Such that:aux(13) =< -C+10
it(32) =< aux(13)
s(13) =< aux(13)*10
s(12) =< s(13)

  with precondition: [T=3,9>=C] 

* Chain [[32],34]: 1*it(32)+2*s(12)+20
  Such that:aux(12) =< -C+9
aux(11) =< -C+10
aux(10) =< aux(11)
it(32) =< aux(11)
aux(10) =< aux(12)
it(32) =< aux(12)
s(13) =< aux(10)*10
s(12) =< s(13)

  with precondition: [T=3,8>=C] 

* Chain [[32],33]: 1*it(32)+2*s(12)+0
  Such that:aux(14) =< -C+10
it(32) =< aux(14)
s(13) =< aux(14)*10
s(12) =< s(13)

  with precondition: [T=5,U=10,V=10,E1=1500,W=A1,X=B1,Y=C1,X+Z+10*C=F+H+100,X+D1+10*C=F+H+100,9>=C,X>=F,F+100>=10*C+X] 

* Chain [35]: 0
  with precondition: [T=3] 

* Chain [34]: 20
  with precondition: [T=3,9>=C] 

* Chain [33]: 0
  with precondition: [T=5,E1=1500,V=D,C=U,E=W,F=X,G=Y,H=Z,E=A1,F=B1,G=C1,H=D1,C>=10] 


#### Cost of chains of f33_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S):
* Chain [37]: 0
  with precondition: [A=3] 

* Chain [36]: 0
  with precondition: [A=5] 


#### 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):
* Chain [42]: 0
  with precondition: [A=2] 

* Chain [41]: 2*s(21)+4*s(23)+20
  Such that:aux(15) =< -D+10
s(21) =< aux(15)
s(22) =< aux(15)*10
s(23) =< s(22)

  with precondition: [A=2,9>=D] 

* Chain [40]: 1*s(31)+2*s(33)+20
  Such that:s(28) =< -D+9
s(29) =< -D+10
s(30) =< s(29)
s(31) =< s(29)
s(30) =< s(28)
s(31) =< s(28)
s(32) =< s(30)*10
s(33) =< s(32)

  with precondition: [A=2,8>=D] 

* Chain [39]: 0
  with precondition: [A=2,D>=10] 

* Chain [38]: 0
  with precondition: [A=3] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T):
* Chain [43]: 1200
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T): 
-------------------------------------
* Chain [43] with precondition: [] 
    - Upper bound: 1200 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,T): 1200 
Asymptotic class: constant 
* Total analysis performed in 787 ms.