Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738981
details
property
value
status
complete
benchmark
heidy3.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n069.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
1.08278107643 seconds
cpu usage
3.138497437
max memory
1.07163648E8
stage attributes
key
value
output-size
3746
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l6, true> <l1, l2, true> <l2, l1, true> <l3, l4, true, par{p^0 -> 0}> <l4, l5, (1 <= (0 + y_1^0)), par{y_1^0 -> (~(1) + y_1^0)}> <l5, l4, true> <l4, l1, ((0 + y_1^0) <= 0), par{p^0 -> ~(1)}> <l6, l3, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l4, true> <l1, l1, true> <l4, l4, (1 <= (0 + y_1^0)), par{y_1^0 -> (~(1) + y_1^0)}> <l4, l1, ((0 + y_1^0) <= 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: <l4, l4, 1 <= y_1^0, {y_1^0 -> -1 + y_1^0, rest remain the same}> Variables: y_1^0 Graph 2: Transitions: <l1, l1, true, {all remain the same}> Variables: Precedence: Graph 0 Graph 1 <l0, l4, true, {all remain the same}> Graph 2 <l4, l1, y_1^0 <= 0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001334 Checking conditional termination of SCC {l4}...
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634