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