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

#### 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/2
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into g_loop_cont/4
5. SCC is partially evaluated into f/3

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

### Specialization of cost equations g/5 
* CE 3 is refined into CE [9] 
* CE 4 is refined into CE [10] 
* CE 2 is refined into CE [11] 


### Cost equations --> "Loop" of g/5 
* CEs [11] --> Loop 9 
* CEs [9] --> Loop 10 
* CEs [10] --> Loop 11 

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

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


### Specialization of cost equations h/2 
* CE 8 is refined into CE [12] 
* CE 7 is refined into CE [13] 


### Cost equations --> "Loop" of h/2 
* CEs [13] --> Loop 12 
* CEs [12] --> Loop 13 

### Ranking functions of CR h(A,C) 
* RF of phase [12]: [A]

#### Partial ranking functions of CR h(A,C) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    A


### Specialization of cost equations g_loop_cont/4 
* CE 6 is refined into CE [14,15] 
* CE 5 is refined into CE [16] 


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

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

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


### Specialization of cost equations f/3 
* CE 1 is refined into CE [17,18,19,20,21,22] 


### Cost equations --> "Loop" of f/3 
* CEs [18,19,20] --> Loop 17 
* CEs [22] --> Loop 18 
* CEs [21] --> Loop 19 
* CEs [17] --> Loop 20 

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

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


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

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

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

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

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

* Chain [11]: 0
  with precondition: [C=2] 

* Chain [10]: 0
  with precondition: [C=3,D=A,B=E,0>=B] 


#### Cost of chains of h(A,C):
* Chain [[12],13]: 1*it(12)+0
  Such that:it(12) =< A

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

* Chain [13]: 0
  with precondition: [C=2] 


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

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

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

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


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

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

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

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

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

  with precondition: [B>=1] 


Closed-form bounds of f(A,B,C): 
-------------------------------------
* Chain [20] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [19] with precondition: [0>=B] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [18] with precondition: [0>=B,A>=1] 
    - Upper bound: A 
    - Complexity: n 
* Chain [17] with precondition: [B>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

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