0.03/0.12	WORST_CASE(?,O(n^1))  
0.03/0.12	
0.03/0.12	Preprocessing Cost Relations
0.03/0.12	=====================================
0.03/0.12	
0.03/0.12	#### Computed strongly connected components 
0.03/0.12	0. recursive  : [evalfbb1in/4,evalfbbin/4]
0.03/0.12	1. non_recursive  : [evalfstop/3]
0.03/0.12	2. non_recursive  : [evalfreturnin/3]
0.03/0.12	3. non_recursive  : [exit_location/1]
0.03/0.12	4. non_recursive  : [evalfbb1in_loop_cont/4]
0.03/0.12	5. non_recursive  : [evalfentryin/3]
0.03/0.12	6. non_recursive  : [evalfstart/3]
0.03/0.12	
0.03/0.12	#### Obtained direct recursion through partial evaluation 
0.03/0.12	0. SCC is partially evaluated into evalfbb1in/4
0.03/0.12	1. SCC is completely evaluated into other SCCs
0.03/0.12	2. SCC is completely evaluated into other SCCs
0.03/0.12	3. SCC is completely evaluated into other SCCs
0.03/0.12	4. SCC is partially evaluated into evalfbb1in_loop_cont/4
0.03/0.12	5. SCC is partially evaluated into evalfentryin/3
0.03/0.12	6. SCC is partially evaluated into evalfstart/3
0.03/0.12	
0.03/0.12	Control-Flow Refinement of Cost Relations
0.03/0.12	=====================================
0.03/0.12	
0.03/0.12	### Specialization of cost equations evalfbb1in/4 
0.03/0.12	* CE 5 is refined into CE [8] 
0.03/0.12	* CE 4 is refined into CE [9] 
0.03/0.12	* CE 3 is refined into CE [10] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of evalfbb1in/4 
0.03/0.12	* CEs [10] --> Loop 8 
0.03/0.12	* CEs [8] --> Loop 9 
0.03/0.12	* CEs [9] --> Loop 10 
0.03/0.12	
0.03/0.12	### Ranking functions of CR evalfbb1in(A,B,C,D) 
0.03/0.12	* RF of phase [8]: [A-B+1]
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR evalfbb1in(A,B,C,D) 
0.03/0.12	* Partial RF of phase [8]:
0.03/0.12	  - RF of loop [8:1]:
0.03/0.12	    A-B+1
0.03/0.12	
0.03/0.12	
0.03/0.12	### Specialization of cost equations evalfbb1in_loop_cont/4 
0.03/0.12	* CE 7 is refined into CE [11] 
0.03/0.12	* CE 6 is refined into CE [12] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of evalfbb1in_loop_cont/4 
0.03/0.12	* CEs [11] --> Loop 11 
0.03/0.12	* CEs [12] --> Loop 12 
0.03/0.12	
0.03/0.12	### Ranking functions of CR evalfbb1in_loop_cont(A,B,C,D) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR evalfbb1in_loop_cont(A,B,C,D) 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Specialization of cost equations evalfentryin/3 
0.03/0.12	* CE 2 is refined into CE [13,14,15,16] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of evalfentryin/3 
0.03/0.12	* CEs [14] --> Loop 13 
0.03/0.12	* CEs [13,16] --> Loop 14 
0.03/0.12	* CEs [15] --> Loop 15 
0.03/0.12	
0.03/0.12	### Ranking functions of CR evalfentryin(A,B,C) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR evalfentryin(A,B,C) 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Specialization of cost equations evalfstart/3 
0.03/0.12	* CE 1 is refined into CE [17,18,19] 
0.03/0.12	
0.03/0.12	
0.03/0.12	### Cost equations --> "Loop" of evalfstart/3 
0.03/0.12	* CEs [19] --> Loop 16 
0.03/0.12	* CEs [18] --> Loop 17 
0.03/0.12	* CEs [17] --> Loop 18 
0.03/0.12	
0.03/0.12	### Ranking functions of CR evalfstart(A,B,C) 
0.03/0.12	
0.03/0.12	#### Partial ranking functions of CR evalfstart(A,B,C) 
0.03/0.12	
0.03/0.12	
0.03/0.12	Computing Bounds
0.03/0.12	=====================================
0.03/0.12	
0.03/0.12	#### Cost of chains of evalfbb1in(A,B,C,D):
0.03/0.12	* Chain [[8],10]: 1*it(8)+0
0.03/0.12	  Such that:it(8) =< A-B+1
0.03/0.12	
0.03/0.12	  with precondition: [C=2,A+1=D,A>=B] 
0.03/0.12	
0.03/0.12	* Chain [[8],9]: 1*it(8)+0
0.03/0.12	  Such that:it(8) =< A-B+1
0.03/0.12	
0.03/0.12	  with precondition: [C=3,A>=B] 
0.03/0.12	
0.03/0.12	* Chain [10]: 0
0.03/0.12	  with precondition: [C=2,B=D,B>=A+1] 
0.03/0.12	
0.03/0.12	* Chain [9]: 0
0.03/0.12	  with precondition: [C=3] 
0.03/0.12	
0.03/0.12	
0.03/0.12	#### Cost of chains of evalfbb1in_loop_cont(A,B,C,D):
0.03/0.12	* Chain [12]: 0
0.03/0.12	  with precondition: [A=2] 
0.03/0.12	
0.03/0.12	* Chain [11]: 0
0.03/0.12	  with precondition: [A=3] 
0.03/0.12	
0.03/0.12	
0.03/0.12	#### Cost of chains of evalfentryin(A,B,C):
0.03/0.12	* Chain [15]: 0
0.03/0.12	  with precondition: [] 
0.03/0.12	
0.03/0.12	* Chain [14]: 2*s(1)+0
0.03/0.12	  Such that:aux(1) =< -A+B+1
0.03/0.12	s(1) =< aux(1)
0.03/0.12	
0.03/0.12	  with precondition: [B>=A] 
0.03/0.12	
0.03/0.12	* Chain [13]: 0
0.03/0.12	  with precondition: [A>=B+1] 
0.03/0.12	
0.03/0.12	
0.03/0.12	#### Cost of chains of evalfstart(A,B,C):
0.03/0.12	* Chain [18]: 0
0.03/0.12	  with precondition: [] 
0.03/0.12	
0.03/0.12	* Chain [17]: 2*s(4)+0
0.03/0.12	  Such that:s(3) =< -A+B+1
0.03/0.12	s(4) =< s(3)
0.03/0.12	
0.03/0.12	  with precondition: [B>=A] 
0.03/0.12	
0.03/0.12	* Chain [16]: 0
0.03/0.12	  with precondition: [A>=B+1] 
0.03/0.12	
0.03/0.12	
0.03/0.12	Closed-form bounds of evalfstart(A,B,C): 
0.03/0.12	-------------------------------------
0.03/0.12	* Chain [18] with precondition: [] 
0.03/0.12	    - Upper bound: 0 
0.03/0.12	    - Complexity: constant 
0.03/0.12	* Chain [17] with precondition: [B>=A] 
0.03/0.12	    - Upper bound: -2*A+2*B+2 
0.03/0.12	    - Complexity: n 
0.03/0.12	* Chain [16] with precondition: [A>=B+1] 
0.03/0.12	    - Upper bound: 0 
0.03/0.12	    - Complexity: constant 
0.03/0.12	
0.03/0.12	### Maximum cost of evalfstart(A,B,C): nat(-A+B+1)*2 
0.03/0.12	Asymptotic class: n 
0.03/0.12	* Total analysis performed in 67 ms.
0.03/0.12	
0.03/0.22	EOF