0.03/0.17	MAYBE
0.03/0.17	
0.03/0.17	Preprocessing Cost Relations
0.03/0.17	=====================================
0.03/0.17	
0.03/0.17	#### Computed strongly connected components 
0.03/0.17	0. recursive  : [f3/5]
0.03/0.17	1. non_recursive  : [exit_location/1]
0.03/0.17	2. non_recursive  : [f12/3]
0.03/0.17	3. non_recursive  : [f3_loop_cont/4]
0.03/0.17	4. non_recursive  : [f0/3]
0.03/0.17	
0.03/0.17	#### Obtained direct recursion through partial evaluation 
0.03/0.17	0. SCC is partially evaluated into f3/5
0.03/0.17	1. SCC is completely evaluated into other SCCs
0.03/0.17	2. SCC is completely evaluated into other SCCs
0.03/0.17	3. SCC is partially evaluated into f3_loop_cont/4
0.03/0.17	4. SCC is partially evaluated into f0/3
0.03/0.17	
0.03/0.17	Control-Flow Refinement of Cost Relations
0.03/0.17	=====================================
0.03/0.17	
0.03/0.17	### Specialization of cost equations f3/5 
0.03/0.17	* CE 6 is refined into CE [9] 
0.03/0.17	* CE 5 is refined into CE [10] 
0.03/0.17	* CE 3 is refined into CE [11] 
0.03/0.17	* CE 4 is refined into CE [12] 
0.03/0.17	* CE 2 is refined into CE [13] 
0.03/0.17	
0.03/0.17	
0.03/0.17	### Cost equations --> "Loop" of f3/5 
0.03/0.17	* CEs [11] --> Loop 9 
0.03/0.17	* CEs [12] --> Loop 10 
0.03/0.17	* CEs [13] --> Loop 11 
0.03/0.17	* CEs [9] --> Loop 12 
0.03/0.17	* CEs [10] --> Loop 13 
0.03/0.17	
0.03/0.17	### Ranking functions of CR f3(A,B,D,E,F) 
0.03/0.17	* RF of phase [10]: [-A+10]
0.03/0.17	
0.03/0.17	#### Partial ranking functions of CR f3(A,B,D,E,F) 
0.03/0.17	* Partial RF of phase [9,11]:
0.03/0.17	  - RF of loop [9:1]:
0.03/0.17	    -A+5 depends on loops [11:1] 
0.03/0.17	* Partial RF of phase [10]:
0.03/0.17	  - RF of loop [10:1]:
0.03/0.17	    -A+10
0.03/0.17	
0.03/0.17	
0.03/0.17	### Specialization of cost equations f3_loop_cont/4 
0.03/0.17	* CE 8 is refined into CE [14] 
0.03/0.17	* CE 7 is refined into CE [15] 
0.03/0.17	
0.03/0.17	
0.03/0.17	### Cost equations --> "Loop" of f3_loop_cont/4 
0.03/0.17	* CEs [14] --> Loop 14 
0.03/0.17	* CEs [15] --> Loop 15 
0.03/0.17	
0.03/0.17	### Ranking functions of CR f3_loop_cont(A,B,C,D) 
0.03/0.17	
0.03/0.17	#### Partial ranking functions of CR f3_loop_cont(A,B,C,D) 
0.03/0.17	
0.03/0.17	
0.03/0.17	### Specialization of cost equations f0/3 
0.03/0.17	* CE 1 is refined into CE [16,17,18,19,20,21] 
0.03/0.17	
0.03/0.17	
0.03/0.17	### Cost equations --> "Loop" of f0/3 
0.03/0.17	* CEs [20,21] --> Loop 16 
0.03/0.17	* CEs [16,17,18,19] --> Loop 17 
0.03/0.17	
0.03/0.17	### Ranking functions of CR f0(A,B,D) 
0.03/0.17	
0.03/0.17	#### Partial ranking functions of CR f0(A,B,D) 
0.03/0.17	
0.03/0.17	
0.03/0.17	Computing Bounds
0.03/0.17	=====================================
0.03/0.17	
0.03/0.17	#### Cost of chains of f3(A,B,D,E,F):
0.03/0.17	* Chain [[9,11]]...: 2*it(9)+0
0.03/0.17	  with precondition: [5>=A] 
0.03/0.17	
0.03/0.17	* Chain [[9,11],[10],13]: 2*it(9)+1*it(10)+0
0.03/0.17	  Such that:it(10) =< 4
0.03/0.17	
0.03/0.17	  with precondition: [D=2,E=10,F=9,5>=A] 
0.03/0.17	
0.03/0.17	* Chain [[9,11],[10],12]: 2*it(9)+1*it(10)+0
0.03/0.17	  Such that:it(10) =< 4
0.03/0.17	
0.03/0.17	  with precondition: [D=3,5>=A] 
0.03/0.17	
0.03/0.17	* Chain [[9,11],13]: 2*it(9)+0
0.03/0.17	  with precondition: [D=2,5>=A,E>=10] 
0.03/0.17	
0.03/0.17	* Chain [[9,11],12]: 2*it(9)+0
0.03/0.17	  with precondition: [D=3,5>=A] 
0.03/0.17	
0.03/0.17	* Chain [12]: 0
0.03/0.17	  with precondition: [D=3] 
0.03/0.17	
0.03/0.17	
0.03/0.17	#### Cost of chains of f3_loop_cont(A,B,C,D):
0.03/0.17	* Chain [15]: 0
0.03/0.17	  with precondition: [A=2] 
0.03/0.17	
0.03/0.17	* Chain [14]: 0
0.03/0.17	  with precondition: [A=3] 
0.03/0.17	
0.03/0.17	
0.03/0.17	#### Cost of chains of f0(A,B,D):
0.03/0.17	* Chain [17]: 1*aux(2)+0
0.03/0.17	  with precondition: [] 
0.03/0.17	
0.03/0.17	* Chain [16]...: 1*aux(3)+0
0.03/0.17	  with precondition: [] 
0.03/0.17	
0.03/0.17	
0.03/0.17	Closed-form bounds of f0(A,B,D): 
0.03/0.17	-------------------------------------
0.03/0.17	* Chain [17] with precondition: [] 
0.03/0.17	    - Upper bound: inf 
0.03/0.17	    - Complexity: infinity 
0.03/0.17	* Chain [16]... with precondition: [] 
0.03/0.17	    - Upper bound: inf 
0.03/0.17	    - Complexity: infinity 
0.03/0.17	
0.03/0.17	### Maximum cost of f0(A,B,D): inf 
0.03/0.17	Asymptotic class: infinity 
0.03/0.17	* Total analysis performed in 116 ms.
0.03/0.17	
0.03/0.27	EOF