details

property	value
status	complete
benchmark	LeikeHeizmann-WST2014-Ex5_false-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n058.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.215356111526 seconds
cpu usage	0.131699717
max memory	8302592.0

stage attributes

key	value
output-size	3346
starexec-result	MAYBE

output

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

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

job log

popout

actions

all output return to Compl C Integ Progr 85445