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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [f32/1]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f32_loop_cont/2]
3. non_recursive  : [f24/12]
4. non_recursive  : [f18/12]
5. non_recursive  : [f0/12]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f32/1
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f24/12
4. SCC is partially evaluated into f18/12
5. SCC is partially evaluated into f0/12

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

### Specialization of cost equations f32/1 
* CE 7 is refined into CE [10] 
* CE 6 is refined into CE [11] 


### Cost equations --> "Loop" of f32/1 
* CEs [11] --> Loop 8 
* CEs [10] --> Loop 9 

### Ranking functions of CR f32(O) 

#### Partial ranking functions of CR f32(O) 


### Specialization of cost equations f24/12 
* CE 8 is discarded (unfeasible) 
* CE 9 is refined into CE [12,13] 


### Cost equations --> "Loop" of f24/12 
* CEs [13] --> Loop 10 
* CEs [12] --> Loop 11 

### Ranking functions of CR f24(A,B,C,D,E,F,G,H,I,J,K,O) 

#### Partial ranking functions of CR f24(A,B,C,D,E,F,G,H,I,J,K,O) 


### Specialization of cost equations f18/12 
* CE 5 is refined into CE [14,15] 
* CE 4 is discarded (unfeasible) 


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

### Ranking functions of CR f18(A,B,C,D,E,F,G,H,I,J,K,O) 

#### Partial ranking functions of CR f18(A,B,C,D,E,F,G,H,I,J,K,O) 


### Specialization of cost equations f0/12 
* CE 1 is refined into CE [16,17] 
* CE 2 is refined into CE [18,19] 
* CE 3 is refined into CE [20,21] 


### Cost equations --> "Loop" of f0/12 
* CEs [17,19,21] --> Loop 14 
* CEs [16,18,20] --> Loop 15 

### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,O) 

#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,O) 


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

#### Cost of chains of f32(O):
* Chain [[8]]...: 1*it(8)+0
  with precondition: [O=2] 

* Chain [[8],9]: 1*it(8)+0
  with precondition: [O=2] 

* Chain [9]: 0
  with precondition: [O=2] 


#### Cost of chains of f24(A,B,C,D,E,F,G,H,I,J,K,O):
* Chain [11]: 1*s(2)+0
  with precondition: [A=0,F=C,0>=H] 

* Chain [10]...: 1*s(3)+0
  with precondition: [A=0,F=C,0>=H] 


#### Cost of chains of f18(A,B,C,D,E,F,G,H,I,J,K,O):
* Chain [13]: 1*s(4)+0
  with precondition: [A=1,0>=H] 

* Chain [12]...: 1*s(5)+0
  with precondition: [A=1,0>=H] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,O):
* Chain [15]: 1*aux(2)+0
  with precondition: [] 

* Chain [14]...: 1*aux(3)+0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,O): 
-------------------------------------
* Chain [15] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [14]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,O): inf 
Asymptotic class: infinity 
* Total analysis performed in 79 ms.