0.04/0.13 MAYBE 0.04/0.13 0.04/0.13 Preprocessing Cost Relations 0.04/0.13 ===================================== 0.04/0.13 0.04/0.13 #### Computed strongly connected components 0.04/0.13 0. recursive : [eval_foo_bb1_in/2,eval_foo_bb2_in/2] 0.04/0.13 1. non_recursive : [eval_foo_stop/1] 0.04/0.13 2. non_recursive : [eval_foo_bb3_in/1] 0.04/0.13 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.04/0.13 4. non_recursive : [eval_foo_bb0_in/2] 0.04/0.13 5. non_recursive : [eval_foo_start/3] 0.04/0.13 0.04/0.13 #### Obtained direct recursion through partial evaluation 0.04/0.13 0. SCC is partially evaluated into eval_foo_bb1_in/2 0.04/0.13 1. SCC is completely evaluated into other SCCs 0.04/0.13 2. SCC is completely evaluated into other SCCs 0.04/0.13 3. SCC is completely evaluated into other SCCs 0.04/0.13 4. SCC is partially evaluated into eval_foo_bb0_in/2 0.04/0.13 5. SCC is partially evaluated into eval_foo_start/3 0.04/0.13 0.04/0.13 Control-Flow Refinement of Cost Relations 0.04/0.13 ===================================== 0.04/0.13 0.04/0.13 ### Specialization of cost equations eval_foo_bb1_in/2 0.04/0.13 * CE 5 is refined into CE [7] 0.04/0.13 * CE 6 is refined into CE [8] 0.04/0.13 * CE 3 is refined into CE [9] 0.04/0.13 * CE 4 is refined into CE [10] 0.04/0.13 0.04/0.13 0.04/0.13 ### Cost equations --> "Loop" of eval_foo_bb1_in/2 0.04/0.13 * CEs [9] --> Loop 7 0.04/0.13 * CEs [10] --> Loop 8 0.04/0.13 * CEs [7] --> Loop 9 0.04/0.13 * CEs [8] --> Loop 10 0.04/0.13 0.04/0.13 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) 0.04/0.13 * RF of phase [7]: [V__0-1] 0.04/0.13 0.04/0.13 #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 0.04/0.13 * Partial RF of phase [7]: 0.04/0.13 - RF of loop [7:1]: 0.04/0.13 V__0-1 0.04/0.13 0.04/0.13 0.04/0.13 ### Specialization of cost equations eval_foo_bb0_in/2 0.04/0.13 * CE 2 is refined into CE [11,12,13,14,15] 0.04/0.13 0.04/0.13 0.04/0.13 ### Cost equations --> "Loop" of eval_foo_bb0_in/2 0.04/0.13 * CEs [15] --> Loop 11 0.04/0.13 * CEs [14] --> Loop 12 0.04/0.13 * CEs [13] --> Loop 13 0.04/0.13 * CEs [12] --> Loop 14 0.04/0.13 * CEs [11] --> Loop 15 0.04/0.13 0.04/0.13 ### Ranking functions of CR eval_foo_bb0_in(V_i,B) 0.04/0.13 0.04/0.13 #### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 0.04/0.13 0.04/0.13 0.04/0.13 ### Specialization of cost equations eval_foo_start/3 0.04/0.13 * CE 1 is refined into CE [16,17,18,19,20] 0.04/0.13 0.04/0.13 0.04/0.13 ### Cost equations --> "Loop" of eval_foo_start/3 0.04/0.13 * CEs [20] --> Loop 16 0.04/0.13 * CEs [19] --> Loop 17 0.04/0.13 * CEs [18] --> Loop 18 0.04/0.13 * CEs [17] --> Loop 19 0.04/0.13 * CEs [16] --> Loop 20 0.04/0.13 0.04/0.13 ### Ranking functions of CR eval_foo_start(V_i,V_b,B) 0.04/0.13 0.04/0.13 #### Partial ranking functions of CR eval_foo_start(V_i,V_b,B) 0.04/0.13 0.04/0.13 0.04/0.13 Computing Bounds 0.04/0.13 ===================================== 0.04/0.13 0.04/0.13 #### Cost of chains of eval_foo_bb1_in(V__0,B): 0.04/0.13 * Chain [[8]]...: 1*it(8)+0 0.04/0.13 with precondition: [0>=V__0+1,B=2] 0.04/0.13 0.04/0.13 * Chain [[7],10]: 1*it(7)+0 0.04/0.13 Such that:it(7) =< V__0 0.04/0.13 0.04/0.13 with precondition: [B=2,V__0>=2] 0.04/0.13 0.04/0.13 * Chain [[7],9]: 1*it(7)+0 0.04/0.13 Such that:it(7) =< V__0 0.04/0.13 0.04/0.13 with precondition: [B=2,V__0>=3] 0.04/0.13 0.04/0.13 * Chain [10]: 0 0.04/0.13 with precondition: [V__0=0,B=2] 0.04/0.13 0.04/0.13 * Chain [9]: 0 0.04/0.13 with precondition: [V__0=1,B=2] 0.04/0.13 0.04/0.13 0.04/0.13 #### Cost of chains of eval_foo_bb0_in(V_i,B): 0.04/0.13 * Chain [15]: 0 0.04/0.13 with precondition: [V_i=0] 0.04/0.13 0.04/0.13 * Chain [14]: 0 0.04/0.13 with precondition: [V_i=1] 0.04/0.13 0.04/0.13 * Chain [13]: 1*s(1)+0 0.04/0.13 Such that:s(1) =< V_i 0.04/0.13 0.04/0.13 with precondition: [V_i>=2] 0.04/0.13 0.04/0.13 * Chain [12]: 1*s(2)+0 0.04/0.13 Such that:s(2) =< V_i 0.04/0.13 0.04/0.13 with precondition: [V_i>=3] 0.04/0.13 0.04/0.13 * Chain [11]...: 1*s(3)+0 0.04/0.13 with precondition: [0>=V_i+1] 0.04/0.13 0.04/0.13 0.04/0.13 #### Cost of chains of eval_foo_start(V_i,V_b,B): 0.04/0.13 * Chain [20]: 0 0.04/0.13 with precondition: [V_i=0] 0.04/0.13 0.04/0.13 * Chain [19]: 0 0.04/0.13 with precondition: [V_i=1] 0.04/0.13 0.04/0.13 * Chain [18]: 1*s(4)+0 0.04/0.13 Such that:s(4) =< V_i 0.04/0.13 0.04/0.13 with precondition: [V_i>=2] 0.04/0.13 0.04/0.13 * Chain [17]: 1*s(5)+0 0.04/0.13 Such that:s(5) =< V_i 0.04/0.13 0.04/0.13 with precondition: [V_i>=3] 0.04/0.13 0.04/0.13 * Chain [16]...: 1*s(6)+0 0.04/0.13 with precondition: [0>=V_i+1] 0.04/0.13 0.04/0.13 0.04/0.13 Closed-form bounds of eval_foo_start(V_i,V_b,B): 0.04/0.13 ------------------------------------- 0.04/0.13 * Chain [20] with precondition: [V_i=0] 0.04/0.13 - Upper bound: 0 0.04/0.13 - Complexity: constant 0.04/0.13 * Chain [19] with precondition: [V_i=1] 0.04/0.13 - Upper bound: 0 0.04/0.13 - Complexity: constant 0.04/0.13 * Chain [18] with precondition: [V_i>=2] 0.04/0.13 - Upper bound: V_i 0.04/0.13 - Complexity: n 0.04/0.13 * Chain [17] with precondition: [V_i>=3] 0.04/0.13 - Upper bound: V_i 0.04/0.13 - Complexity: n 0.04/0.13 * Chain [16]... with precondition: [0>=V_i+1] 0.04/0.13 - Upper bound: inf 0.04/0.13 - Complexity: infinity 0.04/0.13 0.04/0.13 ### Maximum cost of eval_foo_start(V_i,V_b,B): inf 0.04/0.13 Asymptotic class: infinity 0.04/0.13 * Total analysis performed in 63 ms. 0.04/0.13 0.04/0.24 EOF