details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	8.60905790329 seconds
cpu usage	18.675428301
max memory	2.48160256E8

stage attributes

key	value
output-size	4759
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, ((0 + (~(1) * x_5^0)) <= 0), par{x_5^0 -> (1 + x_5^0)}> <l3, l2, true> <l2, l4, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef7 = undef7), par{Result_4^0 -> undef7}> <l5, l1, true> Fresh variables: undef7, Undef variables: undef7, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, true> <l2, l2, ((0 + (~(1) * x_5^0)) <= 0), par{x_5^0 -> (1 + x_5^0)}> <l2, l4, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef7 = undef7)> Fresh variables: undef7, Undef variables: undef7, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: x_5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l2, true, {all remain the same}> Graph 2 <l2, l4, 1 + x_5^0 <= 0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001467 Checking conditional termination of SCC {l2}... popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634