details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.325240135193 seconds
cpu usage	0.192406456
max memory	8724480.0

stage attributes

key	value
output-size	3178
starexec-result	WORST_CASE(?,O(1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_1/3,eval_foo_2/4,eval_foo_LeafBlock10_in/4,eval_foo_LeafBlock6_in/4,eval_foo_LeafBlock8_in/4,eval_foo_LeafBlock_in/4,eval_foo_NewDefault_in/4,eval_foo_NodeBlock12_in/4,eval_foo_NodeBlock14_in/4,eval_foo_NodeBlock_in/4,eval_foo_bb1_in/2,eval_foo_bb2_in/2,eval_foo_bb3_in/4,eval_foo_bb4_in/4,eval_foo_bb5_in/4,eval_foo_bb6_in/4,eval_foo_bb7_in/4] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb8_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/1] 5. non_recursive : [eval_foo_start/6] #### 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/1 5. SCC is partially evaluated into eval_foo_start/6 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/2 * CE 4 is refined into CE [5] * CE 3 is refined into CE [6] ### Cost equations --> "Loop" of eval_foo_bb1_in/2 * CEs [6] --> Loop 5 * CEs [5] --> Loop 6 ### Ranking functions of CR eval_foo_bb1_in(V__05,B) * RF of phase [5]: [-V__05+10] #### Partial ranking functions of CR eval_foo_bb1_in(V__05,B) * Partial RF of phase [5]: - RF of loop [5:1]: -V__05+10 ### Specialization of cost equations eval_foo_bb0_in/1 * CE 2 is refined into CE [7] ### Cost equations --> "Loop" of eval_foo_bb0_in/1 * CEs [7] --> Loop 7 ### Ranking functions of CR eval_foo_bb0_in(B) #### Partial ranking functions of CR eval_foo_bb0_in(B) ### Specialization of cost equations eval_foo_start/6 * CE 1 is refined into CE [8] ### Cost equations --> "Loop" of eval_foo_start/6 * CEs [8] --> Loop 8 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_i,V_r,V_N,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_i,V_r,V_N,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__05,B): * Chain [[5],6]: 1*it(5)+0 Such that:it(5) =< -V__05+10 with precondition: [B=2,9>=V__05,V__05>=0] #### Cost of chains of eval_foo_bb0_in(B): * Chain [7]: 1*s(1)+0 Such that:s(1) =< 10 with precondition: [] #### Cost of chains of eval_foo_start(V_x,V_y,V_i,V_r,V_N,B): * Chain [8]: 1*s(2)+0 Such that:s(2) =< 10 with precondition: [] Closed-form bounds of eval_foo_start(V_x,V_y,V_i,V_r,V_N,B): ------------------------------------- * Chain [8] with precondition: [] - Upper bound: 10 popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445