Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737115
details
property
value
status
complete
benchmark
mc91test.t2_fixed.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.694807052612 seconds
cpu usage
0.67091987
max memory
3.346432E7
stage attributes
key
value
output-size
4807
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, l8, true> <l1, l2, (1 <= (0 + copied^0)) /\ ((0 + olde^0) <= (0 + e^0)) /\ ((0 + n^0) <= (0 + oldn^0))> <l1, l3, ((0 + copied^0) <= 0) /\ (1 <= (0 + e^0)) /\ ((0 + n^0) <= 100), par{copied^0 -> 1, e^0 -> (1 + e^0), n^0 -> (11 + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> <l3, l1, true> <l1, l4, ((0 + copied^0) <= 0) /\ (1 <= (0 + e^0)) /\ (101 <= (0 + n^0)), par{copied^0 -> 1, e^0 -> (~(1) + e^0), n^0 -> (~(10) + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> <l4, l1, true> <l1, l5, (1 <= (0 + e^0)) /\ ((0 + n^0) <= 100), par{e^0 -> (1 + e^0), n^0 -> (11 + n^0)}> <l5, l1, true> <l1, l6, (1 <= (0 + e^0)) /\ (101 <= (0 + n^0)), par{e^0 -> (~(1) + e^0), n^0 -> (~(10) + n^0)}> <l6, l1, true> <l7, l1, (undef48 = undef48), par{copied^0 -> 0, e^0 -> 1, n^0 -> undef48}> <l8, l7, true> Fresh variables: undef48, Undef variables: undef48, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (copied^0 = 0) /\ (e^0 = 1) /\ (n^0 = undef48) /\ (undef48 = undef48)> <l1, l2, (1 <= (0 + copied^0)) /\ ((0 + olde^0) <= (0 + e^0)) /\ ((0 + n^0) <= (0 + oldn^0))> <l1, l1, ((0 + copied^0) <= 0) /\ (1 <= (0 + e^0)) /\ ((0 + n^0) <= 100), par{copied^0 -> 1, e^0 -> (1 + e^0), n^0 -> (11 + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> <l1, l1, ((0 + copied^0) <= 0) /\ (1 <= (0 + e^0)) /\ (101 <= (0 + n^0)), par{copied^0 -> 1, e^0 -> (~(1) + e^0), n^0 -> (~(10) + n^0), olde^0 -> (0 + e^0), oldn^0 -> (0 + n^0)}> <l1, l1, (1 <= (0 + e^0)) /\ ((0 + n^0) <= 100), par{e^0 -> (1 + e^0), n^0 -> (11 + n^0)}> <l1, l1, (1 <= (0 + e^0)) /\ (101 <= (0 + n^0)), par{e^0 -> (~(1) + e^0), n^0 -> (~(10) + n^0)}> Fresh variables: undef48, Undef variables: undef48, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, 1 <= e^0 /\ copied^0 <= 0 /\ n^0 <= 100, {copied^0 -> 1, e^0 -> 1 + e^0, n^0 -> 11 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> <l1, l1, 1 <= e^0 /\ copied^0 <= 0 /\ 101 <= n^0, {copied^0 -> 1, e^0 -> -1 + e^0, n^0 -> -10 + n^0, olde^0 -> e^0, oldn^0 -> n^0, rest remain the same}> <l1, l1, 1 <= e^0 /\ n^0 <= 100, {e^0 -> 1 + e^0, n^0 -> 11 + n^0, rest remain the same}> <l1, l1, 1 <= e^0 /\ 101 <= n^0, {e^0 -> -1 + e^0, n^0 -> -10 + n^0, rest remain the same}> Variables: copied^0, e^0, n^0, olde^0, oldn^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l1, copied^0 = 0 /\ n^0 = undef48 /\ e^0 = 1, {all remain the same}> Graph 2 <l1, l2, 1 <= copied^0 /\ olde^0 <= e^0 /\ n^0 <= oldn^0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 )
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634