details

property	value
status	complete
benchmark	BrockschmidtCookFuhs-CAV2013-Introduction_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n108.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.216138839722 seconds
cpu usage	0.130723775
max memory	8220672.0

stage attributes

key	value
output-size	3126
starexec-result	WORST_CASE(?,O(n^1))

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^1)) 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/2] 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/2 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 4 is refined into CE [5] * CE 3 is refined into CE [6] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [6] --> Loop 5 * CEs [5] --> Loop 6 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) * RF of phase [5]: [V__0] #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) * Partial RF of phase [5]: - RF of loop [5:1]: V__0 ### Specialization of cost equations eval_foo_bb0_in/2 * CE 2 is refined into CE [7,8] ### Cost equations --> "Loop" of eval_foo_bb0_in/2 * CEs [8] --> Loop 7 * CEs [7] --> Loop 8 ### Ranking functions of CR eval_foo_bb0_in(V_x,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,B) ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [9,10] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [10] --> Loop 9 * CEs [9] --> Loop 10 ### Ranking functions of CR eval_foo_start(V_x,V_y,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): * Chain [[5],6]: 1*it(5)+0 Such that:it(5) =< V__0 with precondition: [B=2,V__01>=1,V__0>=1] * Chain [6]: 0 with precondition: [B=2,0>=V__0,V__01>=1] #### Cost of chains of eval_foo_bb0_in(V_x,B): * Chain [8]: 0 with precondition: [0>=V_x] * Chain [7]: 1*s(1)+0 Such that:s(1) =< V_x with precondition: [V_x>=1] #### Cost of chains of eval_foo_start(V_x,V_y,B): * Chain [10]: 0 with precondition: [0>=V_x] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445