details

property	value
status	complete
benchmark	e-pgarch-succeed.t2_fixed.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n104.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.08717918396 seconds
cpu usage	0.118362988
max memory	4.3548672E7

stage attributes

key	value
output-size	7039
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l13, true> <l1, l2, ((0 + got_SIGHUP^0) <= 0)> <l1, l3, (1 <= (0 + got_SIGHUP^0)) /\ (undef19 = undef19) /\ (undef27 = (0 + undef19)) /\ (undef30 = (0 + undef27)), par{___rho_2_^0 -> undef19, a33^0 -> 1, got_SIGHUP^0 -> 0, ret_XLogArchivingActive44^0 -> undef27, tmp2^0 -> undef30, tt1^0 -> (0 + undef30)}> <l4, l5, true> <l6, l7, true> <l8, l6, (undef71 = undef71), par{___rho_4_^0 -> undef71}> <l9, l8, (((1 + curtime^0) + (~(1) * last_copy_time^0)) <= 1000)> <l9, l8, (1000 <= ((0 + curtime^0) + (~(1) * last_copy_time^0))), par{wakend^0 -> 1}> <l10, l8, (1 <= (0 + wakend^0))> <l10, l9, ((0 + wakend^0) <= 0) /\ (undef151 = undef151) /\ (undef147 = (0 + undef151)), par{a88^0 -> 0, curtime^0 -> (0 + undef147), ret_time1010^0 -> undef147, tmp99^0 -> undef151}> <l2, l10, ((0 + wakend^0) <= 0)> <l2, l10, (1 <= (0 + wakend^0)) /\ (undef184 = undef184) /\ (undef182 = (0 + undef184)), par{a55^0 -> 0, last_copy_time^0 -> (0 + undef182), ret_time77^0 -> undef182, tmp66^0 -> undef184, wakend^0 -> 0}> <l7, l11, true> <l11, l7, true> <l3, l2, (1 <= (0 + tt1^0))> <l3, l6, ((0 + tt1^0) <= 0)> <l12, l1, (undef273 = 1) /\ (undef256 = undef256), par{___rho_1_^0 -> undef256, got_SIGHUP^0 -> (0 + ___rho_2_^0), wakend^0 -> 1}> <l13, l12, true> Fresh variables: undef19, undef27, undef30, undef71, undef147, undef151, undef182, undef184, undef256, undef273, Undef variables: undef19, undef27, undef30, undef71, undef147, undef151, undef182, undef184, undef256, undef273, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l7, (undef273 = 1) /\ (undef256 = undef256) /\ ((0 + (0 + ___rho_2_^0)) <= 0) /\ (1 <= (0 + 1)) /\ (undef184 = undef184) /\ (undef182 = (0 + undef184)) /\ ((0 + 0) <= 0) /\ (undef151 = undef151) /\ (undef147 = (0 + undef151)) /\ (((1 + (0 + undef147)) + (~(1) * (0 + undef182))) <= 1000) /\ (undef71 = undef71), par{last_copy_time^0 -> (0 + undef182)}> <l0, l7, (undef273 = 1) /\ (undef256 = undef256) /\ ((0 + (0 + ___rho_2_^0)) <= 0) /\ (1 <= (0 + 1)) /\ (undef184 = undef184) /\ (undef182 = (0 + undef184)) /\ ((0 + 0) <= 0) /\ (undef151 = undef151) /\ (undef147 = (0 + undef151)) /\ (1000 <= ((0 + (0 + undef147)) + (~(1) * (0 + undef182)))) /\ (undef71 = undef71), par{last_copy_time^0 -> (0 + undef182)}> <l0, l7, (undef273 = 1) /\ (undef256 = undef256) /\ (1 <= (0 + (0 + ___rho_2_^0))) /\ (undef19 = undef19) /\ (undef27 = (0 + undef19)) /\ (undef30 = (0 + undef27)) /\ (1 <= (0 + (0 + undef30))) /\ (1 <= (0 + 1)) /\ (undef184 = undef184) /\ (undef182 = (0 + undef184)) /\ ((0 + 0) <= 0) /\ (undef151 = undef151) /\ (undef147 = (0 + undef151)) /\ (((1 + (0 + undef147)) + (~(1) * (0 + undef182))) <= 1000) /\ (undef71 = undef71), par{___rho_2_^0 -> undef19, last_copy_time^0 -> (0 + undef182)}> <l0, l7, (undef273 = 1) /\ (undef256 = undef256) /\ (1 <= (0 + (0 + ___rho_2_^0))) /\ (undef19 = undef19) /\ (undef27 = (0 + undef19)) /\ (undef30 = (0 + undef27)) /\ (1 <= (0 + (0 + undef30))) /\ (1 <= (0 + 1)) /\ (undef184 = undef184) /\ (undef182 = (0 + undef184)) /\ ((0 + 0) <= 0) /\ (undef151 = undef151) /\ (undef147 = (0 + undef151)) /\ (1000 <= ((0 + (0 + undef147)) + (~(1) * (0 + undef182)))) /\ (undef71 = undef71), par{___rho_2_^0 -> undef19, last_copy_time^0 -> (0 + undef182)}> <l0, l7, (undef273 = 1) /\ (undef256 = undef256) /\ (1 <= (0 + (0 + ___rho_2_^0))) /\ (undef19 = undef19) /\ (undef27 = (0 + undef19)) /\ (undef30 = (0 + undef27)) /\ ((0 + (0 + undef30)) <= 0), par{___rho_2_^0 -> undef19}> <l7, l7, true> Fresh variables: undef19, undef27, undef30, undef71, undef147, undef151, undef182, undef184, undef256, undef273, Undef variables: undef19, undef27, undef30, undef71, undef147, undef151, undef182, undef184, undef256, undef273, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l7, l7, true, {all remain the same}> Variables: Precedence: Graph 0 Graph 1 <l0, l7, ___rho_2_^0 <= 0 /\ undef147 <= 999 + undef182 /\ undef147 = undef151 /\ undef182 = undef184 /\ undef273 = 1, {last_copy_time^0 -> undef182, rest remain the same}> <l0, l7, ___rho_2_^0 <= 0 /\ 1000 + undef182 <= undef147 /\ undef147 = undef151 /\ undef182 = undef184 /\ undef273 = 1, {last_copy_time^0 -> undef182, rest remain the same}> <l0, l7, 1 <= ___rho_2_^0 /\ 1 <= undef30 /\ undef147 <= 999 + undef182 /\ undef19 = undef27 /\ undef27 = undef30 /\ undef147 = undef151 /\ undef182 = undef184 /\ undef273 = 1, {___rho_2_^0 -> undef19, last_copy_time^0 -> undef182, rest remain the same}> <l0, l7, 1 <= ___rho_2_^0 /\ 1 <= undef30 /\ 1000 + undef182 <= undef147 /\ undef19 = undef27 /\ undef27 = undef30 /\ undef147 = undef151 /\ undef182 = undef184 /\ undef273 = 1, {___rho_2_^0 -> undef19, last_copy_time^0 -> undef182, rest remain the same}> <l0, l7, undef30 <= 0 /\ 1 <= ___rho_2_^0 /\ undef19 = undef27 /\ undef27 = undef30 /\ undef273 = 1, {___rho_2_^0 -> undef19, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 7 , 1 ) popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634