0.06/0.40 MAYBE 0.06/0.40 0.06/0.40 Preprocessing Cost Relations 0.06/0.40 ===================================== 0.06/0.40 0.06/0.40 #### Computed strongly connected components 0.06/0.40 0. recursive : [eval_counterex1c_1/6,eval_counterex1c_2/7,eval_counterex1c_5/6,eval_counterex1c_6/7,eval_counterex1c_LeafBlock8_in/5,eval_counterex1c_LeafBlock_in/5,eval_counterex1c_NodeBlock_in/5,eval_counterex1c_bb1_in/5,eval_counterex1c_bb2_in/5,eval_counterex1c_bb3_in/5,eval_counterex1c_bb4_in/5] 0.06/0.40 1. non_recursive : [eval_counterex1c_stop/1] 0.06/0.40 2. non_recursive : [eval_counterex1c__critedge_in/1] 0.06/0.40 3. non_recursive : [eval_counterex1c_NewDefault_in/1] 0.06/0.40 4. non_recursive : [eval_counterex1c_bb1_in_loop_cont/2] 0.06/0.40 5. non_recursive : [eval_counterex1c_bb0_in/5] 0.06/0.40 6. non_recursive : [eval_counterex1c_start/5] 0.06/0.40 0.06/0.40 #### Obtained direct recursion through partial evaluation 0.06/0.40 0. SCC is partially evaluated into eval_counterex1c_bb1_in/5 0.06/0.40 1. SCC is completely evaluated into other SCCs 0.06/0.40 2. SCC is completely evaluated into other SCCs 0.06/0.40 3. SCC is completely evaluated into other SCCs 0.06/0.40 4. SCC is partially evaluated into eval_counterex1c_bb1_in_loop_cont/2 0.06/0.40 5. SCC is partially evaluated into eval_counterex1c_bb0_in/5 0.06/0.40 6. SCC is partially evaluated into eval_counterex1c_start/5 0.06/0.40 0.06/0.40 Control-Flow Refinement of Cost Relations 0.06/0.40 ===================================== 0.06/0.40 0.06/0.40 ### Specialization of cost equations eval_counterex1c_bb1_in/5 0.06/0.40 * CE 11 is refined into CE [14] 0.06/0.40 * CE 9 is refined into CE [15] 0.06/0.40 * CE 10 is refined into CE [16] 0.06/0.40 * CE 3 is refined into CE [17] 0.06/0.40 * CE 6 is refined into CE [18] 0.06/0.40 * CE 5 is refined into CE [19] 0.06/0.40 * CE 4 is refined into CE [20] 0.06/0.40 * CE 7 is refined into CE [21] 0.06/0.40 * CE 8 is refined into CE [22] 0.06/0.40 0.06/0.40 0.06/0.40 ### Cost equations --> "Loop" of eval_counterex1c_bb1_in/5 0.06/0.40 * CEs [19] --> Loop 14 0.06/0.40 * CEs [20] --> Loop 15 0.06/0.40 * CEs [21] --> Loop 16 0.06/0.40 * CEs [22] --> Loop 17 0.06/0.40 * CEs [14] --> Loop 18 0.06/0.40 * CEs [15] --> Loop 19 0.06/0.40 * CEs [16] --> Loop 20 0.06/0.40 * CEs [17] --> Loop 21 0.06/0.40 * CEs [18] --> Loop 22 0.06/0.40 0.06/0.40 ### Ranking functions of CR eval_counterex1c_bb1_in(V_n,V__04,V__01,V__0,B) 0.06/0.40 0.06/0.40 #### Partial ranking functions of CR eval_counterex1c_bb1_in(V_n,V__04,V__01,V__0,B) 0.06/0.40 * Partial RF of phase [14,15,16,17]: 0.06/0.40 - RF of loop [14:1,15:1]: 0.06/0.40 V__04+1 depends on loops [16:1,17:1] 0.06/0.40 - RF of loop [15:1]: 0.06/0.40 V__0 depends on loops [16:1] 0.06/0.40 V__01+1 0.06/0.40 - RF of loop [16:1]: 0.06/0.40 -V__0+1 depends on loops [15:1] 0.06/0.40 - RF of loop [16:1,17:1]: 0.06/0.40 V_n-V__04+1 depends on loops [14:1,15:1] 0.06/0.40 0.06/0.40 0.06/0.40 ### Specialization of cost equations eval_counterex1c_bb1_in_loop_cont/2 0.06/0.40 * CE 13 is refined into CE [23] 0.06/0.40 * CE 12 is refined into CE [24] 0.06/0.40 0.06/0.40 0.06/0.40 ### Cost equations --> "Loop" of eval_counterex1c_bb1_in_loop_cont/2 0.06/0.40 * CEs [23] --> Loop 23 0.06/0.40 * CEs [24] --> Loop 24 0.06/0.40 0.06/0.40 ### Ranking functions of CR eval_counterex1c_bb1_in_loop_cont(A,B) 0.06/0.40 0.06/0.40 #### Partial ranking functions of CR eval_counterex1c_bb1_in_loop_cont(A,B) 0.06/0.40 0.06/0.40 0.06/0.40 ### Specialization of cost equations eval_counterex1c_bb0_in/5 0.06/0.40 * CE 2 is refined into CE [25,26,27,28,29,30,31,32,33] 0.06/0.40 0.06/0.40 0.06/0.40 ### Cost equations --> "Loop" of eval_counterex1c_bb0_in/5 0.06/0.40 * CEs [32,33] --> Loop 25 0.06/0.40 * CEs [31] --> Loop 26 0.06/0.40 * CEs [26] --> Loop 27 0.06/0.40 * CEs [27] --> Loop 28 0.06/0.40 * CEs [28] --> Loop 29 0.06/0.40 * CEs [25] --> Loop 30 0.06/0.40 * CEs [30] --> Loop 31 0.06/0.40 * CEs [29] --> Loop 32 0.06/0.40 0.06/0.40 ### Ranking functions of CR eval_counterex1c_bb0_in(V_n,V_b,V_x,V_y,B) 0.06/0.40 0.06/0.40 #### Partial ranking functions of CR eval_counterex1c_bb0_in(V_n,V_b,V_x,V_y,B) 0.06/0.40 0.06/0.40 0.06/0.40 ### Specialization of cost equations eval_counterex1c_start/5 0.06/0.40 * CE 1 is refined into CE [34,35,36,37,38,39,40,41] 0.06/0.40 0.06/0.40 0.06/0.40 ### Cost equations --> "Loop" of eval_counterex1c_start/5 0.06/0.40 * CEs [41] --> Loop 33 0.06/0.40 * CEs [40] --> Loop 34 0.06/0.40 * CEs [39] --> Loop 35 0.06/0.40 * CEs [38] --> Loop 36 0.06/0.40 * CEs [37] --> Loop 37 0.06/0.40 * CEs [36] --> Loop 38 0.06/0.40 * CEs [35] --> Loop 39 0.06/0.40 * CEs [34] --> Loop 40 0.06/0.40 0.06/0.40 ### Ranking functions of CR eval_counterex1c_start(V_n,V_b,V_x,V_y,B) 0.06/0.40 0.06/0.40 #### Partial ranking functions of CR eval_counterex1c_start(V_n,V_b,V_x,V_y,B) 0.06/0.40 0.06/0.40 0.06/0.40 Computing Bounds 0.06/0.40 ===================================== 0.06/0.40 0.06/0.40 #### Cost of chains of eval_counterex1c_bb1_in(V_n,V__04,V__01,V__0,B): 0.06/0.40 * Chain [[14,15,16,17]]...: 3*it(14)+1*it(15)+0 0.06/0.40 Such that:it(15) =< V__01+1 0.06/0.40 0.06/0.40 with precondition: [1>=V__0,V__0>=0,V__01>=0,V_n>=V__04,V__04>=0] 0.06/0.40 0.06/0.40 * Chain [[14,15,16,17],20]: 3*it(14)+1*it(15)+0 0.06/0.40 Such that:it(15) =< V__01+1 0.06/0.40 0.06/0.40 with precondition: [B=3,1>=V__0,V__04>=0,V__01>=0,V__0>=0,V__0+V_n>=V__04+1] 0.06/0.40 0.06/0.40 * Chain [[14,15,16,17],19]: 3*it(14)+1*it(15)+0 0.06/0.40 Such that:it(15) =< V__01+1 0.06/0.40 0.06/0.40 with precondition: [B=3,1>=V__0,V__04>=0,V__01>=0,V__0>=0,V__0+V_n>=V__04+1] 0.06/0.40 0.06/0.40 * Chain [[14,15,16,17],18]: 3*it(14)+1*it(15)+0 0.06/0.40 Such that:it(15) =< V__01 0.06/0.40 0.06/0.40 with precondition: [B=3,1>=V__0,V__0>=0,V_n>=V__04,V__04>=V__0,V__01>=V__0] 0.06/0.40 0.06/0.40 * Chain [22]: 0 0.06/0.40 with precondition: [B=2,0>=V__0+1,V__04>=0,V__01>=0,V_n>=V__04] 0.06/0.40 0.06/0.40 * Chain [21]: 0 0.06/0.40 with precondition: [B=2,V__04>=0,V__01>=0,V__0>=2,V_n>=V__04] 0.06/0.40 0.06/0.40 * Chain [20]: 0 0.06/0.40 with precondition: [B=3,0>=V__04+1] 0.06/0.40 0.06/0.40 * Chain [19]: 0 0.06/0.40 with precondition: [B=3,0>=V__01+1] 0.06/0.40 0.06/0.40 * Chain [18]: 0 0.06/0.40 with precondition: [B=3,V__04>=V_n+1] 0.06/0.40 0.06/0.40 0.06/0.40 #### Cost of chains of eval_counterex1c_bb1_in_loop_cont(A,B): 0.06/0.40 * Chain [24]: 0 0.06/0.40 with precondition: [A=2] 0.06/0.40 0.06/0.40 * Chain [23]: 0 0.06/0.40 with precondition: [A=3] 0.06/0.40 0.06/0.40 0.06/0.40 #### Cost of chains of eval_counterex1c_bb0_in(V_n,V_b,V_x,V_y,B): 0.06/0.40 * Chain [32]: 2*s(6)+6*s(7)+0 0.06/0.40 Such that:s(5) =< V_x+1 0.06/0.40 s(6) =< s(5) 0.06/0.40 0.06/0.40 with precondition: [1>=V_b,V_b>=0,V_x>=0,V_y>=0,V_b+V_n>=V_y+1] 0.06/0.40 0.06/0.40 * Chain [31]: 1*s(8)+3*s(9)+0 0.06/0.40 Such that:s(8) =< V_x 0.06/0.40 0.06/0.40 with precondition: [1>=V_b,V_b>=0,V_x>=V_b,V_y>=V_b,V_n>=V_y] 0.06/0.40 0.06/0.40 * Chain [30]: 0 0.06/0.40 with precondition: [0>=V_b+1,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 0.06/0.40 * Chain [29]: 0 0.06/0.40 with precondition: [0>=V_x+1] 0.06/0.40 0.06/0.40 * Chain [28]: 0 0.06/0.40 with precondition: [0>=V_y+1] 0.06/0.40 0.06/0.40 * Chain [27]: 0 0.06/0.40 with precondition: [V_b>=2,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 0.06/0.40 * Chain [26]: 0 0.06/0.40 with precondition: [V_y>=V_n+1] 0.06/0.40 0.06/0.40 * Chain [25]...: 2*s(10)+6*s(11)+0 0.06/0.40 Such that:aux(18) =< V_x+1 0.06/0.40 s(10) =< aux(18) 0.06/0.40 0.06/0.40 with precondition: [1>=V_b,V_b>=0,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 0.06/0.40 0.06/0.40 #### Cost of chains of eval_counterex1c_start(V_n,V_b,V_x,V_y,B): 0.06/0.40 * Chain [40]: 2*s(15)+6*s(16)+0 0.06/0.40 Such that:s(14) =< V_x+1 0.06/0.40 s(15) =< s(14) 0.06/0.40 0.06/0.40 with precondition: [1>=V_b,V_b>=0,V_x>=0,V_y>=0,V_b+V_n>=V_y+1] 0.06/0.40 0.06/0.40 * Chain [39]: 1*s(17)+3*s(18)+0 0.06/0.40 Such that:s(17) =< V_x 0.06/0.40 0.06/0.40 with precondition: [1>=V_b,V_b>=0,V_x>=V_b,V_y>=V_b,V_n>=V_y] 0.06/0.40 0.06/0.40 * Chain [38]: 0 0.06/0.40 with precondition: [0>=V_b+1,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 0.06/0.40 * Chain [37]: 0 0.06/0.40 with precondition: [0>=V_x+1] 0.06/0.40 0.06/0.40 * Chain [36]: 0 0.06/0.40 with precondition: [0>=V_y+1] 0.06/0.40 0.06/0.40 * Chain [35]: 0 0.06/0.40 with precondition: [V_b>=2,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 0.06/0.40 * Chain [34]: 0 0.06/0.40 with precondition: [V_y>=V_n+1] 0.06/0.40 0.06/0.40 * Chain [33]...: 2*s(20)+6*s(21)+0 0.06/0.40 Such that:s(19) =< V_x+1 0.06/0.40 s(20) =< s(19) 0.06/0.40 0.06/0.40 with precondition: [1>=V_b,V_b>=0,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 0.06/0.40 0.06/0.40 Closed-form bounds of eval_counterex1c_start(V_n,V_b,V_x,V_y,B): 0.06/0.40 ------------------------------------- 0.06/0.40 * Chain [40] with precondition: [1>=V_b,V_b>=0,V_x>=0,V_y>=0,V_n+V_b>=V_y+1] 0.06/0.40 - Upper bound: inf 0.06/0.40 - Complexity: infinity 0.06/0.40 * Chain [39] with precondition: [1>=V_b,V_b>=0,V_x>=V_b,V_y>=V_b,V_n>=V_y] 0.06/0.40 - Upper bound: inf 0.06/0.40 - Complexity: infinity 0.06/0.40 * Chain [38] with precondition: [0>=V_b+1,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 - Upper bound: 0 0.06/0.40 - Complexity: constant 0.06/0.40 * Chain [37] with precondition: [0>=V_x+1] 0.06/0.40 - Upper bound: 0 0.06/0.40 - Complexity: constant 0.06/0.40 * Chain [36] with precondition: [0>=V_y+1] 0.06/0.40 - Upper bound: 0 0.06/0.40 - Complexity: constant 0.06/0.40 * Chain [35] with precondition: [V_b>=2,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 - Upper bound: 0 0.06/0.40 - Complexity: constant 0.06/0.40 * Chain [34] with precondition: [V_y>=V_n+1] 0.06/0.40 - Upper bound: 0 0.06/0.40 - Complexity: constant 0.06/0.40 * Chain [33]... with precondition: [1>=V_b,V_b>=0,V_x>=0,V_y>=0,V_n>=V_y] 0.06/0.40 - Upper bound: inf 0.06/0.40 - Complexity: infinity 0.06/0.40 0.06/0.40 ### Maximum cost of eval_counterex1c_start(V_n,V_b,V_x,V_y,B): inf 0.06/0.40 Asymptotic class: infinity 0.06/0.40 * Total analysis performed in 308 ms. 0.06/0.40 0.06/0.50 EOF