/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  : [l2/9]
1. recursive  : [l1/9,l2_loop_cont/10]
2. non_recursive  : [exit_location/1]
3. recursive  : [l3/2]
4. non_recursive  : [l3_loop_cont/2]
5. non_recursive  : [l1_loop_cont/6]
6. non_recursive  : [l0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into l2/9
1. SCC is partially evaluated into l1/9
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into l3/2
4. SCC is completely evaluated into other SCCs
5. SCC is partially evaluated into l1_loop_cont/6
6. SCC is partially evaluated into l0/5

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

### Specialization of cost equations l2/9 
* CE 10 is refined into CE [13] 
* CE 9 is refined into CE [14] 
* CE 8 is refined into CE [15] 


### Cost equations --> "Loop" of l2/9 
* CEs [15] --> Loop 13 
* CEs [13] --> Loop 14 
* CEs [14] --> Loop 15 

### Ranking functions of CR l2(A,B,C,D,E,F,G,H,I) 
* RF of phase [13]: [B-C]

#### Partial ranking functions of CR l2(A,B,C,D,E,F,G,H,I) 
* Partial RF of phase [13]:
  - RF of loop [13:1]:
    B-C


### Specialization of cost equations l1/9 
* CE 4 is refined into CE [16] 
* CE 2 is refined into CE [17,18] 
* CE 5 is refined into CE [19] 
* CE 3 is refined into CE [20] 


### Cost equations --> "Loop" of l1/9 
* CEs [20] --> Loop 16 
* CEs [16] --> Loop 17 
* CEs [17,18] --> Loop 18 
* CEs [19] --> Loop 19 

### Ranking functions of CR l1(A,B,C,D,E,F,G,H,I) 
* RF of phase [16]: [B]

#### Partial ranking functions of CR l1(A,B,C,D,E,F,G,H,I) 
* Partial RF of phase [16]:
  - RF of loop [16:1]:
    B


### Specialization of cost equations l3/2 
* CE 12 is refined into CE [21] 
* CE 11 is refined into CE [22] 


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

### Ranking functions of CR l3(A,E) 
* RF of phase [20]: [A]

#### Partial ranking functions of CR l3(A,E) 
* Partial RF of phase [20]:
  - RF of loop [20:1]:
    A


### Specialization of cost equations l1_loop_cont/6 
* CE 7 is refined into CE [23,24] 
* CE 6 is refined into CE [25] 


### Cost equations --> "Loop" of l1_loop_cont/6 
* CEs [24] --> Loop 22 
* CEs [23] --> Loop 23 
* CEs [25] --> Loop 24 

### Ranking functions of CR l1_loop_cont(A,B,C,D,E,F) 

#### Partial ranking functions of CR l1_loop_cont(A,B,C,D,E,F) 


### Specialization of cost equations l0/5 
* CE 1 is refined into CE [26,27,28,29,30,31] 


### Cost equations --> "Loop" of l0/5 
* CEs [28] --> Loop 25 
* CEs [27,29,30] --> Loop 26 
* CEs [31] --> Loop 27 
* CEs [26] --> Loop 28 

### Ranking functions of CR l0(A,B,C,D,E) 

#### Partial ranking functions of CR l0(A,B,C,D,E) 


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

#### Cost of chains of l2(A,B,C,D,E,F,G,H,I):
* Chain [[13],15]: 1*it(13)+0
  Such that:it(13) =< B-C

  with precondition: [E=2,B=G+1,B=H,A+I=F,B>=C+1] 

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

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

* Chain [14]: 0
  with precondition: [E=3,B>=C] 


#### Cost of chains of l1(A,B,C,D,E,F,G,H,I):
* Chain [[16],19]: 1*it(16)+1*s(3)+0
  Such that:aux(3) =< B
it(16) =< aux(3)
s(3) =< it(16)*aux(3)

  with precondition: [E=3,B>=1] 

* Chain [[16],18]: 2*it(16)+1*s(3)+0
  Such that:aux(4) =< B
it(16) =< aux(4)
s(3) =< it(16)*aux(4)

  with precondition: [E=3,B>=2] 

* Chain [[16],17]: 1*it(16)+1*s(3)+0
  Such that:aux(5) =< B
it(16) =< aux(5)
s(3) =< it(16)*aux(5)

  with precondition: [E=4,G=0,H=1,B>=1] 

* Chain [19]: 0
  with precondition: [E=3] 

* Chain [18]: 1*s(4)+0
  Such that:s(4) =< B

  with precondition: [E=3,B>=1] 

* Chain [17]: 0
  with precondition: [E=4,F=A,H=C,I=D,B=G,0>=B] 


#### Cost of chains of l3(A,E):
* Chain [[20],21]: 1*it(20)+0
  Such that:it(20) =< A

  with precondition: [E=3,A>=1] 

* Chain [21]: 0
  with precondition: [E=3] 


#### Cost of chains of l1_loop_cont(A,B,C,D,E,F):
* Chain [24]: 0
  with precondition: [A=3] 

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

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

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


#### Cost of chains of l0(A,B,C,D,E):
* Chain [28]: 0
  with precondition: [] 

* Chain [27]: 0
  with precondition: [0>=B] 

* Chain [26]: 4*s(11)+3*s(12)+1*s(19)+0
  Such that:aux(7) =< B
s(11) =< aux(7)
s(12) =< s(11)*aux(7)

  with precondition: [B>=1] 

* Chain [25]: 2*s(21)+1*s(22)+0
  Such that:s(20) =< B
s(21) =< s(20)
s(22) =< s(21)*s(20)

  with precondition: [B>=2] 


Closed-form bounds of l0(A,B,C,D,E): 
-------------------------------------
* Chain [28] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [27] with precondition: [0>=B] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [26] with precondition: [B>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [25] with precondition: [B>=2] 
    - Upper bound: 2*B+B*B 
    - Complexity: n^2 

### Maximum cost of l0(A,B,C,D,E): inf 
Asymptotic class: infinity 
* Total analysis performed in 232 ms.