details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.341688871384 seconds
cpu usage	0.261876415
max memory	8900608.0

stage attributes

key	value
output-size	5845
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_2/4,eval_foo_3/5,eval_foo_bb1_in/4,eval_foo_bb2_in/4,eval_foo_bb3_in/5,eval_foo_bb4_in/5] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb5_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/4] #### 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/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/4 * CE 10 is refined into CE [11] * CE 9 is refined into CE [12] * CE 8 is refined into CE [13] ### Cost equations --> "Loop" of eval_foo_bb1_in/4 * CEs [12] --> Loop 11 * CEs [13] --> Loop 12 * CEs [11] --> Loop 13 ### Ranking functions of CR eval_foo_bb1_in(V_N,V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V_N,V__01,V__0,B) * Partial RF of phase [11,12]: - RF of loop [11:1]: V_N-V__0+1 -V__0+536870912 ### Specialization of cost equations eval_foo_bb0_in/4 * CE 6 is refined into CE [14] * CE 2 is refined into CE [15] * CE 4 is refined into CE [16] * CE 3 is refined into CE [17] * CE 5 is refined into CE [18] * CE 7 is refined into CE [19,20,21] ### Cost equations --> "Loop" of eval_foo_bb0_in/4 * CEs [21] --> Loop 14 * CEs [14] --> Loop 15 * CEs [15] --> Loop 16 * CEs [16] --> Loop 17 * CEs [17] --> Loop 18 * CEs [20] --> Loop 19 * CEs [18] --> Loop 20 * CEs [19] --> Loop 21 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_N,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_N,B) ### Specialization of cost equations eval_foo_start/4 * CE 1 is refined into CE [22,23,24,25,26,27,28,29] ### Cost equations --> "Loop" of eval_foo_start/4 * CEs [29] --> Loop 22 * CEs [28] --> Loop 23 * CEs [27] --> Loop 24 * CEs [26] --> Loop 25 * CEs [25] --> Loop 26 * CEs [24] --> Loop 27 * CEs [23] --> Loop 28 * CEs [22] --> Loop 29 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_N,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_N,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V_N,V__01,V__0,B): * Chain [[11,12]]...: 1*it(11)+1*it(12)+0 Such that:it(11) =< V_N-V__0+1 popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445