Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739499
details
property
value
status
complete
benchmark
two_arrays.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n106.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0482039451599 seconds
cpu usage
0.045170848
max memory
4489216.0
stage attributes
key
value
output-size
6173
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, l15, true> <l1, l2, true> <l3, l4, (50 <= (0 + i^0))> <l3, l5, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}> <l6, l7, true> <l8, l5, (50 <= (0 + i13^0)), par{i^0 -> 0}> <l8, l9, ((1 + i13^0) <= 50), par{i13^0 -> (1 + i13^0)}> <l10, l11, true> <l12, l9, (50 <= (0 + i11^0)) /\ (undef57 = 0), par{i13^0 -> 0}> <l12, l13, ((1 + i11^0) <= 50), par{i11^0 -> (1 + i11^0)}> <l13, l12, true> <l11, l13, (50 <= (0 + i^0)) /\ (undef79 = 0), par{i11^0 -> 0}> <l11, l10, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}> <l9, l8, true> <l7, l10, (50 <= (0 + i9^0)), par{i^0 -> 0}> <l7, l6, ((1 + i9^0) <= 50), par{i9^0 -> (1 + i9^0)}> <l5, l3, true> <l2, l6, (50 <= (0 + i7^0)) /\ (undef122 = 0), par{i9^0 -> 0}> <l2, l1, ((1 + i7^0) <= 50), par{i7^0 -> (1 + i7^0)}> <l14, l1, (undef135 = undef135) /\ (undef136 = undef136) /\ (undef137 = 0), par{i7^0 -> 0, i^0 -> 0, tmp^0 -> undef135, tmp___0^0 -> undef136}> <l15, l14, true> Fresh variables: undef57, undef79, undef122, undef135, undef136, undef137, Undef variables: undef57, undef79, undef122, undef135, undef136, undef137, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (i7^0 = 0) /\ (i^0 = 0) /\ (undef135 = undef135) /\ (undef136 = undef136) /\ (undef137 = 0)> <l1, l6, (50 <= (0 + i7^0)) /\ (undef122 = 0), par{i9^0 -> 0}> <l1, l1, ((1 + i7^0) <= 50), par{i7^0 -> (1 + i7^0)}> <l5, l4, (50 <= (0 + i^0))> <l5, l5, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}> <l6, l10, (50 <= (0 + i9^0)), par{i^0 -> 0}> <l6, l6, ((1 + i9^0) <= 50), par{i9^0 -> (1 + i9^0)}> <l9, l5, (50 <= (0 + i13^0)), par{i^0 -> 0}> <l9, l9, ((1 + i13^0) <= 50), par{i13^0 -> (1 + i13^0)}> <l10, l13, (50 <= (0 + i^0)) /\ (undef79 = 0), par{i11^0 -> 0}> <l10, l10, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}> <l13, l9, (50 <= (0 + i11^0)) /\ (undef57 = 0), par{i13^0 -> 0}> <l13, l13, ((1 + i11^0) <= 50), par{i11^0 -> (1 + i11^0)}> Fresh variables: undef57, undef79, undef122, undef135, undef136, undef137, Undef variables: undef57, undef79, undef122, undef135, undef136, undef137, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, i7^0 <= 49, {i7^0 -> 1 + i7^0, rest remain the same}> Variables: i7^0 Graph 2: Transitions: <l6, l6, i9^0 <= 49, {i9^0 -> 1 + i9^0, rest remain the same}>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634