0.03/0.20	MAYBE
0.03/0.20	
0.03/0.20	Preprocessing Cost Relations
0.03/0.20	=====================================
0.03/0.20	
0.03/0.20	#### Computed strongly connected components 
0.03/0.20	0. recursive  : [f1/11]
0.03/0.20	1. non_recursive  : [exit_location/1]
0.03/0.20	2. non_recursive  : [f300/9]
0.03/0.20	3. non_recursive  : [f1_loop_cont/10]
0.03/0.20	4. non_recursive  : [f2/9]
0.03/0.20	
0.03/0.20	#### Obtained direct recursion through partial evaluation 
0.03/0.20	0. SCC is partially evaluated into f1/11
0.03/0.20	1. SCC is completely evaluated into other SCCs
0.03/0.20	2. SCC is completely evaluated into other SCCs
0.03/0.20	3. SCC is partially evaluated into f1_loop_cont/10
0.03/0.20	4. SCC is partially evaluated into f2/9
0.03/0.20	
0.03/0.20	Control-Flow Refinement of Cost Relations
0.03/0.20	=====================================
0.03/0.20	
0.03/0.20	### Specialization of cost equations f1/11 
0.03/0.20	* CE 6 is refined into CE [9] 
0.03/0.20	* CE 5 is refined into CE [10] 
0.03/0.20	* CE 2 is refined into CE [11] 
0.03/0.20	* CE 3 is refined into CE [12] 
0.03/0.20	* CE 4 is refined into CE [13] 
0.03/0.20	
0.03/0.20	
0.03/0.20	### Cost equations --> "Loop" of f1/11 
0.03/0.20	* CEs [11] --> Loop 9 
0.03/0.20	* CEs [12] --> Loop 10 
0.03/0.20	* CEs [13] --> Loop 11 
0.03/0.20	* CEs [9] --> Loop 12 
0.03/0.20	* CEs [10] --> Loop 13 
0.03/0.20	
0.03/0.20	### Ranking functions of CR f1(A,B,C,D,E,F,L,M,N,O,P) 
0.03/0.20	
0.03/0.20	#### Partial ranking functions of CR f1(A,B,C,D,E,F,L,M,N,O,P) 
0.03/0.20	
0.03/0.20	
0.03/0.20	### Specialization of cost equations f1_loop_cont/10 
0.03/0.20	* CE 8 is refined into CE [14] 
0.03/0.20	* CE 7 is refined into CE [15] 
0.03/0.20	
0.03/0.20	
0.03/0.20	### Cost equations --> "Loop" of f1_loop_cont/10 
0.03/0.20	* CEs [14] --> Loop 14 
0.03/0.20	* CEs [15] --> Loop 15 
0.03/0.20	
0.03/0.20	### Ranking functions of CR f1_loop_cont(A,B,C,D,E,F,G,H,I,J) 
0.03/0.20	
0.03/0.20	#### Partial ranking functions of CR f1_loop_cont(A,B,C,D,E,F,G,H,I,J) 
0.03/0.20	
0.03/0.20	
0.03/0.20	### Specialization of cost equations f2/9 
0.03/0.20	* CE 1 is refined into CE [16,17,18,19,20] 
0.03/0.20	
0.03/0.20	
0.03/0.20	### Cost equations --> "Loop" of f2/9 
0.03/0.20	* CEs [19,20] --> Loop 16 
0.03/0.20	* CEs [18] --> Loop 17 
0.03/0.20	* CEs [16] --> Loop 18 
0.03/0.20	* CEs [17] --> Loop 19 
0.03/0.20	
0.03/0.20	### Ranking functions of CR f2(A,B,C,D,E,F,G,H,L) 
0.03/0.20	
0.03/0.20	#### Partial ranking functions of CR f2(A,B,C,D,E,F,G,H,L) 
0.03/0.20	
0.03/0.20	
0.03/0.20	Computing Bounds
0.03/0.20	=====================================
0.03/0.20	
0.03/0.20	#### Cost of chains of f1(A,B,C,D,E,F,L,M,N,O,P):
0.03/0.20	* Chain [[9,10,11]]...: 3*it(9)+0
0.03/0.20	  with precondition: [A>=B+1] 
0.03/0.20	
0.03/0.20	* Chain [[9,10,11],12]: 3*it(9)+0
0.03/0.20	  with precondition: [L=3,A>=B+1] 
0.03/0.20	
0.03/0.20	* Chain [13]: 0
0.03/0.20	  with precondition: [L=2,N=D,O=E,B>=A] 
0.03/0.20	
0.03/0.20	* Chain [12]: 0
0.03/0.20	  with precondition: [L=3] 
0.03/0.20	
0.03/0.20	
0.03/0.20	#### Cost of chains of f1_loop_cont(A,B,C,D,E,F,G,H,I,J):
0.03/0.20	* Chain [15]: 0
0.03/0.20	  with precondition: [A=2,I=H] 
0.03/0.20	
0.03/0.20	* Chain [14]: 0
0.03/0.20	  with precondition: [A=3,I=H] 
0.03/0.20	
0.03/0.20	
0.03/0.20	#### Cost of chains of f2(A,B,C,D,E,F,G,H,L):
0.03/0.20	* Chain [19]: 0
0.03/0.20	  with precondition: [] 
0.03/0.20	
0.03/0.20	* Chain [18]: 0
0.03/0.20	  with precondition: [B>=A] 
0.03/0.20	
0.03/0.20	* Chain [17]: 3*s(1)+0
0.03/0.20	  with precondition: [A>=B+1] 
0.03/0.20	
0.03/0.20	* Chain [16]...: 1*aux(1)+0
0.03/0.20	  with precondition: [A>=B+1] 
0.03/0.20	
0.03/0.20	
0.03/0.20	Closed-form bounds of f2(A,B,C,D,E,F,G,H,L): 
0.03/0.20	-------------------------------------
0.03/0.20	* Chain [19] with precondition: [] 
0.03/0.20	    - Upper bound: 0 
0.03/0.20	    - Complexity: constant 
0.03/0.20	* Chain [18] with precondition: [B>=A] 
0.03/0.20	    - Upper bound: 0 
0.03/0.20	    - Complexity: constant 
0.03/0.20	* Chain [17] with precondition: [A>=B+1] 
0.03/0.20	    - Upper bound: inf 
0.03/0.20	    - Complexity: infinity 
0.03/0.20	* Chain [16]... with precondition: [A>=B+1] 
0.03/0.20	    - Upper bound: inf 
0.03/0.20	    - Complexity: infinity 
0.03/0.20	
0.03/0.20	### Maximum cost of f2(A,B,C,D,E,F,G,H,L): inf 
0.03/0.20	Asymptotic class: infinity 
0.03/0.20	* Total analysis performed in 140 ms.
0.03/0.20	
0.22/0.30	EOF