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