details

property	value
status	complete
benchmark	ChenCookFuhsNimkarOHearn-TACAS2014-Introduction_false-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n113.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.217589139938 seconds
cpu usage	0.134894663
max memory	8388608.0

stage attributes

key	value
output-size	3644
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_2/2,eval_foo_3/3,eval_foo_bb1_in/2,eval_foo_bb2_in/2] 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/2 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/2 * CE 5 is refined into CE [6] * CE 4 is refined into CE [7] ### Cost equations --> "Loop" of eval_foo_bb1_in/2 * CEs [7] --> Loop 6 * CEs [6] --> Loop 7 ### Ranking functions of CR eval_foo_bb1_in(V__1,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__1,B) ### Specialization of cost equations eval_foo_bb0_in/3 * CE 2 is refined into CE [8,9,10] * CE 3 is refined into CE [11] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [9] --> Loop 8 * CEs [8] --> Loop 9 * CEs [11] --> Loop 10 * CEs [10] --> Loop 11 ### Ranking functions of CR eval_foo_bb0_in(V_k,V_i,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_k,V_i,B) ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [12,13,14,15] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [15] --> Loop 12 * CEs [14] --> Loop 13 * CEs [13] --> Loop 14 * CEs [12] --> Loop 15 ### Ranking functions of CR eval_foo_start(V_k,V_i,B) #### Partial ranking functions of CR eval_foo_start(V_k,V_i,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__1,B): * Chain [[6]]...: 1*it(6)+0 with precondition: [V__1>=0,B=2] * Chain [[6],7]: 1*it(6)+0 with precondition: [B=2,V__1>=0] * Chain [7]: 0 with precondition: [B=2,0>=V__1+1] #### Cost of chains of eval_foo_bb0_in(V_k,V_i,B): * Chain [11]...: 1*s(1)+0 with precondition: [V_k>=0,V_i>=0] * Chain [10]: 0 with precondition: [0>=V_k+1] * Chain [9]: 0 with precondition: [0>=V_i+1,V_k>=0] * Chain [8]: 1*s(2)+0 popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445