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