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