0.02/0.10	MAYBE
0.02/0.10	
0.02/0.10	Preprocessing Cost Relations
0.02/0.10	=====================================
0.02/0.10	
0.02/0.10	#### Computed strongly connected components 
0.02/0.10	0. recursive  : [f2/3]
0.02/0.10	1. non_recursive  : [exit_location/1]
0.02/0.10	2. non_recursive  : [f2_loop_cont/2]
0.02/0.10	3. non_recursive  : [f0/3]
0.02/0.10	
0.02/0.10	#### Obtained direct recursion through partial evaluation 
0.02/0.10	0. SCC is partially evaluated into f2/3
0.02/0.10	1. SCC is completely evaluated into other SCCs
0.02/0.10	2. SCC is completely evaluated into other SCCs
0.02/0.10	3. SCC is partially evaluated into f0/3
0.02/0.10	
0.02/0.10	Control-Flow Refinement of Cost Relations
0.02/0.10	=====================================
0.02/0.10	
0.02/0.10	### Specialization of cost equations f2/3 
0.02/0.10	* CE 4 is refined into CE [5] 
0.02/0.10	* CE 3 is refined into CE [6] 
0.02/0.10	* CE 2 is refined into CE [7] 
0.02/0.10	
0.02/0.10	
0.02/0.10	### Cost equations --> "Loop" of f2/3 
0.02/0.10	* CEs [6] --> Loop 5 
0.02/0.10	* CEs [7] --> Loop 6 
0.02/0.10	* CEs [5] --> Loop 7 
0.02/0.10	
0.02/0.10	### Ranking functions of CR f2(A,B,D) 
0.02/0.10	
0.02/0.10	#### Partial ranking functions of CR f2(A,B,D) 
0.02/0.10	* Partial RF of phase [5,6]:
0.02/0.10	  - RF of loop [5:1]:
0.02/0.10	    B
0.02/0.10	  - RF of loop [6:1]:
0.02/0.10	    A depends on loops [5:1] 
0.02/0.10	
0.02/0.10	
0.02/0.10	### Specialization of cost equations f0/3 
0.02/0.10	* CE 1 is refined into CE [8] 
0.02/0.10	
0.02/0.10	
0.02/0.10	### Cost equations --> "Loop" of f0/3 
0.02/0.10	* CEs [8] --> Loop 8 
0.02/0.10	
0.02/0.10	### Ranking functions of CR f0(A,B,D) 
0.02/0.10	
0.02/0.10	#### Partial ranking functions of CR f0(A,B,D) 
0.02/0.10	
0.02/0.10	
0.02/0.10	Computing Bounds
0.02/0.10	=====================================
0.02/0.10	
0.02/0.10	#### Cost of chains of f2(A,B,D):
0.02/0.10	* Chain [[5,6],7]: 1*it(5)+1*it(6)+0
0.02/0.10	  Such that:it(5) =< B
0.02/0.10	
0.02/0.10	  with precondition: [D=2,B>=0] 
0.02/0.10	
0.02/0.10	* Chain [7]: 0
0.02/0.10	  with precondition: [D=2,B>=0] 
0.02/0.10	
0.02/0.10	
0.02/0.10	#### Cost of chains of f0(A,B,D):
0.02/0.10	* Chain [8]: 1*s(3)+1*s(4)+0
0.02/0.10	  Such that:s(3) =< B
0.02/0.10	
0.02/0.10	  with precondition: [B>=1] 
0.02/0.10	
0.02/0.10	
0.02/0.10	Closed-form bounds of f0(A,B,D): 
0.02/0.10	-------------------------------------
0.02/0.10	* Chain [8] with precondition: [B>=1] 
0.02/0.10	    - Upper bound: inf 
0.02/0.10	    - Complexity: infinity 
0.02/0.10	
0.02/0.10	### Maximum cost of f0(A,B,D): inf 
0.02/0.10	Asymptotic class: infinity 
0.02/0.10	* Total analysis performed in 41 ms.
0.02/0.10	
0.02/0.20	EOF