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