/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  : [g/5]
1. non_recursive  : [exit_location/1]
2. recursive  : [h/5]
3. recursive  : [i/2]
4. non_recursive  : [i_loop_cont/2]
5. non_recursive  : [h_loop_cont/5]
6. non_recursive  : [g_loop_cont/5]
7. non_recursive  : [f/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into g/5
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into h/5
3. SCC is partially evaluated into i/2
4. SCC is completely evaluated into other SCCs
5. SCC is partially evaluated into h_loop_cont/5
6. SCC is partially evaluated into g_loop_cont/5
7. SCC is partially evaluated into f/4

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

### Specialization of cost equations g/5 
* CE 3 is refined into CE [14] 
* CE 4 is refined into CE [15] 
* CE 2 is refined into CE [16] 


### Cost equations --> "Loop" of g/5 
* CEs [16] --> Loop 14 
* CEs [14] --> Loop 15 
* CEs [15] --> Loop 16 

### Ranking functions of CR g(A,B,D,E,F) 
* RF of phase [14]: [A]

#### Partial ranking functions of CR g(A,B,D,E,F) 
* Partial RF of phase [14]:
  - RF of loop [14:1]:
    A


### Specialization of cost equations h/5 
* CE 8 is refined into CE [17] 
* CE 9 is refined into CE [18] 
* CE 7 is refined into CE [19] 


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

### Ranking functions of CR h(B,C,D,E,F) 
* RF of phase [17]: [B]

#### Partial ranking functions of CR h(B,C,D,E,F) 
* Partial RF of phase [17]:
  - RF of loop [17:1]:
    B


### Specialization of cost equations i/2 
* CE 13 is refined into CE [20] 
* CE 12 is refined into CE [21] 


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

### Ranking functions of CR i(C,D) 
* RF of phase [20]: [C]

#### Partial ranking functions of CR i(C,D) 
* Partial RF of phase [20]:
  - RF of loop [20:1]:
    C


### Specialization of cost equations h_loop_cont/5 
* CE 11 is refined into CE [22,23] 
* CE 10 is refined into CE [24] 


### Cost equations --> "Loop" of h_loop_cont/5 
* CEs [23] --> Loop 22 
* CEs [22] --> Loop 23 
* CEs [24] --> Loop 24 

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

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


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


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

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

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


### Specialization of cost equations f/4 
* CE 1 is refined into CE [32,33,34,35,36,37] 


### Cost equations --> "Loop" of f/4 
* CEs [32,34,35] --> Loop 29 
* CEs [36,37] --> Loop 30 
* CEs [33] --> Loop 31 

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

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


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

#### Cost of chains of g(A,B,D,E,F):
* Chain [[14],16]: 1*it(14)+0
  Such that:it(14) =< A

  with precondition: [D=2,A>=1,B>=1] 

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

  with precondition: [D=4,E=0,A>=1,B>=1,F+2>=2*A+2*B] 

* Chain [16]: 0
  with precondition: [D=2,B>=1] 

* Chain [15]: 0
  with precondition: [D=4,A=E,B=F,0>=A,B>=1] 


#### Cost of chains of h(B,C,D,E,F):
* Chain [[17],19]: 1*it(17)+0
  Such that:it(17) =< B

  with precondition: [D=2,B>=1,C>=1] 

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

  with precondition: [D=3,E=0,B>=1,C>=1,F+2>=2*B+2*C] 

* Chain [19]: 0
  with precondition: [D=2,C>=1] 

* Chain [18]: 0
  with precondition: [D=3,B=E,C=F,0>=B,C>=1] 


#### Cost of chains of i(C,D):
* Chain [[20],21]: 1*it(20)+0
  Such that:it(20) =< C

  with precondition: [D=2,C>=1] 

* Chain [21]: 0
  with precondition: [D=2] 


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

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

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

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


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

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

* Chain [26]: 1
  with precondition: [A=4,D=1,0>=C] 

* Chain [25]: 3*s(3)+1*s(6)+0
  Such that:aux(1) =< C
s(3) =< aux(1)

  with precondition: [A=4,D=1,C>=1] 


#### Cost of chains of f(A,B,C,D):
* Chain [31]: 0
  with precondition: [] 

* Chain [30]: 1*aux(2)+0
  with precondition: [0>=A] 

* Chain [29]: 3*s(10)+4*s(14)+0
  Such that:aux(3) =< A
s(10) =< aux(3)

  with precondition: [A>=1] 


Closed-form bounds of f(A,B,C,D): 
-------------------------------------
* Chain [31] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [30] with precondition: [0>=A] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [29] with precondition: [A>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

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