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  : [f1/5]
0.03/0.12	1. non_recursive  : [exit_location/1]
0.03/0.12	2. non_recursive  : [f3/4]
0.03/0.12	3. non_recursive  : [f1_loop_cont/5]
0.03/0.12	4. non_recursive  : [f2/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 f1/5
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 f1_loop_cont/5
0.03/0.12	4. SCC is partially evaluated into f2/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 f1/5 
0.03/0.12	* CE 5 is refined into CE [8] 
0.03/0.12	* CE 3 is refined into CE [9] 
0.03/0.12	* CE 4 is refined into CE [10] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of f1/5 
0.03/0.12	* CEs [10] --> Loop 7 
0.03/0.12	* CEs [8] --> Loop 8 
0.03/0.12	* CEs [9] --> Loop 9 
0.03/0.12	
0.03/0.12	### Ranking functions of CR f1(A,B,F,G,H) 
0.03/0.12	* RF of phase [7]: [-A+500]
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR f1(A,B,F,G,H) 
0.03/0.12	* Partial RF of phase [7]:
0.03/0.12	  - RF of loop [7:1]:
0.03/0.12	    -A+500
0.03/0.12	
0.03/0.12	
0.03/0.12	### Specialization of cost equations f1_loop_cont/5 
0.03/0.12	* CE 7 is refined into CE [11] 
0.03/0.12	* CE 6 is refined into CE [12] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of f1_loop_cont/5 
0.03/0.12	* CEs [11] --> Loop 10 
0.03/0.12	* CEs [12] --> Loop 11 
0.03/0.12	
0.03/0.12	### Ranking functions of CR f1_loop_cont(A,B,C,D,E) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR f1_loop_cont(A,B,C,D,E) 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Specialization of cost equations f2/4 
0.03/0.12	* CE 1 is refined into CE [13] 
0.03/0.12	* CE 2 is refined into CE [14,15,16,17] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of f2/4 
0.03/0.12	* CEs [13,14,15,16,17] --> Loop 12 
0.03/0.12	
0.03/0.12	### Ranking functions of CR f2(A,B,C,F) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR f2(A,B,C,F) 
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 f1(A,B,F,G,H):
0.03/0.12	* Chain [[7],9]: 1*it(7)+0
0.03/0.12	  Such that:it(7) =< -A+500
0.03/0.12	
0.03/0.12	  with precondition: [F=2,G=500,499>=A] 
0.03/0.12	
0.03/0.12	* Chain [[7],8]: 1*it(7)+0
0.03/0.12	  Such that:it(7) =< -A+500
0.03/0.12	
0.03/0.12	  with precondition: [F=3,499>=A] 
0.03/0.12	
0.03/0.12	* Chain [9]: 0
0.03/0.12	  with precondition: [A=500,F=2,G=500] 
0.03/0.12	
0.03/0.12	* Chain [8]: 0
0.03/0.12	  with precondition: [F=3,500>=A] 
0.03/0.12	
0.03/0.12	
0.03/0.12	#### Cost of chains of f1_loop_cont(A,B,C,D,E):
0.03/0.12	* Chain [11]: 0
0.03/0.12	  with precondition: [A=2,499>=D] 
0.03/0.12	
0.03/0.12	* Chain [10]: 0
0.03/0.12	  with precondition: [A=3,499>=D] 
0.03/0.12	
0.03/0.12	
0.03/0.12	#### Cost of chains of f2(A,B,C,F):
0.03/0.12	* Chain [12]: 1*aux(1)+0
0.03/0.12	  with precondition: [] 
0.03/0.12	
0.03/0.12	
0.03/0.12	Closed-form bounds of f2(A,B,C,F): 
0.03/0.12	-------------------------------------
0.03/0.12	* Chain [12] with precondition: [] 
0.03/0.12	    - Upper bound: inf 
0.03/0.12	    - Complexity: infinity 
0.03/0.12	
0.03/0.12	### Maximum cost of f2(A,B,C,F): inf 
0.03/0.12	Asymptotic class: infinity 
0.03/0.12	* Total analysis performed in 61 ms.
0.03/0.12	
0.03/0.22	EOF