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