/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  : [f2/5]
1. recursive  : [f1/3,f2_loop_cont/4]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f1_loop_cont/2]
4. non_recursive  : [f999/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f2/5
1. SCC is partially evaluated into f1/3
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f999/3

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

### Specialization of cost equations f2/5 
* CE 8 is refined into CE [9] 
* CE 7 is refined into CE [10] 
* CE 6 is refined into CE [11] 


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

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

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


### Specialization of cost equations f1/3 
* CE 2 is refined into CE [12,13] 
* CE 5 is refined into CE [14] 
* CE 3 is refined into CE [15,16] 
* CE 4 is refined into CE [17] 


### Cost equations --> "Loop" of f1/3 
* CEs [16] --> Loop 12 
* CEs [17] --> Loop 13 
* CEs [15] --> Loop 14 
* CEs [13] --> Loop 15 
* CEs [12] --> Loop 16 
* CEs [14] --> Loop 17 

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

#### Partial ranking functions of CR f1(A,B,C) 
* Partial RF of phase [12,13,14]:
  - RF of loop [12:1]:
    A-1 depends on loops [13:1] 
    A+B-1
  - RF of loop [13:1,14:1]:
    B depends on loops [12:1] 


### Specialization of cost equations f999/3 
* CE 1 is refined into CE [18,19,20] 


### Cost equations --> "Loop" of f999/3 
* CEs [19,20] --> Loop 18 
* CEs [18] --> Loop 19 

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

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


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

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

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

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

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

* Chain [11]: 0
  with precondition: [C=2,A+1=D,B=E+1,A>=0,B>=1] 

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


#### Cost of chains of f1(A,B,C):
* Chain [[12,13,14],17]: 2*it(12)+2*it(13)+0
  Such that:aux(23) =< A+B
it(12) =< aux(23)

  with precondition: [C=3,A>=1,B>=0,A+B>=2] 

* Chain [[12,13,14],16]: 2*it(12)+2*it(13)+0
  Such that:aux(24) =< A+B
it(12) =< aux(24)

  with precondition: [C=3,A>=1,B>=0,A+B>=2] 

* Chain [[12,13,14],15]: 3*it(12)+2*it(13)+0
  Such that:aux(25) =< A+B
it(12) =< aux(25)

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

* Chain [17]: 0
  with precondition: [C=3,A>=1,B>=0] 

* Chain [16]: 0
  with precondition: [C=3,A>=1,B>=0] 


#### Cost of chains of f999(A,B,C):
* Chain [19]: 0
  with precondition: [A=0,B>=1] 

* Chain [18]: 7*s(12)+6*s(13)+0
  Such that:aux(27) =< B
s(12) =< aux(27)

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


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

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