/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb3_in/5,eval_foo_bb4_in/5] 1. recursive : [eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in_loop_cont/4] 2. non_recursive : [eval_foo_stop/1] 3. non_recursive : [eval_foo_bb5_in/1] 4. non_recursive : [eval_foo_bb1_in_loop_cont/2] 5. non_recursive : [eval_foo_bb0_in/3] 6. non_recursive : [eval_foo_start/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb3_in/5 1. SCC is partially evaluated into eval_foo_bb1_in/3 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is completely evaluated into other SCCs 5. SCC is partially evaluated into eval_foo_bb0_in/3 6. SCC is partially evaluated into eval_foo_start/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb3_in/5 * CE 10 is refined into CE [11] * CE 9 is refined into CE [12] ### Cost equations --> "Loop" of eval_foo_bb3_in/5 * CEs [12] --> Loop 11 * CEs [11] --> Loop 12 ### Ranking functions of CR eval_foo_bb3_in(V__01,V__0,V__02,B,C) * RF of phase [11]: [-V__01+V__02,V__02-1] #### Partial ranking functions of CR eval_foo_bb3_in(V__01,V__0,V__02,B,C) * Partial RF of phase [11]: - RF of loop [11:1]: -V__01+V__02 V__02-1 ### Specialization of cost equations eval_foo_bb1_in/3 * CE 8 is refined into CE [13] * CE 6 is refined into CE [14] * CE 7 is refined into CE [15] * CE 5 is refined into CE [16] * CE 4 is refined into CE [17] * CE 3 is refined into CE [18] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [15] --> Loop 13 * CEs [14] --> Loop 14 * CEs [16] --> Loop 15 * CEs [17] --> Loop 16 * CEs [18] --> Loop 17 * CEs [13] --> Loop 18 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) * RF of phase [13]: [V__0-1] #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) * Partial RF of phase [13]: - RF of loop [13:1]: V__0-1 * Partial RF of phase [15,16]: - RF of loop [15:1]: -V__0+1 depends on loops [16:1] V__01 depends on loops [16:1] ### Specialization of cost equations eval_foo_bb0_in/3 * CE 2 is refined into CE [19,20,21,22,23,24] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [23] --> Loop 19 * CEs [24] --> Loop 20 * CEs [21] --> Loop 21 * CEs [22] --> Loop 22 * CEs [19] --> Loop 23 * CEs [20] --> Loop 24 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) ### Specialization of cost equations eval_foo_start/5 * CE 1 is refined into CE [25,26,27,28,29,30] ### Cost equations --> "Loop" of eval_foo_start/5 * CEs [30] --> Loop 25 * CEs [29] --> Loop 26 * CEs [28] --> Loop 27 * CEs [27] --> Loop 28 * CEs [26] --> Loop 29 * CEs [25] --> Loop 30 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_tmp,V_xtmp,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_tmp,V_xtmp,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb3_in(V__01,V__0,V__02,B,C): * Chain [[11],12]: 1*it(11)+0 Such that:it(11) =< -V__01+V__02 with precondition: [B=2,C>=1,V__0>=V__02,V__01>=C,V__02>=V__01+C] * Chain [12]: 0 with precondition: [B=2,V__02=C,V__02>=1,V__01>=V__02,V__0>=V__02,V__0+V__01>=3] #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): * Chain [[17]]...: 1*it(17)+0 with precondition: [V__01=V__0,V__01>=1,B=3] * Chain [[15,16]]...: 2*it(15)+0 with precondition: [B=3] * Chain [[15,16],18]: 2*it(15)+0 with precondition: [V__0=0,B=3] * Chain [[13],[17]]...: 2*it(13)+1*it(17)+0 Such that:aux(32) =< V__0 it(13) =< aux(32) with precondition: [B=3,V__01>=1,V__0>=V__01+1] * Chain [18]: 0 with precondition: [V__01=0,B=3] * Chain [14,[13],[17]]...: 2*it(13)+1*it(17)+1 Such that:aux(32) =< V__01 it(13) =< aux(32) with precondition: [B=3,V__0>=1,V__01>=V__0+1] #### Cost of chains of eval_foo_bb0_in(V_x,V_y,B): * Chain [24]: 2*s(4)+0 with precondition: [V_x=0] * Chain [23]: 0 with precondition: [V_y=0] * Chain [22]...: 2*s(5)+0 with precondition: [] * Chain [21]...: 1*s(6)+0 with precondition: [V_x=V_y,V_x>=1] * Chain [20]...: 2*s(8)+1*s(9)+1 Such that:s(7) =< V_y s(8) =< s(7) with precondition: [V_x>=1,V_y>=V_x+1] * Chain [19]...: 2*s(11)+1*s(12)+0 Such that:s(10) =< V_x s(11) =< s(10) with precondition: [V_y>=1,V_x>=V_y+1] #### Cost of chains of eval_foo_start(V_x,V_y,V_tmp,V_xtmp,B): * Chain [30]: 2*s(13)+0 with precondition: [V_x=0] * Chain [29]: 0 with precondition: [V_y=0] * Chain [28]...: 2*s(14)+0 with precondition: [] * Chain [27]...: 1*s(15)+0 with precondition: [V_x=V_y,V_x>=1] * Chain [26]...: 2*s(17)+1*s(18)+1 Such that:s(16) =< V_y s(17) =< s(16) with precondition: [V_x>=1,V_y>=V_x+1] * Chain [25]...: 2*s(20)+1*s(21)+0 Such that:s(19) =< V_x s(20) =< s(19) with precondition: [V_y>=1,V_x>=V_y+1] Closed-form bounds of eval_foo_start(V_x,V_y,V_tmp,V_xtmp,B): ------------------------------------- * Chain [30] with precondition: [V_x=0] - Upper bound: inf - Complexity: infinity * Chain [29] with precondition: [V_y=0] - Upper bound: 0 - Complexity: constant * Chain [28]... with precondition: [] - Upper bound: inf - Complexity: infinity * Chain [27]... with precondition: [V_x=V_y,V_x>=1] - Upper bound: inf - Complexity: infinity * Chain [26]... with precondition: [V_x>=1,V_y>=V_x+1] - Upper bound: inf - Complexity: infinity * Chain [25]... with precondition: [V_y>=1,V_x>=V_y+1] - Upper bound: inf - Complexity: infinity ### Maximum cost of eval_foo_start(V_x,V_y,V_tmp,V_xtmp,B): inf Asymptotic class: infinity * Total analysis performed in 263 ms.