details

property	value
status	complete
benchmark	Hanoi_plus_false-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n045.star.cs.uiowa.edu
space	Adapted_from_Ton_Chanh_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.226 seconds
cpu usage	0.148863
user time	0.120901
system time	0.027962
max virtual memory	113176.0
max residence set size	10844.0

stage attributes

key	value
starexec-result	MAYBE

output

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