/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  : [evalEx7bb3in/5,evalEx7bbin/5]
1. non_recursive  : [evalEx7stop/4]
2. non_recursive  : [evalEx7returnin/4]
3. non_recursive  : [exit_location/1]
4. non_recursive  : [evalEx7bb3in_loop_cont/5]
5. non_recursive  : [evalEx7entryin/4]
6. non_recursive  : [evalEx7start/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into evalEx7bb3in/5
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 evalEx7bb3in_loop_cont/5
5. SCC is partially evaluated into evalEx7entryin/4
6. SCC is partially evaluated into evalEx7start/4

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

### Specialization of cost equations evalEx7bb3in/5 
* CE 8 is refined into CE [11] 
* CE 7 is refined into CE [12] 
* CE 4 is refined into CE [13] 
* CE 3 is refined into CE [14] 
* CE 6 is discarded (unfeasible) 
* CE 5 is refined into CE [15] 


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

### Ranking functions of CR evalEx7bb3in(A,B,C,D,E) 
* RF of phase [11]: [B-C+1]
* RF of phase [12]: [A-C,B-C-1]

#### Partial ranking functions of CR evalEx7bb3in(A,B,C,D,E) 
* Partial RF of phase [11]:
  - RF of loop [11:1]:
    B-C+1
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    A-C
    B-C-1


### Specialization of cost equations evalEx7bb3in_loop_cont/5 
* CE 10 is refined into CE [16] 
* CE 9 is refined into CE [17] 


### Cost equations --> "Loop" of evalEx7bb3in_loop_cont/5 
* CEs [16] --> Loop 16 
* CEs [17] --> Loop 17 

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

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


### Specialization of cost equations evalEx7entryin/4 
* CE 2 is refined into CE [18,19,20] 


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

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

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


### Specialization of cost equations evalEx7start/4 
* CE 1 is refined into CE [21] 


### Cost equations --> "Loop" of evalEx7start/4 
* CEs [21] --> Loop 19 

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

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


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

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

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

* Chain [[11],13,[12],15]: 1*it(11)+1*it(12)+1
  Such that:it(11) =< B-C+1
it(12) =< E

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

* Chain [[11],13,[12],14]: 1*it(11)+1*it(12)+1
  Such that:it(12) =< A
it(11) =< B-C+1

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

* Chain [[11],13,14]: 1*it(11)+1
  Such that:it(11) =< B-C+1

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

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


#### Cost of chains of evalEx7bb3in_loop_cont(A,B,C,D,E):
* Chain [17]: 0
  with precondition: [A=2,B>=1,C>=B+1] 

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


#### Cost of chains of evalEx7entryin(A,B,C,D):
* Chain [18]: 4*s(5)+2*s(6)+1
  Such that:aux(2) =< -A+B
aux(3) =< A
s(5) =< aux(2)
s(6) =< aux(3)

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


#### Cost of chains of evalEx7start(A,B,C,D):
* Chain [19]: 4*s(12)+2*s(13)+1
  Such that:s(10) =< -A+B
s(11) =< A
s(12) =< s(10)
s(13) =< s(11)

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


Closed-form bounds of evalEx7start(A,B,C,D): 
-------------------------------------
* Chain [19] with precondition: [A>=1,B>=A+1] 
    - Upper bound: -2*A+4*B+1 
    - Complexity: n 

### Maximum cost of evalEx7start(A,B,C,D): -2*A+4*B+1 
Asymptotic class: n 
* Total analysis performed in 203 ms.