/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  : [a/7,b/7,cont1/7,start/7]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [stop1/5]
3. non_recursive  : [stop2/5]
4. non_recursive  : [stop3/5]
5. non_recursive  : [start_loop_cont/6]
6. non_recursive  : [start0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into start/7
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 completely evaluated into other SCCs
5. SCC is partially evaluated into start_loop_cont/6
6. SCC is partially evaluated into start0/5

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

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


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

### Ranking functions of CR start(A,B,C,D,F,G,H) 
* RF of phase [11]: [D]

#### Partial ranking functions of CR start(A,B,C,D,F,G,H) 
* Partial RF of phase [11]:
  - RF of loop [11:1]:
    D


### Specialization of cost equations start_loop_cont/6 
* CE 10 is refined into CE [16] 
* CE 9 is refined into CE [17] 
* CE 8 is refined into CE [18] 
* CE 7 is refined into CE [19] 


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

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

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


### Specialization of cost equations start0/5 
* CE 1 is refined into CE [20,21,22,23,24,25,26,27] 


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

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

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


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

#### Cost of chains of start(A,B,C,D,F,G,H):
* Chain [[11],15]: 1*it(11)+0
  Such that:it(11) =< D-H

  with precondition: [F=3,G=1,B>=0,C>=1,H>=0,A>=D,D>=H+2] 

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

  with precondition: [F=4,H=0,B>=0,C>=1,D>=1,G>=0,A>=D] 

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

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

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

  with precondition: [F=5,B>=0,C>=1,D>=1,A>=D] 

* Chain [15]: 0
  with precondition: [C=0,F=3,G=1,D=H+1,B>=0,D>=1,A>=D] 

* Chain [14]: 0
  with precondition: [D=0,F=4,H=0,C=G,A>=0,B>=0,C>=0] 

* Chain [13]: 0
  with precondition: [F=2,D=H+1,0>=G+1,B>=0,C>=1,D>=1,A>=D] 

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


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

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

* Chain [17]: 0
  with precondition: [A=4,B>=0,C>=0] 

* Chain [16]: 0
  with precondition: [A=5,B>=0,C>=0] 


#### Cost of chains of start0(A,B,C,D,F):
* Chain [24]: 0
  with precondition: [A=0,B>=0] 

* Chain [23]: 0
  with precondition: [B=0,A>=1] 

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

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

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

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

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


Closed-form bounds of start0(A,B,C,D,F): 
-------------------------------------
* Chain [24] with precondition: [A=0,B>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23] with precondition: [B=0,A>=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22] with precondition: [A>=0,B>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [21] with precondition: [A>=1,B>=1] 
    - Upper bound: 2*A 
    - Complexity: n 
* Chain [20] with precondition: [A>=2,B>=1] 
    - Upper bound: 2*A 
    - Complexity: n 

### Maximum cost of start0(A,B,C,D,F): 2*A 
Asymptotic class: n 
* Total analysis performed in 212 ms.