details

property	value
status	complete
benchmark	svcomp_b.09-no-inv_assume.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n084.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.348624944687 seconds
cpu usage	0.190113511
max memory	8826880.0

stage attributes

key	value
output-size	4040
starexec-result	WORST_CASE(?,O(n^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(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/3,eval_foo_bb2_in/3] 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/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/3 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/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/3 * CE 9 is refined into CE [10] * CE 5 is refined into CE [11] * CE 6 is discarded (unfeasible) * CE 7 is refined into CE [12] * CE 8 is discarded (unfeasible) ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [11] --> Loop 10 * CEs [12] --> Loop 11 * CEs [10] --> Loop 12 ### Ranking functions of CR eval_foo_bb1_in(V_y,V__01,B) * RF of phase [10]: [V__01] #### Partial ranking functions of CR eval_foo_bb1_in(V_y,V__01,B) * Partial RF of phase [10]: - RF of loop [10:1]: V__01 ### Specialization of cost equations eval_foo_bb0_in/3 * CE 4 is refined into CE [13,14] * CE 3 is refined into CE [15] * CE 2 is refined into CE [16] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [13] --> Loop 13 * CEs [14] --> Loop 14 * CEs [15] --> Loop 15 * CEs [16] --> Loop 16 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) ### Specialization of cost equations eval_foo_start/4 * CE 1 is refined into CE [17,18,19,20] ### Cost equations --> "Loop" of eval_foo_start/4 * CEs [20] --> Loop 17 * CEs [19] --> Loop 18 * CEs [18] --> Loop 19 * CEs [17] --> Loop 20 ### Ranking functions of CR eval_foo_start(V_c,V_x,V_y,B) #### Partial ranking functions of CR eval_foo_start(V_c,V_x,V_y,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V_y,V__01,B): * Chain [[10],12]: 1*it(10)+0 Such that:it(10) =< V__01 with precondition: [B=2,V__01>=1,V_y>=V__01] * Chain [11,[10],12]: 1*it(10)+1 Such that:it(10) =< V_y with precondition: [B=2,V_y>=1,V__01>=V_y+1] #### Cost of chains of eval_foo_bb0_in(V_x,V_y,B): popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445