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  : [f1/4]
0.02/0.10	1. non_recursive  : [exit_location/1]
0.02/0.10	2. non_recursive  : [f1_loop_cont/2]
0.02/0.10	3. non_recursive  : [f0/4]
0.02/0.10	
0.02/0.10	#### Obtained direct recursion through partial evaluation 
0.02/0.10	0. SCC is partially evaluated into f1/4
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/4
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 f1/4 
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 f1/4 
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 f1(A,B,C,D) 
0.02/0.10	
0.02/0.10	#### Partial ranking functions of CR f1(A,B,C,D) 
0.02/0.10	
0.02/0.10	
0.02/0.10	### Specialization of cost equations f0/4 
0.02/0.10	* CE 1 is refined into CE [8,9,10] 
0.02/0.10	
0.02/0.10	
0.02/0.10	### Cost equations --> "Loop" of f0/4 
0.02/0.10	* CEs [10] --> Loop 8 
0.02/0.10	* CEs [9] --> Loop 9 
0.02/0.10	* CEs [8] --> Loop 10 
0.02/0.10	
0.02/0.10	### Ranking functions of CR f0(A,B,C,D) 
0.02/0.10	
0.02/0.10	#### Partial ranking functions of CR f0(A,B,C,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 f1(A,B,C,D):
0.02/0.10	* Chain [[5,6]]...: 2*it(5)+0
0.02/0.10	  with precondition: [A>=B,D=2] 
0.02/0.10	
0.02/0.10	* Chain [[5,6],7]: 2*it(5)+0
0.02/0.11	  with precondition: [D=2,A>=B] 
0.02/0.11	
0.02/0.11	* Chain [7]: 0
0.02/0.11	  with precondition: [D=2] 
0.02/0.11	
0.02/0.11	
0.02/0.11	#### Cost of chains of f0(A,B,C,D):
0.02/0.11	* Chain [10]: 0
0.02/0.11	  with precondition: [] 
0.02/0.11	
0.02/0.11	* Chain [9]: 2*s(1)+0
0.02/0.11	  with precondition: [A>=B] 
0.02/0.11	
0.02/0.11	* Chain [8]...: 2*s(2)+0
0.02/0.11	  with precondition: [A>=B] 
0.02/0.11	
0.02/0.11	
0.02/0.11	Closed-form bounds of f0(A,B,C,D): 
0.02/0.11	-------------------------------------
0.02/0.11	* Chain [10] with precondition: [] 
0.02/0.11	    - Upper bound: 0 
0.02/0.11	    - Complexity: constant 
0.02/0.11	* Chain [9] with precondition: [A>=B] 
0.02/0.11	    - Upper bound: inf 
0.02/0.11	    - Complexity: infinity 
0.02/0.11	* Chain [8]... with precondition: [A>=B] 
0.02/0.11	    - Upper bound: inf 
0.02/0.11	    - Complexity: infinity 
0.02/0.11	
0.02/0.11	### Maximum cost of f0(A,B,C,D): inf 
0.02/0.11	Asymptotic class: infinity 
0.02/0.11	* Total analysis performed in 50 ms.
0.02/0.11	
0.02/0.21	EOF