/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. non_recursive  : [f10001/5]
1. recursive  : [f120/3]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f120_loop_cont/6]
4. non_recursive  : [f110/5]
5. recursive  : [f12/3]
6. non_recursive  : [f12_loop_cont/6]
7. recursive  : [f2/3]
8. recursive  : [f1200/3]
9. non_recursive  : [f1200_loop_cont/6]
10. non_recursive  : [f2_loop_cont/6]
11. non_recursive  : [f0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f120/3
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f120_loop_cont/6
4. SCC is partially evaluated into f110/5
5. SCC is partially evaluated into f12/3
6. SCC is partially evaluated into f12_loop_cont/6
7. SCC is partially evaluated into f2/3
8. SCC is partially evaluated into f1200/3
9. SCC is partially evaluated into f1200_loop_cont/6
10. SCC is partially evaluated into f2_loop_cont/6
11. SCC is partially evaluated into f0/5

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

### Specialization of cost equations f120/3 
* CE 21 is refined into CE [29] 
* CE 20 is refined into CE [30] 
* CE 19 is refined into CE [31] 


### Cost equations --> "Loop" of f120/3 
* CEs [31] --> Loop 25 
* CEs [29] --> Loop 26 
* CEs [30] --> Loop 27 

### Ranking functions of CR f120(D,E,F) 

#### Partial ranking functions of CR f120(D,E,F) 


### Specialization of cost equations f120_loop_cont/6 
* CE 23 is refined into CE [32] 
* CE 22 is refined into CE [33] 


### Cost equations --> "Loop" of f120_loop_cont/6 
* CEs [32] --> Loop 28 
* CEs [33] --> Loop 29 

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

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


### Specialization of cost equations f110/5 
* CE 5 is refined into CE [34] 
* CE 6 is refined into CE [35,36,37,38] 


### Cost equations --> "Loop" of f110/5 
* CEs [37,38] --> Loop 30 
* CEs [34,35,36] --> Loop 31 

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

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


### Specialization of cost equations f12/3 
* CE 9 is refined into CE [39] 
* CE 8 is refined into CE [40] 
* CE 7 is refined into CE [41] 


### Cost equations --> "Loop" of f12/3 
* CEs [41] --> Loop 32 
* CEs [39] --> Loop 33 
* CEs [40] --> Loop 34 

### Ranking functions of CR f12(D,E,F) 

#### Partial ranking functions of CR f12(D,E,F) 


### Specialization of cost equations f12_loop_cont/6 
* CE 11 is refined into CE [42] 
* CE 10 is refined into CE [43] 


### Cost equations --> "Loop" of f12_loop_cont/6 
* CEs [42] --> Loop 35 
* CEs [43] --> Loop 36 

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

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


### Specialization of cost equations f2/3 
* CE 14 is refined into CE [44] 
* CE 15 is refined into CE [45] 
* CE 13 is refined into CE [46] 
* CE 12 is refined into CE [47] 


### Cost equations --> "Loop" of f2/3 
* CEs [47] --> Loop 37 
* CEs [44] --> Loop 38 
* CEs [45] --> Loop 39 
* CEs [46] --> Loop 40 

### Ranking functions of CR f2(A,E,F) 

#### Partial ranking functions of CR f2(A,E,F) 


### Specialization of cost equations f1200/3 
* CE 26 is refined into CE [48] 
* CE 25 is refined into CE [49] 
* CE 24 is refined into CE [50] 


### Cost equations --> "Loop" of f1200/3 
* CEs [50] --> Loop 41 
* CEs [48] --> Loop 42 
* CEs [49] --> Loop 43 

### Ranking functions of CR f1200(D,E,F) 

#### Partial ranking functions of CR f1200(D,E,F) 


### Specialization of cost equations f1200_loop_cont/6 
* CE 28 is refined into CE [51] 
* CE 27 is refined into CE [52] 


### Cost equations --> "Loop" of f1200_loop_cont/6 
* CEs [51] --> Loop 44 
* CEs [52] --> Loop 45 

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

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


### Specialization of cost equations f2_loop_cont/6 
* CE 18 is refined into CE [53,54,55,56] 
* CE 17 is refined into CE [57] 
* CE 16 is refined into CE [58] 


### Cost equations --> "Loop" of f2_loop_cont/6 
* CEs [53,54] --> Loop 46 
* CEs [57] --> Loop 47 
* CEs [58] --> Loop 48 
* CEs [55,56] --> Loop 49 

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

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


### Specialization of cost equations f0/5 
* CE 1 is refined into CE [59] 
* CE 2 is refined into CE [60,61] 
* CE 3 is refined into CE [62,63,64,65] 
* CE 4 is refined into CE [66,67,68,69,70,71,72,73,74] 


### Cost equations --> "Loop" of f0/5 
* CEs [61,64,65,70,71,72,73,74] --> Loop 50 
* CEs [59,60,62,63,66,67,68,69] --> Loop 51 

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

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


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

#### Cost of chains of f120(D,E,F):
* Chain [[25]]...: 1*it(25)+0
  with precondition: [] 

* Chain [[25],27]: 1*it(25)+0
  with precondition: [E=2,F=1] 

* Chain [[25],26]: 1*it(25)+0
  with precondition: [E=3] 

* Chain [27]: 0
  with precondition: [E=2,F=1] 

* Chain [26]: 0
  with precondition: [E=3] 


#### Cost of chains of f120_loop_cont(A,B,C,D,E,F):
* Chain [29]: 0
  with precondition: [A=2,B=1,C=2] 

* Chain [28]: 0
  with precondition: [A=3,B=1,C=2] 


#### Cost of chains of f110(A,B,C,D,E):
* Chain [31]: 1*aux(3)+0
  with precondition: [A=1,B=1] 

* Chain [30]...: 1*aux(4)+0
  with precondition: [A=1,B=1] 


#### Cost of chains of f12(D,E,F):
* Chain [[32]]...: 1*it(32)+0
  with precondition: [] 

* Chain [[32],34]: 1*it(32)+0
  with precondition: [E=2,F=1] 

* Chain [[32],33]: 1*it(32)+0
  with precondition: [E=3] 

* Chain [34]: 0
  with precondition: [E=2,F=1] 

* Chain [33]: 0
  with precondition: [E=3] 


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

* Chain [35]: 0
  with precondition: [A=3,C=2] 


#### Cost of chains of f2(A,E,F):
* Chain [[37]]...: 1*it(37)+0
  with precondition: [] 

* Chain [[37],40]: 1*it(37)+0
  with precondition: [E=2,A=F] 

* Chain [[37],39]: 1*it(37)+0
  with precondition: [E=3] 

* Chain [[37],38]: 1*it(37)+0
  with precondition: [E=4] 

* Chain [40]: 0
  with precondition: [E=2,F=A] 

* Chain [39]: 0
  with precondition: [E=3] 

* Chain [38]: 0
  with precondition: [E=4] 


#### Cost of chains of f1200(D,E,F):
* Chain [[41]]...: 1*it(41)+0
  with precondition: [] 

* Chain [[41],43]: 1*it(41)+0
  with precondition: [E=2,F=1] 

* Chain [[41],42]: 1*it(41)+0
  with precondition: [E=3] 

* Chain [43]: 0
  with precondition: [E=2,F=1] 

* Chain [42]: 0
  with precondition: [E=3] 


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

* Chain [44]: 0
  with precondition: [A=3,C=2] 


#### Cost of chains of f2_loop_cont(A,B,C,D,E,F):
* Chain [49]...: 1*aux(11)+0
  with precondition: [A=4,C=2] 

* Chain [48]: 0
  with precondition: [A=2,C=2] 

* Chain [47]: 0
  with precondition: [A=3,C=2] 

* Chain [46]: 1*aux(12)+0
  with precondition: [A=4,C=2] 


#### Cost of chains of f0(A,B,C,D,E):
* Chain [51]: 1*aux(13)+0
  with precondition: [] 

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


Closed-form bounds of f0(A,B,C,D,E): 
-------------------------------------
* Chain [51] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [50]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f0(A,B,C,D,E): inf 
Asymptotic class: infinity 
* Total analysis performed in 200 ms.