Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737553
details
property
value
status
complete
benchmark
bf20.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n036.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0726330280304 seconds
cpu usage
0.065399557
max memory
7757824.0
stage attributes
key
value
output-size
8089
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, l18, true> <l1, l2, true, par{i^0 -> (1 + i^0)}> <l1, l3, true> <l4, l5, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}> <l4, l1, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef35 = undef35) /\ (undef36 = undef36), par{x^0 -> undef35, y^0 -> undef36}> <l6, l7, true, par{j^0 -> (1 + j^0)}> <l8, l9, ((0 + edgecount^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l8, l6, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef62 = undef62) /\ (undef63 = undef63), par{x^0 -> undef62, y^0 -> undef63}> <l10, l2, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}> <l10, l7, ((1 + i^0) <= (0 + nodecount^0)), par{j^0 -> 0}> <l11, l12, true> <l12, l13, true, par{i^0 -> (1 + i^0)}> <l14, l11, ((1 + source^0) <= (0 + i^0))> <l14, l11, ((1 + i^0) <= (0 + source^0))> <l14, l12, ((0 + i^0) <= (0 + source^0)) /\ ((0 + source^0) <= (0 + i^0))> <l15, l9, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}> <l15, l14, ((1 + i^0) <= (0 + nodecount^0))> <l13, l15, true> <l9, l10, true> <l7, l8, true> <l2, l4, true> <l5, l16, true> <l16, l3, ((0 + nodecount^0) <= (0 + i^0))> <l16, l5, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}> <l17, l13, true, par{edgecount^0 -> (0 + __const_20^0), i^0 -> 0, nodecount^0 -> (0 + __const_5^0), source^0 -> 0}> <l18, l17, true> Fresh variables: undef35, undef36, undef62, undef63, Undef variables: undef35, undef36, undef62, undef63, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l13, (edgecount^0 = (0 + edgecount^0)) /\ (i^0 = 0) /\ (nodecount^0 = (0 + nodecount^0)) /\ (0 = 0)> <l2, l5, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}> <l2, l2, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef35 = undef35) /\ (undef36 = undef36), par{i^0 -> (1 + i^0)}> <l2, l3, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef35 = undef35) /\ (undef36 = undef36)> <l5, l3, ((0 + nodecount^0) <= (0 + i^0))> <l5, l5, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}> <l7, l2, ((0 + edgecount^0) <= (0 + j^0)) /\ ((0 + nodecount^0) <= (0 + (1 + i^0))), par{i^0 -> 0}> <l7, l7, ((0 + edgecount^0) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0), j^0 -> 0}> <l7, l7, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef62 = undef62) /\ (undef63 = undef63), par{j^0 -> (1 + j^0)}> <l13, l2, ((0 + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0}> <l13, l7, ((0 + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + nodecount^0)), par{i^0 -> 0, j^0 -> 0}> <l13, l13, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}> <l13, l13, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + i^0) <= (0 + 0)), par{i^0 -> (1 + i^0)}> <l13, l13, ((1 + i^0) <= (0 + nodecount^0)) /\ ((0 + i^0) <= (0 + 0)) /\ ((0 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}> Fresh variables: undef35, undef36, undef62, undef63, Undef variables: undef35, undef36, undef62, undef63, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l13, l13, 1 + i^0 <= nodecount^0 /\ 1 <= i^0, {i^0 -> 1 + i^0, rest 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