details

property	value
status	complete
benchmark	Masse-VMCAI2014-Fig1a_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n037.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.440560102463 seconds
cpu usage	0.358804158
max memory	9428992.0

stage attributes

key	value
output-size	4181
starexec-result	WORST_CASE(?,O(n^2))

output

/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^2)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/3,eval_foo_bb2_in/3] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb3_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/3] 5. non_recursive : [eval_foo_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/3 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into eval_foo_bb0_in/3 5. SCC is partially evaluated into eval_foo_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/3 * CE 5 is refined into CE [6] * CE 3 is refined into CE [7] * CE 4 is refined into CE [8] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [7] --> Loop 6 * CEs [8] --> Loop 7 * CEs [6] --> Loop 8 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) * Partial RF of phase [6,7]: - RF of loop [6:1]: V__0+1 depends on loops [7:1] -V__01/2 depends on loops [7:1] - RF of loop [7:1]: V__01+1 depends on loops [6:1] V__01+2*V__0+1 ### Specialization of cost equations eval_foo_bb0_in/3 * CE 2 is refined into CE [9,10] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [10] --> Loop 9 * CEs [9] --> Loop 10 ### Ranking functions of CR eval_foo_bb0_in(V_a,V_b,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_a,V_b,B) ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [11,12] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [12] --> Loop 11 * CEs [11] --> Loop 12 ### Ranking functions of CR eval_foo_start(V_a,V_b,B) #### Partial ranking functions of CR eval_foo_start(V_a,V_b,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): * Chain [[6,7],8]: 1*it(6)+1*it(7)+0 Such that:aux(29) =< V__01+2*V__0 it(7) =< V__01+2*V__0+1 aux(52) =< V__01+2*V__0+1/2 aux(2) =< -V__01/2 aux(4) =< V__0+1 aux(50) =< aux(29) aux(42) =< aux(29)+1/2 aux(1) =< it(7)*aux(52) aux(3) =< it(7)*aux(50) aux(1) =< it(7)*aux(42) aux(3) =< it(7)*aux(29) it(6) =< aux(3)+aux(4) it(6) =< aux(1)+aux(2) with precondition: [B=2,V__0>=0] popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl C Integ Progr 85445