/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(1))  

Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [f9/5]
1. non_recursive  : [exit_location/1]
2. recursive  : [f17/3]
3. non_recursive  : [f24/4]
4. non_recursive  : [f17_loop_cont/5]
5. non_recursive  : [f9_loop_cont/5]
6. non_recursive  : [f0/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f9/5
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f17/3
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f17_loop_cont/5
5. SCC is partially evaluated into f9_loop_cont/5
6. SCC is partially evaluated into f0/4

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

### Specialization of cost equations f9/5 
* CE 3 is refined into CE [12] 
* CE 4 is refined into CE [13] 
* CE 2 is refined into CE [14] 


### Cost equations --> "Loop" of f9/5 
* CEs [14] --> Loop 12 
* CEs [12] --> Loop 13 
* CEs [13] --> Loop 14 

### Ranking functions of CR f9(A,C,E,F,G) 
* RF of phase [12]: [-C+50]

#### Partial ranking functions of CR f9(A,C,E,F,G) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    -C+50


### Specialization of cost equations f17/3 
* CE 9 is refined into CE [15] 
* CE 8 is refined into CE [16] 
* CE 7 is refined into CE [17] 


### Cost equations --> "Loop" of f17/3 
* CEs [17] --> Loop 15 
* CEs [15] --> Loop 16 
* CEs [16] --> Loop 17 

### Ranking functions of CR f17(A,E,F) 
* RF of phase [15]: [-A+50]

#### Partial ranking functions of CR f17(A,E,F) 
* Partial RF of phase [15]:
  - RF of loop [15:1]:
    -A+50


### Specialization of cost equations f17_loop_cont/5 
* CE 11 is refined into CE [18] 
* CE 10 is refined into CE [19] 


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

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

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


### Specialization of cost equations f9_loop_cont/5 
* CE 6 is refined into CE [20,21,22,23] 
* CE 5 is refined into CE [24] 


### Cost equations --> "Loop" of f9_loop_cont/5 
* CEs [21] --> Loop 20 
* CEs [20,23] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [24] --> Loop 23 

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

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


### Specialization of cost equations f0/4 
* CE 1 is refined into CE [25,26,27,28] 


### Cost equations --> "Loop" of f0/4 
* CEs [25,26,27,28] --> Loop 24 

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

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


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

#### Cost of chains of f9(A,C,E,F,G):
* Chain [[12],14]: 1*it(12)+0
  Such that:it(12) =< -C+50

  with precondition: [A=0,E=3,49>=C,C>=0] 

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

  with precondition: [A=0,E=4,F=0,G=50,49>=C,C>=0] 

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


#### Cost of chains of f17(A,E,F):
* Chain [[15],17]: 1*it(15)+0
  Such that:it(15) =< -A+50

  with precondition: [E=2,F=50,49>=A] 

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

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

* Chain [17]: 0
  with precondition: [E=2,A=F,A>=50] 

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


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

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


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

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

* Chain [21]: 2*s(1)+0
  Such that:aux(1) =< -B+50
s(1) =< aux(1)

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

* Chain [20]: 0
  with precondition: [A=4,B>=50] 


#### Cost of chains of f0(A,B,C,E):
* Chain [24]: 250
  with precondition: [] 


Closed-form bounds of f0(A,B,C,E): 
-------------------------------------
* Chain [24] with precondition: [] 
    - Upper bound: 250 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,E): 250 
Asymptotic class: constant 
* Total analysis performed in 110 ms.