0.03/0.21	MAYBE
0.03/0.21	
0.03/0.21	Preprocessing Cost Relations
0.03/0.21	=====================================
0.03/0.21	
0.03/0.21	#### Computed strongly connected components 
0.03/0.21	0. recursive  : [f4/5,f5/5]
0.03/0.21	1. non_recursive  : [exit_location/1]
0.03/0.21	2. non_recursive  : [f12/3]
0.03/0.21	3. non_recursive  : [f4_loop_cont/4]
0.03/0.21	4. non_recursive  : [f0/3]
0.03/0.21	
0.03/0.21	#### Obtained direct recursion through partial evaluation 
0.03/0.21	0. SCC is partially evaluated into f4/5
0.03/0.21	1. SCC is completely evaluated into other SCCs
0.03/0.21	2. SCC is completely evaluated into other SCCs
0.03/0.21	3. SCC is partially evaluated into f4_loop_cont/4
0.03/0.21	4. SCC is partially evaluated into f0/3
0.03/0.21	
0.03/0.21	Control-Flow Refinement of Cost Relations
0.03/0.21	=====================================
0.03/0.21	
0.03/0.21	### Specialization of cost equations f4/5 
0.03/0.21	* CE 9 is refined into CE [12] 
0.03/0.21	* CE 8 is refined into CE [13] 
0.03/0.21	* CE 4 is discarded (unfeasible) 
0.03/0.21	* CE 6 is refined into CE [14] 
0.03/0.21	* CE 5 is discarded (unfeasible) 
0.03/0.21	* CE 7 is refined into CE [15] 
0.03/0.21	* CE 2 is refined into CE [16] 
0.03/0.21	* CE 3 is refined into CE [17] 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Cost equations --> "Loop" of f4/5 
0.03/0.21	* CEs [14] --> Loop 12 
0.03/0.21	* CEs [15] --> Loop 13 
0.03/0.21	* CEs [16] --> Loop 14 
0.03/0.21	* CEs [17] --> Loop 15 
0.03/0.21	* CEs [12] --> Loop 16 
0.03/0.21	* CEs [13] --> Loop 17 
0.03/0.21	
0.03/0.21	### Ranking functions of CR f4(A,B,D,E,F) 
0.03/0.21	
0.03/0.21	#### Partial ranking functions of CR f4(A,B,D,E,F) 
0.03/0.21	* Partial RF of phase [12,13,14,15]:
0.03/0.21	  - RF of loop [12:1,13:1]:
0.03/0.21	    -B+4 depends on loops [14:1,15:1] 
0.03/0.21	  - RF of loop [14:1,15:1]:
0.03/0.21	    B/3-1 depends on loops [12:1,13:1] 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Specialization of cost equations f4_loop_cont/4 
0.03/0.21	* CE 11 is refined into CE [18] 
0.03/0.21	* CE 10 is refined into CE [19] 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Cost equations --> "Loop" of f4_loop_cont/4 
0.03/0.21	* CEs [18] --> Loop 18 
0.03/0.21	* CEs [19] --> Loop 19 
0.03/0.21	
0.03/0.21	### Ranking functions of CR f4_loop_cont(A,B,C,D) 
0.03/0.21	
0.03/0.21	#### Partial ranking functions of CR f4_loop_cont(A,B,C,D) 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Specialization of cost equations f0/3 
0.03/0.21	* CE 1 is refined into CE [20,21,22,23,24,25] 
0.03/0.21	
0.03/0.21	
0.03/0.21	### Cost equations --> "Loop" of f0/3 
0.03/0.21	* CEs [24,25] --> Loop 20 
0.03/0.21	* CEs [20,21,22,23] --> Loop 21 
0.03/0.21	
0.03/0.21	### Ranking functions of CR f0(A,B,D) 
0.03/0.21	
0.03/0.21	#### Partial ranking functions of CR f0(A,B,D) 
0.03/0.21	
0.03/0.21	
0.03/0.21	Computing Bounds
0.03/0.21	=====================================
0.03/0.21	
0.03/0.21	#### Cost of chains of f4(A,B,D,E,F):
0.03/0.21	* Chain [[12,13,14,15]]...: 4*it(12)+0
0.03/0.21	  with precondition: [4>=B,B>=0] 
0.03/0.21	
0.03/0.21	* Chain [[12,13,14,15],17]: 4*it(12)+0
0.03/0.21	  with precondition: [D=2,E=0,4>=B,4>=F,B>=0,F>=1] 
0.03/0.21	
0.03/0.21	* Chain [[12,13,14,15],16]: 4*it(12)+0
0.03/0.21	  with precondition: [D=3,4>=B,B>=0] 
0.03/0.21	
0.03/0.21	* Chain [17]: 0
0.03/0.21	  with precondition: [A=0,D=2,E=0,B=F,B>=0] 
0.03/0.21	
0.03/0.21	* Chain [16]: 0
0.03/0.21	  with precondition: [D=3,B>=0] 
0.03/0.21	
0.03/0.21	
0.03/0.21	#### Cost of chains of f4_loop_cont(A,B,C,D):
0.03/0.21	* Chain [19]: 0
0.03/0.21	  with precondition: [A=2] 
0.03/0.21	
0.03/0.21	* Chain [18]: 0
0.03/0.21	  with precondition: [A=3] 
0.03/0.21	
0.03/0.21	
0.03/0.21	#### Cost of chains of f0(A,B,D):
0.03/0.21	* Chain [21]: 1*aux(13)+0
0.03/0.21	  with precondition: [] 
0.03/0.21	
0.03/0.21	* Chain [20]...: 1*aux(14)+0
0.03/0.21	  with precondition: [] 
0.03/0.21	
0.03/0.21	
0.03/0.21	Closed-form bounds of f0(A,B,D): 
0.03/0.21	-------------------------------------
0.03/0.21	* Chain [21] with precondition: [] 
0.03/0.21	    - Upper bound: inf 
0.03/0.21	    - Complexity: infinity 
0.03/0.21	* Chain [20]... with precondition: [] 
0.03/0.21	    - Upper bound: inf 
0.03/0.21	    - Complexity: infinity 
0.03/0.21	
0.03/0.21	### Maximum cost of f0(A,B,D): inf 
0.03/0.21	Asymptotic class: infinity 
0.03/0.21	* Total analysis performed in 146 ms.
0.03/0.21	
0.03/0.31	EOF