details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.206588983536 seconds
cpu usage	0.119889749
max memory	8228864.0

stage attributes

key	value
output-size	2754
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/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/1] 5. non_recursive : [eval_foo_start/3] #### 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/1 5. SCC is partially evaluated into eval_foo_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/3 * CE 4 is discarded (unfeasible) * CE 3 is refined into CE [5] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [5] --> Loop 5 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) Warning: no base case found for predicate ### Specialization of cost equations eval_foo_bb0_in/1 * CE 2 is refined into CE [6] ### Cost equations --> "Loop" of eval_foo_bb0_in/1 * CEs [6] --> Loop 6 ### Ranking functions of CR eval_foo_bb0_in(B) #### Partial ranking functions of CR eval_foo_bb0_in(B) Warning: no base case found for predicate ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [7] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [7] --> Loop 7 ### Ranking functions of CR eval_foo_start(V_i,V_j,B) #### Partial ranking functions of CR eval_foo_start(V_i,V_j,B) Warning: no base case found for predicate Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): * Chain [[5]]...: 1*it(5)+0 with precondition: [V__01>=100,V__01=V__0+100,B=2] #### Cost of chains of eval_foo_bb0_in(B): * Chain [6]...: 1*s(1)+0 with precondition: [] #### Cost of chains of eval_foo_start(V_i,V_j,B): * Chain [7]...: 1*s(2)+0 with precondition: [] Closed-form bounds of eval_foo_start(V_i,V_j,B): ------------------------------------- * Chain [7]... with precondition: [] - Upper bound: inf - Complexity: infinity ### Maximum cost of eval_foo_start(V_i,V_j,B): inf Asymptotic class: infinity * Total analysis performed in 29 ms. popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445