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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. recursive  : [evalfbb1in/4,evalfbbin/4]
1. non_recursive  : [evalfstop/3]
2. non_recursive  : [evalfreturnin/3]
3. non_recursive  : [exit_location/1]
4. non_recursive  : [evalfbb1in_loop_cont/4]
5. non_recursive  : [evalfentryin/3]
6. non_recursive  : [evalfstart/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into evalfbb1in/4
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into evalfbb1in_loop_cont/4
5. SCC is partially evaluated into evalfentryin/3
6. SCC is partially evaluated into evalfstart/3

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

### Specialization of cost equations evalfbb1in/4 
* CE 5 is refined into CE [8] 
* CE 4 is refined into CE [9] 
* CE 3 is refined into CE [10] 


### Cost equations --> "Loop" of evalfbb1in/4 
* CEs [10] --> Loop 8 
* CEs [8] --> Loop 9 
* CEs [9] --> Loop 10 

### Ranking functions of CR evalfbb1in(A,B,C,D) 
* RF of phase [8]: [A-B+1]

#### Partial ranking functions of CR evalfbb1in(A,B,C,D) 
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    A-B+1


### Specialization of cost equations evalfbb1in_loop_cont/4 
* CE 7 is refined into CE [11] 
* CE 6 is refined into CE [12] 


### Cost equations --> "Loop" of evalfbb1in_loop_cont/4 
* CEs [11] --> Loop 11 
* CEs [12] --> Loop 12 

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

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


### Specialization of cost equations evalfentryin/3 
* CE 2 is refined into CE [13,14,15,16] 


### Cost equations --> "Loop" of evalfentryin/3 
* CEs [14] --> Loop 13 
* CEs [13,16] --> Loop 14 
* CEs [15] --> Loop 15 

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

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


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


### Cost equations --> "Loop" of evalfstart/3 
* CEs [19] --> Loop 16 
* CEs [18] --> Loop 17 
* CEs [17] --> Loop 18 

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

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


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

#### Cost of chains of evalfbb1in(A,B,C,D):
* Chain [[8],10]: 1*it(8)+0
  Such that:it(8) =< A-B+1

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

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

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

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

* Chain [9]: 0
  with precondition: [C=3] 


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

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


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

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

  with precondition: [B>=A] 

* Chain [13]: 0
  with precondition: [A>=B+1] 


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

* Chain [17]: 2*s(4)+0
  Such that:s(3) =< -A+B+1
s(4) =< s(3)

  with precondition: [B>=A] 

* Chain [16]: 0
  with precondition: [A>=B+1] 


Closed-form bounds of evalfstart(A,B,C): 
-------------------------------------
* Chain [18] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [17] with precondition: [B>=A] 
    - Upper bound: -2*A+2*B+2 
    - Complexity: n 
* Chain [16] with precondition: [A>=B+1] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of evalfstart(A,B,C): nat(-A+B+1)*2 
Asymptotic class: n 
* Total analysis performed in 66 ms.