0.04/0.22	MAYBE
0.04/0.22	
0.04/0.22	Preprocessing Cost Relations
0.04/0.22	=====================================
0.04/0.22	
0.04/0.22	#### Computed strongly connected components 
0.04/0.22	0. recursive  : [evalfbb1in/4,evalfbb2in/4,evalfbb3in/4,evalfbb4in/4,evalfbbin/4]
0.04/0.22	1. non_recursive  : [evalfstop/3]
0.04/0.22	2. non_recursive  : [evalfreturnin/3]
0.04/0.22	3. non_recursive  : [exit_location/1]
0.04/0.22	4. non_recursive  : [evalfbb3in_loop_cont/4]
0.04/0.22	5. non_recursive  : [evalfentryin/3]
0.04/0.22	6. non_recursive  : [evalfstart/3]
0.04/0.22	
0.04/0.22	#### Obtained direct recursion through partial evaluation 
0.04/0.22	0. SCC is partially evaluated into evalfbb3in/4
0.04/0.22	1. SCC is completely evaluated into other SCCs
0.04/0.22	2. SCC is completely evaluated into other SCCs
0.04/0.22	3. SCC is completely evaluated into other SCCs
0.04/0.22	4. SCC is partially evaluated into evalfbb3in_loop_cont/4
0.04/0.22	5. SCC is partially evaluated into evalfentryin/3
0.04/0.22	6. SCC is partially evaluated into evalfstart/3
0.04/0.22	
0.04/0.22	Control-Flow Refinement of Cost Relations
0.04/0.22	=====================================
0.04/0.22	
0.04/0.22	### Specialization of cost equations evalfbb3in/4 
0.04/0.22	* CE 7 is refined into CE [10] 
0.04/0.22	* CE 3 is refined into CE [11] 
0.04/0.22	* CE 6 is refined into CE [12] 
0.04/0.22	* CE 4 is refined into CE [13] 
0.04/0.22	* CE 5 is refined into CE [14] 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of evalfbb3in/4 
0.04/0.22	* CEs [13] --> Loop 10 
0.04/0.22	* CEs [14] --> Loop 11 
0.04/0.22	* CEs [10] --> Loop 12 
0.04/0.22	* CEs [11] --> Loop 13 
0.04/0.22	* CEs [12] --> Loop 14 
0.04/0.22	
0.04/0.22	### Ranking functions of CR evalfbb3in(A,B,D,E) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR evalfbb3in(A,B,D,E) 
0.04/0.22	* Partial RF of phase [10,11]:
0.04/0.22	  - RF of loop [10:1]:
0.04/0.22	    A depends on loops [11:1] 
0.04/0.22	    A-B+1 depends on loops [11:1] 
0.04/0.22	  - RF of loop [11:1]:
0.04/0.22	    -A+B depends on loops [10:1] 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Specialization of cost equations evalfbb3in_loop_cont/4 
0.04/0.22	* CE 9 is refined into CE [15] 
0.04/0.22	* CE 8 is refined into CE [16] 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of evalfbb3in_loop_cont/4 
0.04/0.22	* CEs [15] --> Loop 15 
0.04/0.22	* CEs [16] --> Loop 16 
0.04/0.22	
0.04/0.22	### Ranking functions of CR evalfbb3in_loop_cont(A,B,C,D) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR evalfbb3in_loop_cont(A,B,C,D) 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Specialization of cost equations evalfentryin/3 
0.04/0.22	* CE 2 is refined into CE [17,18,19,20,21,22,23] 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of evalfentryin/3 
0.04/0.22	* CEs [22,23] --> Loop 17 
0.04/0.22	* CEs [17,18,19,20,21] --> Loop 18 
0.04/0.22	
0.04/0.22	### Ranking functions of CR evalfentryin(A,B,D) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR evalfentryin(A,B,D) 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Specialization of cost equations evalfstart/3 
0.04/0.22	* CE 1 is refined into CE [24,25] 
0.04/0.22	
0.04/0.22	
0.04/0.22	### Cost equations --> "Loop" of evalfstart/3 
0.04/0.22	* CEs [25] --> Loop 19 
0.04/0.22	* CEs [24] --> Loop 20 
0.04/0.22	
0.04/0.22	### Ranking functions of CR evalfstart(A,B,D) 
0.04/0.22	
0.04/0.22	#### Partial ranking functions of CR evalfstart(A,B,D) 
0.04/0.22	
0.04/0.22	
0.04/0.22	Computing Bounds
0.04/0.22	=====================================
0.04/0.22	
0.04/0.22	#### Cost of chains of evalfbb3in(A,B,D,E):
0.04/0.22	* Chain [[10,11]]...: 2*it(10)+0
0.04/0.22	  with precondition: [B>=1,A>=1] 
0.04/0.22	
0.04/0.22	* Chain [[10,11],14]: 2*it(10)+0
0.04/0.22	  with precondition: [D=2,E=0,A>=1,B>=1] 
0.04/0.22	
0.04/0.22	* Chain [[10,11],13]: 2*it(10)+0
0.04/0.22	  with precondition: [D=2,A>=1,B>=1,E>=1,A+B>=3] 
0.04/0.22	
0.04/0.22	* Chain [[10,11],12]: 2*it(10)+0
0.04/0.22	  with precondition: [D=3,A>=1,B>=1] 
0.04/0.22	
0.04/0.22	* Chain [13]: 0
0.04/0.22	  with precondition: [D=2,A=E,A>=1,B>=1] 
0.04/0.22	
0.04/0.22	* Chain [12]: 0
0.04/0.22	  with precondition: [D=3,B>=1] 
0.04/0.22	
0.04/0.22	
0.04/0.22	#### Cost of chains of evalfbb3in_loop_cont(A,B,C,D):
0.04/0.22	* Chain [16]: 0
0.04/0.22	  with precondition: [A=2,C>=1] 
0.04/0.22	
0.04/0.22	* Chain [15]: 0
0.04/0.22	  with precondition: [A=3,C>=1] 
0.04/0.22	
0.04/0.22	
0.04/0.22	#### Cost of chains of evalfentryin(A,B,D):
0.04/0.22	* Chain [18]: 1*aux(15)+0
0.04/0.22	  with precondition: [A>=1,B>=A+1] 
0.04/0.22	
0.04/0.22	* Chain [17]...: 1*aux(16)+0
0.04/0.22	  with precondition: [A>=1,B>=A+1] 
0.04/0.22	
0.04/0.22	
0.04/0.22	#### Cost of chains of evalfstart(A,B,D):
0.04/0.22	* Chain [20]: 1*s(6)+0
0.04/0.22	  with precondition: [A>=1,B>=A+1] 
0.04/0.22	
0.04/0.22	* Chain [19]...: 1*s(7)+0
0.04/0.22	  with precondition: [A>=1,B>=A+1] 
0.04/0.22	
0.04/0.22	
0.04/0.22	Closed-form bounds of evalfstart(A,B,D): 
0.04/0.22	-------------------------------------
0.04/0.22	* Chain [20] with precondition: [A>=1,B>=A+1] 
0.04/0.22	    - Upper bound: inf 
0.04/0.22	    - Complexity: infinity 
0.04/0.22	* Chain [19]... with precondition: [A>=1,B>=A+1] 
0.04/0.22	    - Upper bound: inf 
0.04/0.22	    - Complexity: infinity 
0.04/0.22	
0.04/0.22	### Maximum cost of evalfstart(A,B,D): inf 
0.04/0.22	Asymptotic class: infinity 
0.04/0.22	* Total analysis performed in 150 ms.
0.04/0.22	
0.04/0.32	EOF