details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.261683940887 seconds
cpu usage	0.141800237
max memory	8364032.0

stage attributes

key	value
output-size	3398
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_bb1_in/4,eval_foo_bb2_in/4] 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/4] 5. non_recursive : [eval_foo_start/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/4 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/4 5. SCC is partially evaluated into eval_foo_start/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/4 * CE 4 is refined into CE [5] * CE 3 is refined into CE [6] ### Cost equations --> "Loop" of eval_foo_bb1_in/4 * CEs [6] --> Loop 5 * CEs [5] --> Loop 6 ### Ranking functions of CR eval_foo_bb1_in(V__02,V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__02,V__01,V__0,B) ### Specialization of cost equations eval_foo_bb0_in/4 * CE 2 is refined into CE [7,8,9] ### Cost equations --> "Loop" of eval_foo_bb0_in/4 * CEs [9] --> Loop 7 * CEs [8] --> Loop 8 * CEs [7] --> Loop 9 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_d1,V_d2,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_d1,V_d2,B) ### Specialization of cost equations eval_foo_start/5 * CE 1 is refined into CE [10,11,12] ### Cost equations --> "Loop" of eval_foo_start/5 * CEs [12] --> Loop 10 * CEs [11] --> Loop 11 * CEs [10] --> Loop 12 ### Ranking functions of CR eval_foo_start(V_x,V_d1,V_d2,V_d1old,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_d1,V_d2,V_d1old,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__02,V__01,V__0,B): * Chain [[5]]...: 1*it(5)+0 with precondition: [V__0>=0,B=2] * Chain [[5],6]: 1*it(5)+0 with precondition: [B=2,V__0>=0] * Chain [6]: 0 with precondition: [B=2,0>=V__0+1] #### Cost of chains of eval_foo_bb0_in(V_x,V_d1,V_d2,B): * Chain [9]: 0 with precondition: [0>=V_x+1] * Chain [8]: 1*s(1)+0 with precondition: [V_x>=0] * Chain [7]...: 1*s(2)+0 with precondition: [V_x>=0] #### Cost of chains of eval_foo_start(V_x,V_d1,V_d2,V_d1old,B): * Chain [12]: 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