details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.292067050934 seconds
cpu usage	0.213810167
max memory	8695808.0

stage attributes

key	value
output-size	3775
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_0/2,eval_foo_1/3,eval_foo_12/5,eval_foo_13/6,eval_foo_4/3,eval_foo_5/4,eval_foo_8/4,eval_foo_9/5,eval_foo_bb1_in/2,eval_foo_bb2_in/2,eval_foo_bb3_in/3,eval_foo_bb4_in/3,eval_foo_bb5_in/4,eval_foo_bb6_in/4,eval_foo_bb7_in/5,eval_foo_bb8_in/5] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb9_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/2] #### 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/2 5. SCC is partially evaluated into eval_foo_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/2 * CE 8 is refined into CE [9] * CE 7 is refined into CE [10] * CE 6 is refined into CE [11] * CE 3 is refined into CE [12] * CE 4 is refined into CE [13] * CE 5 is refined into CE [14] ### Cost equations --> "Loop" of eval_foo_bb1_in/2 * CEs [10] --> Loop 9 * CEs [11] --> Loop 10 * CEs [12] --> Loop 11 * CEs [13] --> Loop 12 * CEs [14] --> Loop 13 * CEs [9] --> Loop 14 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) ### Specialization of cost equations eval_foo_bb0_in/2 * CE 2 is refined into CE [15,16,17] ### Cost equations --> "Loop" of eval_foo_bb0_in/2 * CEs [17] --> Loop 15 * CEs [16] --> Loop 16 * CEs [15] --> Loop 17 ### 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/2 * CE 1 is refined into CE [18,19,20] ### Cost equations --> "Loop" of eval_foo_start/2 * CEs [20] --> Loop 18 * CEs [19] --> Loop 19 * CEs [18] --> Loop 20 ### Ranking functions of CR eval_foo_start(V_x,B) #### Partial ranking functions of CR eval_foo_start(V_x,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__0,B): * Chain [[9,10,11,12]]...: 4*it(9)+0 with precondition: [V__0>=0,B=2] * Chain [[9,10,11,12],13,14]: 4*it(9)+1 with precondition: [B=2,V__0>=0] * Chain [14]: 0 with precondition: [B=2,0>=V__0+1] * Chain [13,14]: 1 with precondition: [B=2,V__0>=0] #### Cost of chains of eval_foo_bb0_in(V_x,B): * Chain [17]: 0 with precondition: [0>=V_x+1] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445