Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738105
details
property
value
status
complete
benchmark
nested2.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)
0.0631890296936 seconds
cpu usage
0.039605548
max memory
5271552.0
stage attributes
key
value
output-size
4937
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l6, true> <l1, l2, (undef2 = undef2) /\ (undef5 = undef5), par{x_13^0 -> undef2, y_16^0 -> undef5}> <l2, l3, (1 <= (0 + x_13^0)) /\ (undef12 = (0 + __const_5000^0)) /\ (1 <= (0 + undef12)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef12}> <l4, l3, (undef17 = undef17) /\ (undef20 = undef20) /\ (1 <= (0 + y_16^0)) /\ (undef16 = (~(1) + x_13^0)) /\ (undef19 = (~(1) + y_16^0)) /\ ((0 + undef16) <= (~(1) + undef17)) /\ ((~(1) + undef17) <= (0 + undef16)) /\ ((0 + undef19) <= (~(1) + undef20)) /\ ((~(1) + undef20) <= (0 + undef19)) /\ (1 <= (0 + undef17)) /\ (1 <= (0 + undef20)), par{x_13^0 -> undef16, x_27^0 -> undef17, y_16^0 -> undef19, y_28^0 -> undef20}> <l3, l2, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0)> <l3, l5, (undef32 = undef32) /\ (undef35 = undef35) /\ (1 <= (0 + y_16^0)) /\ (undef30 = (~(1) + x_13^0)) /\ (undef33 = (~(1) + y_16^0)) /\ ((0 + undef30) <= (~(1) + undef32)) /\ ((~(1) + undef32) <= (0 + undef30)) /\ ((0 + undef33) <= (~(1) + undef35)) /\ ((~(1) + undef35) <= (0 + undef33)) /\ (1 <= (0 + undef35)), par{x_13^0 -> undef30, x_32^0 -> undef32, y_16^0 -> undef33, y_33^0 -> undef35}> <l5, l3, true> <l6, l1, true> Fresh variables: undef2, undef5, undef12, undef16, undef17, undef19, undef20, undef30, undef32, undef33, undef35, Undef variables: undef2, undef5, undef12, undef16, undef17, undef19, undef20, undef30, undef32, undef33, undef35, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (x_13^0 = undef2) /\ (y_16^0 = undef12) /\ (undef2 = undef2) /\ (undef5 = undef5) /\ (1 <= (0 + undef2)) /\ (undef12 = (0 + __const_5000^0)) /\ (1 <= (0 + undef12)) /\ (1 <= (0 + undef2))> <l3, l3, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0) /\ (1 <= (0 + x_13^0)) /\ (undef12 = (0 + __const_5000^0)) /\ (1 <= (0 + undef12)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef12}> <l3, l3, (undef32 = undef32) /\ (undef35 = undef35) /\ (1 <= (0 + y_16^0)) /\ (undef30 = (~(1) + x_13^0)) /\ (undef33 = (~(1) + y_16^0)) /\ ((0 + undef30) <= (~(1) + undef32)) /\ ((~(1) + undef32) <= (0 + undef30)) /\ ((0 + undef33) <= (~(1) + undef35)) /\ ((~(1) + undef35) <= (0 + undef33)) /\ (1 <= (0 + undef35)), par{x_13^0 -> undef30, y_16^0 -> undef33}> Fresh variables: undef2, undef5, undef12, undef16, undef17, undef19, undef20, undef30, undef32, undef33, undef35, Undef variables: undef2, undef5, undef12, undef16, undef17, undef19, undef20, undef30, undef32, undef33, undef35, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 1 <= x_13^0 /\ 1 <= undef12 /\ y_16^0 <= 0 /\ __const_5000^0 = undef12, {y_16^0 -> undef12, rest remain the same}> <l3, l3, 1 <= y_16^0 /\ 1 <= undef35 /\ 1 + undef30 = undef32 /\ 1 + undef33 = undef35 /\ x_13^0 = 1 + undef30 /\ y_16^0 = 1 + undef33, {x_13^0 -> undef30, y_16^0 -> undef33, rest remain the same}> Variables: __const_5000^0, x_13^0, y_16^0 Precedence: Graph 0 Graph 1 <l0, l3, 1 <= undef2 /\ 1 <= undef12 /\ __const_5000^0 = undef12 /\ x_13^0 = undef2 /\ y_16^0 = undef12, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.006992 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001889s �[33mRanking function: �[36m1 + 2*x_13^0 - y_16^0�[0m
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634