Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381740510
details
property
value
status
complete
benchmark
byron-1.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0556969642639 seconds
cpu usage
0.06157489
max memory
1.1689984E7
stage attributes
key
value
output-size
3445
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, l5, true> <l1, l2, ((1 + y_13^0) <= 1), par{rt_11^0 -> (0 + st_14^0)}> <l1, l3, (1 <= (0 + y_13^0))> <l3, l2, ((0 + x_15^0) <= 0), par{rt_11^0 -> (0 + st_14^0)}> <l3, l4, (1 <= (0 + x_15^0)), par{x_15^0 -> ((0 + x_15^0) + (~(1) * y_13^0)), y_13^0 -> (1 + y_13^0)}> <l4, l3, true> <l5, l1, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, ((1 + y_13^0) <= 1)> <l0, l3, (1 <= (0 + y_13^0))> <l3, l2, ((0 + x_15^0) <= 0)> <l3, l3, (1 <= (0 + x_15^0)), par{x_15^0 -> ((0 + x_15^0) + (~(1) * y_13^0)), y_13^0 -> (1 + y_13^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 1 <= x_15^0, {x_15^0 -> x_15^0 - y_13^0, y_13^0 -> 1 + y_13^0, rest remain the same}> Variables: x_15^0, y_13^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l3, 1 <= y_13^0, {all remain the same}> Graph 2 <l0, l2, y_13^0 <= 0, {all remain the same}> <l3, l2, x_15^0 <= 0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001984 Checking conditional termination of SCC {l3}...
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634