details

property	value
status	complete
benchmark	armc-difficult_foo3.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n033.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	6.96843 seconds
cpu usage	6.96698
user time	6.35548
system time	0.6115
max virtual memory	769392.0
max residence set size	105064.0

stage attributes

key	value
starexec-result	YES

output

6.94/6.96 YES 6.94/6.96 6.94/6.96 Solver Timeout: 4 6.94/6.96 Global Timeout: 300 6.94/6.96 No parsing errors! 6.94/6.96 Init Location: 0 6.94/6.96 Transitions: 6.94/6.96 <l0, l31, true> 6.94/6.96 <l1, l2, true> 6.94/6.96 <l3, l4, ((1 + next^0) <= (1 + N^0))> 6.94/6.96 <l5, l1, ((1 + next^0) <= (1 + N^0)), par{i^0 -> (1 + i^0)}> 6.94/6.96 <l6, l5, ((1 + s_ab^0) <= 1), par{s_ab^0 -> 1}> 6.94/6.96 <l6, l5, (1 <= (0 + s_ab^0)), par{s_ab^0 -> 0}> 6.94/6.96 <l7, l8, (2 <= (0 + pos^0)) /\ (0 <= (0 + z^0)), par{next^0 -> (1 + next^0), pos^0 -> 0}> 6.94/6.96 <l7, l8, ((0 + pos^0) <= 1) /\ (1 <= (0 + c2^0)), par{pos^0 -> (1 + pos^0)}> 6.94/6.96 <l8, l3, (2 <= (0 + c2^0))> 6.94/6.96 <l8, l3, ((1 + c2^0) <= 1)> 6.94/6.96 <l8, l6, ((0 + c2^0) <= 1) /\ (1 <= (0 + c2^0))> 6.94/6.96 <l9, l7, (1 <= (0 + pos^0))> 6.94/6.96 <l9, l8, ((0 + pos^0) <= 0) /\ (1 <= (0 + c2^0)), par{pos^0 -> (1 + pos^0)}> 6.94/6.96 <l10, l8, (1 <= (0 + z^0)), par{z^0 -> (~(1) + z^0)}> 6.94/6.96 <l10, l9, ((0 + z^0) <= 0)> 6.94/6.96 <l11, l10, (0 <= (0 + c2^0)) /\ ((0 + c2^0) <= 1)> 6.94/6.96 <l12, l13, ((1 + lr^0) <= 1)> 6.94/6.96 <l12, l13, (1 <= (0 + lr^0)), par{rrep^0 -> 3}> 6.94/6.96 <l14, l12, (1 <= (0 + lr^0))> 6.94/6.96 <l14, l13, ((0 + lr^0) <= 0), par{rrep^0 -> 2}> 6.94/6.96 <l15, l12, (1 <= (0 + fr^0))> 6.94/6.96 <l15, l14, ((0 + fr^0) <= 0)> 6.94/6.96 <l16, l15, true> 6.94/6.96 <l13, l11, ((1 + r_ab^0) <= 1), par{r_ab^0 -> 1}> 6.94/6.96 <l13, l11, (1 <= (0 + r_ab^0)), par{r_ab^0 -> 0}> 6.94/6.96 <l17, l16, (1 <= (0 + lr^0))> 6.94/6.96 <l17, l16, ((1 + lr^0) <= 0)> 6.94/6.96 <l17, l13, ((0 + lr^0) <= 0) /\ (0 <= (0 + lr^0)), par{rrep^0 -> 1}> 6.94/6.96 <l18, l15, ((0 + fr^0) <= 0) /\ (0 <= (0 + fr^0))> 6.94/6.96 <l18, l17, (1 <= (0 + fr^0))> 6.94/6.96 <l18, l17, ((1 + fr^0) <= 0)> 6.94/6.96 <l19, l11, ((1 + br^0) <= (0 + r_ab^0))> 6.94/6.96 <l19, l11, ((1 + r_ab^0) <= (0 + br^0))> 6.94/6.96 <l19, l18, ((0 + r_ab^0) <= (0 + br^0)) /\ ((0 + br^0) <= (0 + r_ab^0))> 6.94/6.96 <l20, l19, true, par{recv^0 -> 1}> 6.94/6.96 <l21, l20, (1 <= (0 + recv^0))> 6.94/6.96 <l21, l20, ((0 + recv^0) <= 0), par{r_ab^0 -> (0 + br^0)}> 6.94/6.96 <l22, l23, (2 <= (0 + pos^0)) /\ (0 <= (0 + z^0)), par{next^0 -> (1 + next^0), pos^0 -> 0}> 6.94/6.96 <l22, l23, ((0 + pos^0) <= 1) /\ (1 <= (0 + c1^0)), par{pos^0 -> (1 + pos^0)}> 6.94/6.96 <l23, l3, ((1 + c1^0) <= 1)> 6.94/6.96 <l23, l21, (1 <= (0 + c1^0)), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0)}> 6.94/6.96 <l24, l22, (1 <= (0 + pos^0))> 6.94/6.96 <l24, l23, ((0 + pos^0) <= 0) /\ (1 <= (0 + c1^0)), par{pos^0 -> (1 + pos^0)}> 6.94/6.96 <l25, l23, (1 <= (0 + z^0)), par{z^0 -> (~(1) + z^0)}> 6.94/6.96 <l25, l24, ((0 + z^0) <= 0)> 6.94/6.96 <l26, l1, (0 <= (0 + z^0)) /\ (1 <= (0 + N^0)), par{i^0 -> 0, next^0 -> 1, pos^0 -> 0}> 6.94/6.96 <l4, l25, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1)> 6.94/6.96 <l27, l4, true, par{bs^0 -> (0 + s_ab^0)}> 6.94/6.96 <l28, l27, ((1 + i^0) <= (~(1) + N^0)), par{ls^0 -> 0}> 6.94/6.96 <l28, l27, ((~(1) + N^0) <= (0 + i^0)), par{ls^0 -> 1}> 6.94/6.96 <l29, l28, (1 <= (0 + i^0)), par{fs^0 -> 0}> 6.94/6.96 <l29, l28, ((0 + i^0) <= 0), par{fs^0 -> 1}> 6.94/6.96 <l2, l30, ((0 + N^0) <= (0 + i^0))> 6.94/6.96 <l2, l29, ((1 + i^0) <= (0 + N^0))> 6.94/6.96 <l31, l26, true> 6.94/6.96 6.94/6.96 Fresh variables: 6.94/6.96 6.94/6.96 Undef variables: 6.94/6.96 6.94/6.96 Abstraction variables: 6.94/6.96 6.94/6.96 Exit nodes: 6.94/6.96 6.94/6.96 Accepting locations: 6.94/6.96 6.94/6.96 Asserts: 6.94/6.96 6.94/6.96 Preprocessed LLVMGraph 6.94/6.96 Init Location: 0 6.94/6.96 Transitions: 6.94/6.96 <l0, l4, (i^0 = 0) /\ (next^0 = 1) /\ (pos^0 = 0) /\ (0 <= (0 + z^0)) /\ (1 <= (0 + N^0)) /\ ((1 + 0) <= (0 + N^0)) /\ ((0 + 0) <= 0) /\ ((1 + 0) <= (~(1) + N^0)), par{bs^0 -> (0 + s_ab^0), fs^0 -> 1, ls^0 -> 0}> 6.94/6.96 <l0, l4, (i^0 = 0) /\ (next^0 = 1) /\ (pos^0 = 0) /\ (0 <= (0 + z^0)) /\ (1 <= (0 + N^0)) /\ ((1 + 0) <= (0 + N^0)) /\ ((0 + 0) <= 0) /\ ((~(1) + N^0) <= (0 + 0)), par{bs^0 -> (0 + s_ab^0), fs^0 -> 1, ls^0 -> 1}> 6.94/6.96 <l4, l4, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ (1 <= (0 + z^0)) /\ ((1 + c1^0) <= 1) /\ ((1 + next^0) <= (1 + N^0)), par{z^0 -> (~(1) + z^0)}> 6.94/6.96 <l4, l19, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ (1 <= (0 + z^0)) /\ (1 <= (0 + c1^0)) /\ (1 <= (0 + recv^0)), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0), recv^0 -> 1, z^0 -> (~(1) + z^0)}> 6.94/6.96 <l4, l19, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ (1 <= (0 + z^0)) /\ (1 <= (0 + c1^0)) /\ ((0 + recv^0) <= 0), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0), r_ab^0 -> (0 + (0 + bs^0)), recv^0 -> 1, z^0 -> (~(1) + z^0)}> 6.94/6.96 <l4, l4, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ (2 <= (0 + pos^0)) /\ (0 <= (0 + z^0)) /\ ((1 + c1^0) <= 1) /\ ((1 + (1 + next^0)) <= (1 + N^0)), par{next^0 -> (1 + next^0), pos^0 -> 0}> 6.94/6.96 <l4, l19, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ (2 <= (0 + pos^0)) /\ (0 <= (0 + z^0)) /\ (1 <= (0 + c1^0)) /\ (1 <= (0 + recv^0)), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0), next^0 -> (1 + next^0), pos^0 -> 0, recv^0 -> 1}> 6.94/6.96 <l4, l19, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ (2 <= (0 + pos^0)) /\ (0 <= (0 + z^0)) /\ (1 <= (0 + c1^0)) /\ ((0 + recv^0) <= 0), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0), next^0 -> (1 + next^0), pos^0 -> 0, r_ab^0 -> (0 + (0 + bs^0)), recv^0 -> 1}> 6.94/6.96 <l4, l19, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ (1 <= (0 + c1^0)) /\ (1 <= (0 + c1^0)) /\ (1 <= (0 + recv^0)), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0), pos^0 -> (1 + pos^0), recv^0 -> 1}> 6.94/6.96 <l4, l19, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ (1 <= (0 + c1^0)) /\ (1 <= (0 + c1^0)) /\ ((0 + recv^0) <= 0), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0), pos^0 -> (1 + pos^0), r_ab^0 -> (0 + (0 + bs^0)), recv^0 -> 1}> 6.94/6.96 <l4, l19, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + pos^0) <= 0) /\ (1 <= (0 + c1^0)) /\ (1 <= (0 + c1^0)) /\ (1 <= (0 + recv^0)), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0), pos^0 -> (1 + pos^0), recv^0 -> 1}> 6.94/6.96 <l4, l19, (0 <= (0 + c1^0)) /\ ((0 + c1^0) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + pos^0) <= 0) /\ (1 <= (0 + c1^0)) /\ (1 <= (0 + c1^0)) /\ ((0 + recv^0) <= 0), par{br^0 -> (0 + bs^0), fr^0 -> (0 + fs^0), lr^0 -> (0 + ls^0), pos^0 -> (1 + pos^0), r_ab^0 -> (0 + (0 + bs^0)), recv^0 -> 1}> 6.94/6.96 <l6, l30, ((1 + s_ab^0) <= 1) /\ ((1 + next^0) <= (1 + N^0)) /\ ((0 + N^0) <= (0 + (1 + i^0))), par{i^0 -> (1 + i^0), s_ab^0 -> 1}> 6.94/6.96 <l6, l4, ((1 + s_ab^0) <= 1) /\ ((1 + next^0) <= (1 + N^0)) /\ ((1 + (1 + i^0)) <= (0 + N^0)) /\ (1 <= (0 + (1 + i^0))) /\ ((1 + (1 + i^0)) <= (~(1) + N^0)), par{bs^0 -> (0 + 1), fs^0 -> 0, i^0 -> (1 + i^0), ls^0 -> 0, s_ab^0 -> 1}> 6.94/6.96 <l6, l4, ((1 + s_ab^0) <= 1) /\ ((1 + next^0) <= (1 + N^0)) /\ ((1 + (1 + i^0)) <= (0 + N^0)) /\ (1 <= (0 + (1 + i^0))) /\ ((~(1) + N^0) <= (0 + (1 + i^0))), par{bs^0 -> (0 + 1), fs^0 -> 0, i^0 -> (1 + i^0), ls^0 -> 1, s_ab^0 -> 1}> 6.94/6.96 <l6, l4, ((1 + s_ab^0) <= 1) /\ ((1 + next^0) <= (1 + N^0)) /\ ((1 + (1 + i^0)) <= (0 + N^0)) /\ ((0 + (1 + i^0)) <= 0) /\ ((1 + (1 + i^0)) <= (~(1) + N^0)), par{bs^0 -> (0 + 1), fs^0 -> 1, i^0 -> (1 + i^0), ls^0 -> 0, s_ab^0 -> 1}> 6.94/6.96 <l6, l4, ((1 + s_ab^0) <= 1) /\ ((1 + next^0) <= (1 + N^0)) /\ ((1 + (1 + i^0)) <= (0 + N^0)) /\ ((0 + (1 + i^0)) <= 0) /\ ((~(1) + N^0) <= (0 + (1 + i^0))), par{bs^0 -> (0 + 1), fs^0 -> 1, i^0 -> (1 + i^0), ls^0 -> 1, s_ab^0 -> 1}> 6.94/6.96 <l6, l30, (1 <= (0 + s_ab^0)) /\ ((1 + next^0) <= (1 + N^0)) /\ ((0 + N^0) <= (0 + (1 + i^0))), par{i^0 -> (1 + i^0), s_ab^0 -> 0}> 6.94/6.96 <l6, l4, (1 <= (0 + s_ab^0)) /\ ((1 + next^0) <= (1 + N^0)) /\ ((1 + (1 + i^0)) <= (0 + N^0)) /\ (1 <= (0 + (1 + i^0))) /\ ((1 + (1 + i^0)) <= (~(1) + N^0)), par{bs^0 -> (0 + 0), fs^0 -> 0, i^0 -> (1 + i^0), ls^0 -> 0, s_ab^0 -> 0}> 6.94/6.96 <l6, l4, (1 <= (0 + s_ab^0)) /\ ((1 + next^0) <= (1 + N^0)) /\ ((1 + (1 + i^0)) <= (0 + N^0)) /\ (1 <= (0 + (1 + i^0))) /\ ((~(1) + N^0) <= (0 + (1 + i^0))), par{bs^0 -> (0 + 0), fs^0 -> 0, i^0 -> (1 + i^0), ls^0 -> 1, s_ab^0 -> 0}> 6.94/6.96 <l6, l4, (1 <= (0 + s_ab^0)) /\ ((1 + next^0) <= (1 + N^0)) /\ ((1 + (1 + i^0)) <= (0 + N^0)) /\ ((0 + (1 + i^0)) <= 0) /\ ((1 + (1 + i^0)) <= (~(1) + N^0)), par{bs^0 -> (0 + 0), fs^0 -> 1, i^0 -> (1 + i^0), ls^0 -> 0, s_ab^0 -> 0}> 6.94/6.96 <l6, l4, (1 <= (0 + s_ab^0)) /\ ((1 + next^0) <= (1 + N^0)) /\ ((1 + (1 + i^0)) <= (0 + N^0)) /\ ((0 + (1 + i^0)) <= 0) /\ ((~(1) + N^0) <= (0 + (1 + i^0))), par{bs^0 -> (0 + 0), fs^0 -> 1, i^0 -> (1 + i^0), ls^0 -> 1, s_ab^0 -> 0}> popout

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

job log

popout

actions

all output return to Integer_Transition_Systems 2019-03-29 01.54