Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737163
details
property
value
status
complete
benchmark
p-7.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0297930240631 seconds
cpu usage
0.027011359
max memory
4382720.0
stage attributes
key
value
output-size
3573
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, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0))> <l2, l3, (undef7 = __disjvr_0^0) /\ (__disjvr_0^0 = undef7), par{__disjvr_0^0 -> undef7}> <l3, l4, true, par{b_7^0 -> 0, y_6^0 -> (~(1) + y_6^0)}> <l1, l5, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef16 = undef16), par{Result_4^0 -> undef16}> <l6, l4, true, par{b_7^0 -> 0}> <l4, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ ((0 + b_7^0) <= 0) /\ (0 <= (0 + b_7^0)), par{b_7^0 -> 1, x_5^0 -> (1 + x_5^0)}> <l4, l5, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef31 = undef31), par{Result_4^0 -> undef31}> <l7, l6, true> Fresh variables: undef7, undef16, undef31, Undef variables: undef7, undef16, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l4, (b_7^0 = 0)> <l4, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ ((0 + b_7^0) <= 0) /\ (0 <= (0 + b_7^0)) /\ (0 <= ((~(1) + (~(1) * (1 + x_5^0))) + y_6^0)) /\ (undef7 = __disjvr_0^0) /\ (__disjvr_0^0 = undef7), par{__disjvr_0^0 -> undef7, b_7^0 -> 0, x_5^0 -> (1 + x_5^0), y_6^0 -> (~(1) + y_6^0)}> <l4, l5, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ ((0 + b_7^0) <= 0) /\ (0 <= (0 + b_7^0)) /\ (((0 + (~(1) * (1 + x_5^0))) + y_6^0) <= 0) /\ (undef16 = undef16), par{b_7^0 -> 1, x_5^0 -> (1 + x_5^0)}> <l4, l5, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef31 = undef31)> Fresh variables: undef7, undef16, undef31, Undef variables: undef7, undef16, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l4, l4, 2 + x_5^0 <= y_6^0 /\ __disjvr_0^0 = undef7 /\ b_7^0 = 0, {__disjvr_0^0 -> undef7, b_7^0 -> 0, x_5^0 -> 1 + x_5^0, y_6^0 -> -1 + y_6^0, rest remain the same}> Variables: __disjvr_0^0, b_7^0, x_5^0, y_6^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l4, b_7^0 = 0, {all remain the same}> Graph 2 <l4, l5, b_7^0 = 0 /\ 1 + x_5^0 = y_6^0, {b_7^0 -> 1, x_5^0 -> 1 + x_5^0, rest remain the same}> <l4, l5, y_6^0 <= x_5^0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634