/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. non_recursive  : [exit_location/1]
2. non_recursive  : [f1/3]
3. non_recursive  : [f2_loop_cont/4]
4. non_recursive  : [f300/3]

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

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

### Specialization of cost equations f2/5 
* CE 7 is refined into CE [10] 
* CE 4 is refined into CE [11] 
* CE 2 is refined into CE [12] 
* CE 5 is refined into CE [13] 
* CE 6 is refined into CE [14] 
* CE 3 is refined into CE [15] 


### Cost equations --> "Loop" of f2/5 
* CEs [13] --> Loop 10 
* CEs [14] --> Loop 11 
* CEs [15] --> Loop 12 
* CEs [10] --> Loop 13 
* CEs [11] --> Loop 14 
* CEs [12] --> Loop 15 

### Ranking functions of CR f2(A,B,E,F,G) 
* RF of phase [11]: [A]

#### Partial ranking functions of CR f2(A,B,E,F,G) 
* Partial RF of phase [10,12]:
  - RF of loop [10:1]:
    A-14 depends on loops [12:1] 
* Partial RF of phase [11]:
  - RF of loop [11:1]:
    A


### Specialization of cost equations f2_loop_cont/4 
* CE 9 is refined into CE [16] 
* CE 8 is refined into CE [17] 


### Cost equations --> "Loop" of f2_loop_cont/4 
* CEs [16] --> Loop 16 
* CEs [17] --> Loop 17 

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

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


### Specialization of cost equations f300/3 
* CE 1 is refined into CE [18,19,20,21,22,23,24,25,26,27] 


### Cost equations --> "Loop" of f300/3 
* CEs [26,27] --> Loop 18 
* CEs [20,22,25] --> Loop 19 
* CEs [21] --> Loop 20 
* CEs [19,24] --> Loop 21 
* CEs [18] --> Loop 22 
* CEs [23] --> Loop 23 

### Ranking functions of CR f300(A,B,E) 

#### Partial ranking functions of CR f300(A,B,E) 


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

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

  with precondition: [E=2,F+1=0,13>=A,A>=1] 

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

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

* Chain [[10,12]]...: 2*it(10)+0
  with precondition: [A>=14] 

* Chain [[10,12],[11],14]: 2*it(10)+1*it(11)+0
  Such that:it(11) =< 13

  with precondition: [E=2,F+1=0,A>=14] 

* Chain [[10,12],[11],13]: 2*it(10)+1*it(11)+0
  Such that:it(11) =< 13

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

* Chain [[10,12],15]: 2*it(10)+0
  with precondition: [E=2,0>=F+1,A>=14] 

* Chain [[10,12],14]: 2*it(10)+0
  with precondition: [E=2,F+1=0,A>=14] 

* Chain [[10,12],13]: 2*it(10)+0
  with precondition: [E=3,A>=14] 

* Chain [15]: 0
  with precondition: [A=14,E=2,0>=F+1] 

* Chain [14]: 0
  with precondition: [E=2,A=F+1,0>=A] 

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


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

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


#### Cost of chains of f300(A,B,E):
* Chain [23]: 0
  with precondition: [] 

* Chain [22]: 0
  with precondition: [A=14] 

* Chain [21]: 2*s(7)+0
  Such that:aux(3) =< A
s(7) =< aux(3)

  with precondition: [13>=A,A>=1] 

* Chain [20]: 0
  with precondition: [0>=A] 

* Chain [19]: 1*aux(4)+0
  with precondition: [A>=14] 

* Chain [18]...: 1*aux(5)+0
  with precondition: [A>=14] 


Closed-form bounds of f300(A,B,E): 
-------------------------------------
* Chain [23] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22] with precondition: [A=14] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [21] with precondition: [13>=A,A>=1] 
    - Upper bound: 2*A 
    - Complexity: n 
* Chain [20] with precondition: [0>=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [19] with precondition: [A>=14] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [18]... with precondition: [A>=14] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f300(A,B,E): inf 
Asymptotic class: infinity 
* Total analysis performed in 147 ms.