0.02/0.16	WORST_CASE(?,O(1))  
0.02/0.16	
0.02/0.16	Preprocessing Cost Relations
0.02/0.16	=====================================
0.02/0.16	
0.02/0.16	#### Computed strongly connected components 
0.02/0.16	0. recursive  : [f4/5]
0.02/0.16	1. non_recursive  : [exit_location/1]
0.02/0.16	2. recursive  : [f10/3]
0.02/0.16	3. non_recursive  : [f18/3]
0.02/0.16	4. non_recursive  : [f10_loop_cont/4]
0.02/0.16	5. non_recursive  : [f4_loop_cont/4]
0.02/0.16	6. non_recursive  : [f0/3]
0.02/0.16	
0.02/0.16	#### Obtained direct recursion through partial evaluation 
0.02/0.16	0. SCC is partially evaluated into f4/5
0.02/0.16	1. SCC is completely evaluated into other SCCs
0.02/0.16	2. SCC is partially evaluated into f10/3
0.02/0.16	3. SCC is completely evaluated into other SCCs
0.02/0.16	4. SCC is partially evaluated into f10_loop_cont/4
0.02/0.16	5. SCC is partially evaluated into f4_loop_cont/4
0.02/0.16	6. SCC is partially evaluated into f0/3
0.02/0.16	
0.02/0.16	Control-Flow Refinement of Cost Relations
0.02/0.16	=====================================
0.02/0.16	
0.02/0.16	### Specialization of cost equations f4/5 
0.02/0.16	* CE 3 is refined into CE [12] 
0.02/0.16	* CE 4 is refined into CE [13] 
0.02/0.16	* CE 2 is refined into CE [14] 
0.02/0.16	
0.02/0.16	
0.02/0.16	### Cost equations --> "Loop" of f4/5 
0.02/0.16	* CEs [14] --> Loop 12 
0.02/0.16	* CEs [12] --> Loop 13 
0.02/0.16	* CEs [13] --> Loop 14 
0.02/0.16	
0.02/0.16	### Ranking functions of CR f4(A,B,D,E,F) 
0.02/0.16	* RF of phase [12]: [-A+2]
0.02/0.16	
0.02/0.16	#### Partial ranking functions of CR f4(A,B,D,E,F) 
0.02/0.16	* Partial RF of phase [12]:
0.02/0.16	  - RF of loop [12:1]:
0.02/0.16	    -A+2
0.02/0.16	
0.02/0.16	
0.02/0.16	### Specialization of cost equations f10/3 
0.02/0.16	* CE 9 is refined into CE [15] 
0.02/0.16	* CE 8 is refined into CE [16] 
0.02/0.16	* CE 7 is refined into CE [17] 
0.02/0.16	
0.02/0.16	
0.02/0.16	### Cost equations --> "Loop" of f10/3 
0.02/0.16	* CEs [17] --> Loop 15 
0.02/0.16	* CEs [15] --> Loop 16 
0.02/0.16	* CEs [16] --> Loop 17 
0.02/0.16	
0.02/0.16	### Ranking functions of CR f10(B,D,E) 
0.02/0.16	* RF of phase [15]: [-B+2]
0.02/0.16	
0.02/0.16	#### Partial ranking functions of CR f10(B,D,E) 
0.02/0.16	* Partial RF of phase [15]:
0.02/0.16	  - RF of loop [15:1]:
0.02/0.16	    -B+2
0.02/0.16	
0.02/0.16	
0.02/0.16	### Specialization of cost equations f10_loop_cont/4 
0.02/0.16	* CE 11 is refined into CE [18] 
0.02/0.16	* CE 10 is refined into CE [19] 
0.02/0.16	
0.02/0.16	
0.02/0.16	### Cost equations --> "Loop" of f10_loop_cont/4 
0.02/0.16	* CEs [18] --> Loop 18 
0.02/0.16	* CEs [19] --> Loop 19 
0.02/0.16	
0.02/0.16	### Ranking functions of CR f10_loop_cont(A,B,C,D) 
0.02/0.16	
0.02/0.16	#### Partial ranking functions of CR f10_loop_cont(A,B,C,D) 
0.02/0.16	
0.02/0.16	
0.02/0.16	### Specialization of cost equations f4_loop_cont/4 
0.02/0.16	* CE 6 is refined into CE [20,21,22,23] 
0.02/0.16	* CE 5 is refined into CE [24] 
0.02/0.16	
0.02/0.16	
0.02/0.16	### Cost equations --> "Loop" of f4_loop_cont/4 
0.02/0.16	* CEs [21] --> Loop 20 
0.02/0.16	* CEs [20,23] --> Loop 21 
0.02/0.16	* CEs [22] --> Loop 22 
0.02/0.16	* CEs [24] --> Loop 23 
0.02/0.16	
0.02/0.16	### Ranking functions of CR f4_loop_cont(A,B,C,D) 
0.02/0.16	
0.02/0.16	#### Partial ranking functions of CR f4_loop_cont(A,B,C,D) 
0.02/0.16	
0.02/0.16	
0.02/0.16	### Specialization of cost equations f0/3 
0.02/0.16	* CE 1 is refined into CE [25,26,27,28] 
0.02/0.16	
0.02/0.16	
0.02/0.16	### Cost equations --> "Loop" of f0/3 
0.02/0.16	* CEs [25,26,27,28] --> Loop 24 
0.02/0.16	
0.02/0.16	### Ranking functions of CR f0(A,B,D) 
0.02/0.16	
0.02/0.16	#### Partial ranking functions of CR f0(A,B,D) 
0.02/0.16	
0.02/0.16	
0.02/0.16	Computing Bounds
0.02/0.16	=====================================
0.02/0.16	
0.02/0.16	#### Cost of chains of f4(A,B,D,E,F):
0.02/0.16	* Chain [[12],14]: 1*it(12)+0
0.02/0.16	  Such that:it(12) =< -A+2
0.02/0.16	
0.02/0.16	  with precondition: [D=3,1>=A,A>=0] 
0.02/0.16	
0.02/0.16	* Chain [[12],13]: 1*it(12)+0
0.02/0.16	  Such that:it(12) =< -A+2
0.02/0.16	
0.02/0.16	  with precondition: [D=4,E=2,F=0,1>=A,A>=0] 
0.02/0.16	
0.02/0.16	* Chain [14]: 0
0.02/0.16	  with precondition: [D=3,A>=0] 
0.02/0.16	
0.02/0.16	
0.02/0.16	#### Cost of chains of f10(B,D,E):
0.02/0.16	* Chain [[15],17]: 1*it(15)+0
0.02/0.16	  Such that:it(15) =< -B+2
0.02/0.16	
0.02/0.16	  with precondition: [D=2,E=2,1>=B] 
0.02/0.16	
0.02/0.16	* Chain [[15],16]: 1*it(15)+0
0.02/0.16	  Such that:it(15) =< -B+2
0.02/0.16	
0.02/0.16	  with precondition: [D=3,1>=B] 
0.02/0.16	
0.02/0.16	* Chain [17]: 0
0.02/0.16	  with precondition: [D=2,B=E,B>=2] 
0.02/0.16	
0.02/0.16	* Chain [16]: 0
0.02/0.16	  with precondition: [D=3] 
0.02/0.16	
0.02/0.16	
0.02/0.16	#### Cost of chains of f10_loop_cont(A,B,C,D):
0.02/0.16	* Chain [19]: 0
0.02/0.16	  with precondition: [A=2] 
0.02/0.16	
0.02/0.16	* Chain [18]: 0
0.02/0.16	  with precondition: [A=3] 
0.02/0.16	
0.02/0.16	
0.02/0.16	#### Cost of chains of f4_loop_cont(A,B,C,D):
0.02/0.16	* Chain [23]: 0
0.02/0.16	  with precondition: [A=3] 
0.02/0.16	
0.02/0.16	* Chain [22]: 0
0.02/0.16	  with precondition: [A=4] 
0.02/0.16	
0.02/0.16	* Chain [21]: 2*s(1)+0
0.02/0.16	  Such that:aux(1) =< -C+2
0.02/0.16	s(1) =< aux(1)
0.02/0.16	
0.02/0.16	  with precondition: [A=4,1>=C] 
0.02/0.16	
0.02/0.16	* Chain [20]: 0
0.02/0.16	  with precondition: [A=4,C>=2] 
0.02/0.16	
0.02/0.16	
0.02/0.16	#### Cost of chains of f0(A,B,D):
0.02/0.16	* Chain [24]: 10
0.02/0.16	  with precondition: [] 
0.02/0.16	
0.02/0.16	
0.02/0.16	Closed-form bounds of f0(A,B,D): 
0.02/0.16	-------------------------------------
0.02/0.16	* Chain [24] with precondition: [] 
0.02/0.16	    - Upper bound: 10 
0.02/0.16	    - Complexity: constant 
0.02/0.16	
0.02/0.16	### Maximum cost of f0(A,B,D): 10 
0.02/0.16	Asymptotic class: constant 
0.02/0.16	* Total analysis performed in 104 ms.
0.02/0.16	
0.02/0.26	EOF