details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.220025 seconds
cpu usage	0.143971
user time	0.110654
system time	0.033317
max virtual memory	113176.0
max residence set size	10964.0

stage attributes

key	value
starexec-result	MAYBE

output

0.04/0.11 MAYBE 0.04/0.11 0.04/0.11 Preprocessing Cost Relations 0.04/0.11 ===================================== 0.04/0.11 0.04/0.11 #### Computed strongly connected components 0.04/0.11 0. recursive : [eval_foo_2/3,eval_foo_3/4,eval_foo_4/5,eval_foo_5/6,eval_foo_bb1_in/3,eval_foo_bb2_in/3] 0.04/0.11 1. non_recursive : [eval_foo_stop/1] 0.04/0.11 2. non_recursive : [eval_foo_bb3_in/1] 0.04/0.11 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.04/0.11 4. non_recursive : [eval_foo_bb0_in/3] 0.04/0.11 5. non_recursive : [eval_foo_start/4] 0.04/0.11 0.04/0.11 #### Obtained direct recursion through partial evaluation 0.04/0.11 0. SCC is partially evaluated into eval_foo_bb1_in/3 0.04/0.11 1. SCC is completely evaluated into other SCCs 0.04/0.11 2. SCC is completely evaluated into other SCCs 0.04/0.11 3. SCC is completely evaluated into other SCCs 0.04/0.11 4. SCC is partially evaluated into eval_foo_bb0_in/3 0.04/0.11 5. SCC is partially evaluated into eval_foo_start/4 0.04/0.11 0.04/0.11 Control-Flow Refinement of Cost Relations 0.04/0.11 ===================================== 0.04/0.11 0.04/0.11 ### Specialization of cost equations eval_foo_bb1_in/3 0.04/0.11 * CE 4 is refined into CE [5] 0.04/0.11 * CE 3 is refined into CE [6] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_bb1_in/3 0.04/0.11 * CEs [6] --> Loop 5 0.04/0.11 * CEs [5] --> Loop 6 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 0.04/0.11 0.04/0.11 0.04/0.11 ### Specialization of cost equations eval_foo_bb0_in/3 0.04/0.11 * CE 2 is refined into CE [7,8,9] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_bb0_in/3 0.04/0.11 * CEs [9] --> Loop 7 0.04/0.11 * CEs [7] --> Loop 8 0.04/0.11 * CEs [8] --> Loop 9 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_bb0_in(V_i,V_j,B) 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_bb0_in(V_i,V_j,B) 0.04/0.11 0.04/0.11 0.04/0.11 ### Specialization of cost equations eval_foo_start/4 0.04/0.11 * CE 1 is refined into CE [10,11,12] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_start/4 0.04/0.11 * CEs [12] --> Loop 10 0.04/0.11 * CEs [11] --> Loop 11 0.04/0.11 * CEs [10] --> Loop 12 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_start(V_i,V_j,V_r,B) 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_start(V_i,V_j,V_r,B) 0.04/0.11 0.04/0.11 0.04/0.11 Computing Bounds 0.04/0.11 ===================================== 0.04/0.11 0.04/0.11 #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): 0.04/0.11 * Chain [[5]]...: 1*it(5)+0 0.04/0.11 with precondition: [V__0>=V__01+1,B=2] 0.04/0.11 0.04/0.11 * Chain [[5],6]: 1*it(5)+0 0.04/0.11 with precondition: [B=2,V__0>=V__01+1] 0.04/0.11 0.04/0.11 * Chain [6]: 0 0.04/0.11 with precondition: [B=2,V__01>=V__0] 0.04/0.11 0.04/0.11 0.04/0.11 #### Cost of chains of eval_foo_bb0_in(V_i,V_j,B): 0.04/0.11 * Chain [9]: 0 0.04/0.11 with precondition: [V_j>=V_i] 0.04/0.11 0.04/0.11 * Chain [8]: 1*s(1)+0 0.04/0.11 with precondition: [V_i>=V_j+1] 0.04/0.11 0.04/0.11 * Chain [7]...: 1*s(2)+0 0.04/0.11 with precondition: [V_i>=V_j+1] 0.04/0.11 0.04/0.11 0.04/0.11 #### Cost of chains of eval_foo_start(V_i,V_j,V_r,B): 0.04/0.11 * Chain [12]: 0 0.04/0.11 with precondition: [V_j>=V_i] 0.04/0.11 0.04/0.11 * Chain [11]: 1*s(3)+0 0.04/0.11 with precondition: [V_i>=V_j+1] 0.04/0.11 0.04/0.11 * Chain [10]...: 1*s(4)+0 0.04/0.11 with precondition: [V_i>=V_j+1] popout

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

job log

popout

actions

all output return to Complexity_C_Integer 2019-03-21 04.38