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