details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	13.5514118671 seconds
cpu usage	33.877609961
max memory	8.41314304E8

stage attributes

key	value
output-size	4291
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, l5, true> <l1, l2, true> <l2, l3, (undef2 = (~(1) + x_5^0)) /\ ((0 + undef2) <= 0), par{x_5^0 -> undef2}> <l3, l2, true> <l2, l4, (undef4 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef4)), par{x_5^0 -> undef4}> <l4, l2, true> <l5, l1, true> Fresh variables: undef2, undef4, Undef variables: undef2, undef4, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, true> <l2, l2, (undef2 = (~(1) + x_5^0)) /\ ((0 + undef2) <= 0), par{x_5^0 -> undef2}> <l2, l2, (undef4 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef4)), par{x_5^0 -> undef4}> Fresh variables: undef2, undef4, Undef variables: undef2, undef4, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, undef2 <= 0 /\ x_5^0 = 1 + undef2, {x_5^0 -> undef2, rest remain the same}> <l2, l2, 1 <= undef4 /\ x_5^0 = 1 + undef4, {x_5^0 -> undef4, rest remain the same}> Variables: x_5^0 Precedence: Graph 0 Graph 1 <l0, l2, true, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002513 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001036s �[33mRanking function: �[36m-1 + x_5^0�[0m New Graphs: popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634