Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739751
details
property
value
status
complete
benchmark
florian_sas1.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0642840862274 seconds
cpu usage
0.059539339
max memory
9113600.0
stage attributes
key
value
output-size
4621
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l11, true> <l1, l2, ((0 + n^0) <= (0 + i^0))> <l1, l3, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8), par{tmp^0 -> undef8}> <l4, l5, ((0 + n^0) <= (0 + i^0))> <l4, l6, ((1 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> 0}> <l7, l4, true> <l6, l1, true> <l2, l8, true> <l8, l7, ((0 + j^0) <= 0)> <l8, l7, (1 <= (0 + j^0)), par{i^0 -> (~(1) + i^0)}> <l9, l6, true, par{i^0 -> (1 + i^0), j^0 -> (1 + j^0)}> <l3, l2, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))> <l3, l9, (1 <= (0 + tmp^0))> <l3, l9, ((1 + tmp^0) <= 0)> <l10, l7, true, par{i^0 -> 0}> <l11, l10, true> Fresh variables: undef8, Undef variables: undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l5, ((0 + n^0) <= (0 + 0)), par{i^0 -> 0}> <l0, l6, ((1 + 0) <= (0 + n^0)), par{i^0 -> (1 + 0), j^0 -> 0}> <l6, l5, ((0 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= 0) /\ ((0 + n^0) <= (0 + i^0))> <l6, l5, ((0 + n^0) <= (0 + i^0)) /\ (1 <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (~(1) + i^0))), par{i^0 -> (~(1) + i^0)}> <l6, l6, ((0 + n^0) <= (0 + i^0)) /\ (1 <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= (0 + n^0)), par{i^0 -> (1 + (~(1) + i^0)), j^0 -> 0}> <l6, l6, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)) /\ ((0 + j^0) <= 0) /\ ((1 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> 0}> <l6, l6, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)) /\ (1 <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= (0 + n^0)), par{i^0 -> (1 + (~(1) + i^0)), j^0 -> 0}> <l6, l6, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8) /\ (1 <= (0 + undef8)), par{i^0 -> (1 + i^0), j^0 -> (1 + j^0)}> <l6, l6, ((1 + i^0) <= (0 + n^0)) /\ (undef8 = undef8) /\ ((1 + undef8) <= 0), par{i^0 -> (1 + i^0), j^0 -> (1 + j^0)}> Fresh variables: undef8, Undef variables: undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l6, l6, 1 <= j^0 /\ i^0 = n^0, {j^0 -> 0, rest remain the same}> <l6, l6, j^0 <= 0 /\ 1 + i^0 <= n^0 /\ undef8 = 0, {i^0 -> 1 + i^0, j^0 -> 0, rest remain the same}> <l6, l6, 1 + i^0 <= n^0 /\ 1 <= j^0 /\ undef8 = 0, {j^0 -> 0, rest remain the same}> <l6, l6, 1 + i^0 <= n^0 /\ 1 <= undef8, {i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> <l6, l6, 1 + i^0 <= n^0 /\ 1 + undef8 <= 0, {i^0 -> 1 + i^0, j^0 -> 1 + j^0, rest remain the same}> Variables: i^0, j^0, n^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634