Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737277
details
property
value
status
complete
benchmark
p-43.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.925024986267 seconds
cpu usage
2.334192006
max memory
2.25202176E8
stage attributes
key
value
output-size
18787
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, ((0 + x_5^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}> <l1, l2, (0 <= (~(1) + x_5^0)) /\ ((0 + y_6^0) <= 0) /\ (undef5 = undef5), par{Result_4^0 -> undef5}> <l1, l2, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (((0 + x_5^0) + y_6^0) <= 0) /\ (undef9 = undef9), par{Result_4^0 -> undef9}> <l1, l3, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef14 = undef14) /\ ((0 + undef14) <= 0) /\ (0 <= (0 + undef14)) /\ (undef15 = (~(2) + y_6^0)), par{tmp_7^0 -> undef14, x_5^0 -> undef15, y_6^0 -> (1 + undef15)}> <l3, l1, true> <l1, l4, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef22 = undef22), par{tmp_7^0 -> undef22}> <l4, l5, ((1 + tmp_7^0) <= 0)> <l4, l5, (1 <= (0 + tmp_7^0))> <l5, l6, (undef35 = (~(1) + x_5^0)), par{x_5^0 -> undef35, y_6^0 -> (0 + undef35)}> <l6, l1, true> <l7, l1, true> <l8, l7, true> Fresh variables: undef1, undef5, undef9, undef14, undef15, undef22, undef35, Undef variables: undef1, undef5, undef9, undef14, undef15, undef22, undef35, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, true> <l1, l2, ((0 + x_5^0) <= 0) /\ (undef1 = undef1)> <l1, l2, (0 <= (~(1) + x_5^0)) /\ ((0 + y_6^0) <= 0) /\ (undef5 = undef5)> <l1, l1, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef14 = undef14) /\ ((0 + undef14) <= 0) /\ (0 <= (0 + undef14)) /\ (undef15 = (~(2) + y_6^0)), par{x_5^0 -> undef15, y_6^0 -> (1 + undef15)}> <l1, l1, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef22 = undef22) /\ ((1 + undef22) <= 0) /\ (undef35 = (~(1) + x_5^0)), par{x_5^0 -> undef35, y_6^0 -> (0 + undef35)}> <l1, l1, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef22 = undef22) /\ (1 <= (0 + undef22)) /\ (undef35 = (~(1) + x_5^0)), par{x_5^0 -> undef35, y_6^0 -> (0 + undef35)}> Fresh variables: undef1, undef5, undef9, undef14, undef15, undef22, undef35, Undef variables: undef1, undef5, undef9, undef14, undef15, undef22, undef35, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ undef14 = 0 /\ y_6^0 = 2 + undef15, {x_5^0 -> undef15, y_6^0 -> 1 + undef15, rest remain the same}> <l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ 1 + undef22 <= 0 /\ x_5^0 = 1 + undef35, {x_5^0 -> undef35, y_6^0 -> undef35, rest remain the same}> <l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ 1 <= undef22 /\ x_5^0 = 1 + undef35, {x_5^0 -> undef35, y_6^0 -> undef35, rest remain the same}> Variables: x_5^0, y_6^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l1, true, {all remain the same}> Graph 2 <l1, l2, x_5^0 <= 0, {all remain the same}> <l1, l2, y_6^0 <= 0 /\ 1 <= x_5^0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 )
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634