/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  : [evalDis2bb1in/6,evalDis2bb2in/6,evalDis2bb3in/6,evalDis2bbin/6]
1. non_recursive  : [evalDis2stop/4]
2. non_recursive  : [evalDis2returnin/4]
3. non_recursive  : [exit_location/1]
4. non_recursive  : [evalDis2bb3in_loop_cont/5]
5. non_recursive  : [evalDis2entryin/4]
6. non_recursive  : [evalDis2start/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into evalDis2bb3in/6
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 evalDis2bb3in_loop_cont/5
5. SCC is partially evaluated into evalDis2entryin/4
6. SCC is partially evaluated into evalDis2start/4

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

### Specialization of cost equations evalDis2bb3in/6 
* CE 6 is refined into CE [9] 
* CE 5 is refined into CE [10] 
* CE 3 is refined into CE [11] 
* CE 4 is refined into CE [12] 


### Cost equations --> "Loop" of evalDis2bb3in/6 
* CEs [11] --> Loop 9 
* CEs [12] --> Loop 10 
* CEs [9] --> Loop 11 
* CEs [10] --> Loop 12 

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

#### Partial ranking functions of CR evalDis2bb3in(A,B,C,D,E,F) 
* Partial RF of phase [9,10]:
  - RF of loop [9:1]:
    A-C
    B-C depends on loops [10:1] 
  - RF of loop [10:1]:
    A-B
    -B+C+1 depends on loops [9:1] 


### Specialization of cost equations evalDis2bb3in_loop_cont/5 
* CE 8 is refined into CE [13] 
* CE 7 is refined into CE [14] 


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

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

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


### Specialization of cost equations evalDis2entryin/4 
* CE 2 is refined into CE [15,16,17,18] 


### Cost equations --> "Loop" of evalDis2entryin/4 
* CEs [15] --> Loop 15 
* CEs [16,18] --> Loop 16 
* CEs [17] --> Loop 17 

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

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


### Specialization of cost equations evalDis2start/4 
* CE 1 is refined into CE [19,20,21] 


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

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

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


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

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

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

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

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

* Chain [12]: 0
  with precondition: [D=2,E=B,C=F,C>=A] 

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


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

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


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

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

  with precondition: [B>=A+1] 

* Chain [15]: 0
  with precondition: [A>=B] 


#### Cost of chains of evalDis2start(A,B,C,D):
* Chain [20]: 0
  with precondition: [] 

* Chain [19]: 2*s(7)+2*s(8)+0
  Such that:s(5) =< -A+B
s(6) =< B-C
s(7) =< s(5)
s(8) =< s(6)

  with precondition: [B>=A+1] 

* Chain [18]: 0
  with precondition: [A>=B] 


Closed-form bounds of evalDis2start(A,B,C,D): 
-------------------------------------
* Chain [20] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [19] with precondition: [B>=A+1] 
    - Upper bound: -2*A+2*B+nat(B-C)*2 
    - Complexity: n 
* Chain [18] with precondition: [A>=B] 
    - Upper bound: 0 
    - Complexity: constant 

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