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