Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381740135
details
property
value
status
complete
benchmark
java_Break.c.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n191.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0323791503906 seconds
cpu usage
0.028599303
max memory
4120576.0
stage attributes
key
value
output-size
4025
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, l7, true> <l1, l2, (undef1 = (0 + x0^0)), par{oldX0^0 -> undef1, x0^0 -> (1 + undef1)}> <l3, l4, (undef5 = undef5), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef5, x0^0 -> (0 + undef5)}> <l2, l1, (undef7 = (0 + x0^0)) /\ ((0 + undef7) <= 10), par{oldX0^0 -> undef7, x0^0 -> (0 + undef7)}> <l2, l3, (undef10 = (0 + x0^0)) /\ (11 <= (0 + undef10)), par{oldX0^0 -> undef10, x0^0 -> (0 + undef10)}> <l5, l2, true, par{oldX0^0 -> (0 + x0^0), x0^0 -> 0}> <l6, l5, (undef17 = undef17), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef17, x0^0 -> (0 + undef17)}> <l6, l4, true> <l6, l1, true> <l6, l3, true> <l6, l2, true> <l6, l5, true> <l7, l6, true> Fresh variables: undef1, undef5, undef7, undef10, undef17, Undef variables: undef1, undef5, undef7, undef10, undef17, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (undef17 = undef17) /\ (undef7 = (0 + 0)) /\ ((0 + undef7) <= 10), par{x0^0 -> (0 + undef7)}> <l0, l4, true> <l0, l1, true> <l0, l4, (undef5 = undef5), par{x0^0 -> (0 + undef5)}> <l0, l1, (undef7 = (0 + x0^0)) /\ ((0 + undef7) <= 10), par{x0^0 -> (0 + undef7)}> <l0, l4, (undef10 = (0 + x0^0)) /\ (11 <= (0 + undef10)) /\ (undef5 = undef5), par{x0^0 -> (0 + undef5)}> <l0, l1, (undef7 = (0 + 0)) /\ ((0 + undef7) <= 10), par{x0^0 -> (0 + undef7)}> <l1, l1, (undef1 = (0 + x0^0)) /\ (undef7 = (0 + (1 + undef1))) /\ ((0 + undef7) <= 10), par{x0^0 -> (0 + undef7)}> <l1, l4, (undef1 = (0 + x0^0)) /\ (undef10 = (0 + (1 + undef1))) /\ (11 <= (0 + undef10)) /\ (undef5 = undef5), par{x0^0 -> (0 + undef5)}> Fresh variables: undef1, undef5, undef7, undef10, undef17, Undef variables: undef1, undef5, undef7, undef10, undef17, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, undef7 <= 10 /\ x0^0 = undef1 /\ 1 + undef1 = undef7, {x0^0 -> undef7, rest remain the same}> Variables: x0^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l1, undef7 = 0, {x0^0 -> undef7, rest remain the same}> <l0, l1, true, {all remain the same}> <l0, l1, undef7 <= 10 /\ x0^0 = undef7, {x0^0 -> undef7, rest remain the same}> <l0, l1, undef7 = 0, {x0^0 -> undef7, rest remain the same}> Graph 2 <l0, l4, true, {all 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