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