details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	4.23660612106 seconds
cpu usage	9.461209127
max memory	3.83799296E8

stage attributes

key	value
output-size	3675
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l6, true> <l1, l2, (1 <= (0 + x^0)), par{y^0 -> (0 + x^0)}> <l2, l3, ((0 + y^0) <= 0)> <l2, l4, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}> <l4, l2, true> <l3, l1, true, par{y^0 -> (1 + y^0)}> <l3, l1, true, par{x^0 -> (~(1) + x^0), y^0 -> (1 + y^0)}> <l5, l1, true> <l6, l5, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (y^0 = (0 + x^0)) /\ (1 <= (0 + x^0))> <l2, l2, ((0 + y^0) <= 0) /\ (1 <= (0 + x^0)), par{y^0 -> (0 + x^0)}> <l2, l2, ((0 + y^0) <= 0) /\ (1 <= (0 + (~(1) + x^0))), par{x^0 -> (~(1) + x^0), y^0 -> (0 + (~(1) + x^0))}> <l2, l2, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= x^0 /\ y^0 <= 0, {y^0 -> x^0, rest remain the same}> <l2, l2, y^0 <= 0 /\ 2 <= x^0, {x^0 -> -1 + x^0, y^0 -> -1 + x^0, rest remain the same}> <l2, l2, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, y^0 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= x^0 /\ x^0 = y^0, {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.006655 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001502s �[33mRanking function: �[36m-1 + x^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