0.03/0.06	WORST_CASE(?,O(1))  
0.03/0.06	
0.03/0.06	Preprocessing Cost Relations
0.03/0.06	=====================================
0.03/0.06	
0.03/0.06	#### Computed strongly connected components 
0.03/0.06	0. non_recursive  : [f3/3]
0.03/0.06	1. non_recursive  : [f2/3]
0.03/0.06	
0.03/0.06	#### Obtained direct recursion through partial evaluation 
0.03/0.06	0. SCC is completely evaluated into other SCCs
0.03/0.06	1. SCC is partially evaluated into f2/3
0.03/0.06	
0.03/0.06	Control-Flow Refinement of Cost Relations
0.03/0.06	=====================================
0.03/0.06	
0.03/0.06	### Specialization of cost equations f2/3 
0.03/0.06	* CE 1 is refined into CE [3] 
0.03/0.06	* CE 2 is refined into CE [4] 
0.03/0.06	
0.03/0.06	
0.03/0.06	### Cost equations --> "Loop" of f2/3 
0.03/0.06	* CEs [3] --> Loop 3 
0.03/0.06	* CEs [4] --> Loop 4 
0.03/0.06	
0.03/0.06	### Ranking functions of CR f2(A,B,D) 
0.03/0.06	
0.03/0.06	#### Partial ranking functions of CR f2(A,B,D) 
0.03/0.06	
0.03/0.06	
0.03/0.06	Computing Bounds
0.03/0.06	=====================================
0.03/0.06	
0.03/0.06	#### Cost of chains of f2(A,B,D):
0.03/0.06	* Chain [4]: 0
0.03/0.06	  with precondition: [0>=A+1] 
0.03/0.06	
0.03/0.06	* Chain [3]: 0
0.03/0.06	  with precondition: [A>=0] 
0.03/0.06	
0.03/0.06	
0.03/0.06	Closed-form bounds of f2(A,B,D): 
0.03/0.06	-------------------------------------
0.03/0.06	* Chain [4] with precondition: [0>=A+1] 
0.03/0.06	    - Upper bound: 0 
0.03/0.06	    - Complexity: constant 
0.03/0.06	* Chain [3] with precondition: [A>=0] 
0.03/0.06	    - Upper bound: 0 
0.03/0.06	    - Complexity: constant 
0.03/0.06	
0.03/0.06	### Maximum cost of f2(A,B,D): 0 
0.03/0.06	Asymptotic class: constant 
0.03/0.06	* Total analysis performed in 6 ms.
0.03/0.06	
0.03/0.06	EOF