Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275561
details
property
value
status
complete
benchmark
sort.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n093.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.314688 seconds
cpu usage
0.314858
user time
0.262011
system time
0.052847
max virtual memory
113176.0
max residence set size
50880.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.31 YES 0.00/0.31 0.00/0.31 Solver Timeout: 4 0.00/0.31 Global Timeout: 300 0.00/0.31 No parsing errors! 0.00/0.31 Init Location: 0 0.00/0.31 Transitions: 0.00/0.31 <l0, l27, true> 0.00/0.31 <l1, l2, true> 0.00/0.31 <l3, l1, true, par{tmp___4^0 -> 0}> 0.00/0.31 <l4, l1, ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{tmp___4^0 -> 1}> 0.00/0.31 <l4, l3, (1 <= (0 + bSorted^0))> 0.00/0.31 <l4, l3, ((1 + bSorted^0) <= 0)> 0.00/0.31 <l5, l1, ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{tmp___4^0 -> 1}> 0.00/0.31 <l5, l4, (1 <= (0 + bDomain^0))> 0.00/0.31 <l5, l4, ((1 + bDomain^0) <= 0)> 0.00/0.31 <l6, l7, true, par{bSorted^0 -> (0 + tmp___3^0), ni^0 -> (1 + ni^0)}> 0.00/0.31 <l8, l6, true, par{tmp___3^0 -> 1}> 0.00/0.31 <l8, l6, true, par{tmp___3^0 -> 0}> 0.00/0.31 <l9, l6, ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{tmp___3^0 -> 0}> 0.00/0.31 <l9, l8, (1 <= (0 + bSorted^0))> 0.00/0.31 <l9, l8, ((1 + bSorted^0) <= 0)> 0.00/0.31 <l10, l5, ((~(1) + nDim^0) <= (0 + ni^0))> 0.00/0.31 <l10, l9, ((1 + ni^0) <= (~(1) + nDim^0))> 0.00/0.31 <l11, l12, true> 0.00/0.31 <l13, l14, true, par{bDomain^0 -> (0 + tmp___2^0), ni^0 -> (1 + ni^0)}> 0.00/0.31 <l15, l13, true, par{tmp___2^0 -> 1}> 0.00/0.31 <l16, l13, ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)), par{tmp___2^0 -> 0}> 0.00/0.31 <l16, l15, (1 <= (0 + bExists^0))> 0.00/0.31 <l16, l15, ((1 + bExists^0) <= 0)> 0.00/0.31 <l17, l13, ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{tmp___2^0 -> 0}> 0.00/0.31 <l17, l16, (1 <= (0 + bDomain^0))> 0.00/0.31 <l17, l16, ((1 + bDomain^0) <= 0)> 0.00/0.31 <l18, l19, true, par{tmp___1^0 -> 0}> 0.00/0.31 <l14, l20, true> 0.00/0.31 <l21, l18, true> 0.00/0.31 <l21, l19, true, par{tmp___1^0 -> 1}> 0.00/0.31 <l21, l18, true> 0.00/0.31 <l19, l22, true, par{bExists^0 -> (0 + tmp___1^0), nj^0 -> (1 + nj^0)}> 0.00/0.31 <l23, l19, true, par{tmp___1^0 -> 1}> 0.00/0.31 <l24, l21, ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0))> 0.00/0.31 <l24, l23, (1 <= (0 + bExists^0))> 0.00/0.31 <l24, l23, ((1 + bExists^0) <= 0)> 0.00/0.31 <l25, l17, ((0 + nDim^0) <= (0 + nj^0))> 0.00/0.31 <l25, l24, ((1 + nj^0) <= (0 + nDim^0))> 0.00/0.31 <l22, l25, true> 0.00/0.31 <l20, l7, ((0 + nDim^0) <= (0 + ni^0)), par{ni^0 -> 0}> 0.00/0.31 <l20, l22, ((1 + ni^0) <= (0 + nDim^0)), par{bExists^0 -> 0, nj^0 -> 0}> 0.00/0.31 <l12, l14, ((0 + nDim^0) <= (0 + ni^0)), par{ni^0 -> 0}> 0.00/0.31 <l12, l11, ((1 + ni^0) <= (0 + nDim^0)), par{ni^0 -> (1 + ni^0)}> 0.00/0.31 <l7, l10, true> 0.00/0.31 <l26, l11, (undef567 = undef567) /\ (undef568 = undef568), par{bDomain^0 -> 1, bSorted^0 -> 1, nDim^0 -> (0 + __const_10^0), ni^0 -> 0, tmp^0 -> undef567, tmp___0^0 -> undef568}> 0.00/0.31 <l27, l26, true> 0.00/0.31 0.00/0.31 Fresh variables: 0.00/0.31 undef567, undef568, 0.00/0.31 0.00/0.31 Undef variables: 0.00/0.31 undef567, undef568, 0.00/0.31 0.00/0.31 Abstraction variables: 0.00/0.31 0.00/0.31 Exit nodes: 0.00/0.31 0.00/0.31 Accepting locations: 0.00/0.31 0.00/0.31 Asserts: 0.00/0.31 0.00/0.31 Preprocessed LLVMGraph 0.00/0.31 Init Location: 0 0.00/0.31 Transitions: 0.00/0.31 <l0, l11, (bDomain^0 = 1) /\ (bSorted^0 = 1) /\ (nDim^0 = (0 + nDim^0)) /\ (ni^0 = 0) /\ (undef567 = undef567) /\ (undef568 = undef568)> 0.00/0.31 <l7, l2, ((~(1) + nDim^0) <= (0 + ni^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0))> 0.00/0.31 <l7, l2, ((~(1) + nDim^0) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0))> 0.00/0.31 <l7, l2, ((~(1) + nDim^0) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bSorted^0))> 0.00/0.31 <l7, l2, ((~(1) + nDim^0) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bSorted^0) <= 0)> 0.00/0.31 <l7, l2, ((~(1) + nDim^0) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0))> 0.00/0.31 <l7, l2, ((~(1) + nDim^0) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ (1 <= (0 + bSorted^0))> 0.00/0.31 <l7, l2, ((~(1) + nDim^0) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ ((1 + bSorted^0) <= 0)> 0.00/0.31 <l7, l7, ((1 + ni^0) <= (~(1) + nDim^0)) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}> 0.00/0.31 <l7, l7, ((1 + ni^0) <= (~(1) + nDim^0)) /\ (1 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 1), ni^0 -> (1 + ni^0)}> 0.00/0.31 <l7, l7, ((1 + ni^0) <= (~(1) + nDim^0)) /\ (1 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}> 0.00/0.31 <l7, l7, ((1 + ni^0) <= (~(1) + nDim^0)) /\ ((1 + bSorted^0) <= 0), par{bSorted^0 -> (0 + 1), ni^0 -> (1 + ni^0)}> 0.00/0.31 <l7, l7, ((1 + ni^0) <= (~(1) + nDim^0)) /\ ((1 + bSorted^0) <= 0), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}> 0.00/0.31 <l11, l7, ((0 + nDim^0) <= (0 + ni^0)) /\ ((0 + nDim^0) <= (0 + 0)), par{ni^0 -> 0}> 0.00/0.31 <l11, l22, ((0 + nDim^0) <= (0 + ni^0)) /\ ((1 + 0) <= (0 + nDim^0)), par{bExists^0 -> 0, ni^0 -> 0, nj^0 -> 0}> 0.00/0.31 <l11, l11, ((1 + ni^0) <= (0 + nDim^0)), par{ni^0 -> (1 + ni^0)}> 0.00/0.31 <l22, l7, ((0 + nDim^0) <= (0 + nj^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)) /\ ((0 + nDim^0) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 0), ni^0 -> 0}> 0.00/0.31 <l22, l22, ((0 + nDim^0) <= (0 + nj^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)) /\ ((1 + (1 + ni^0)) <= (0 + nDim^0)), par{bDomain^0 -> (0 + 0), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> 0.00/0.31 <l22, l7, ((0 + nDim^0) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((0 + nDim^0) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 0), ni^0 -> 0}> 0.00/0.31 <l22, l22, ((0 + nDim^0) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + nDim^0)), par{bDomain^0 -> (0 + 0), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> 0.00/0.31 <l22, l7, ((0 + nDim^0) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bExists^0)) /\ ((0 + nDim^0) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}> 0.00/0.31 <l22, l22, ((0 + nDim^0) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + nDim^0)), par{bDomain^0 -> (0 + 1), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> 0.00/0.31 <l22, l7, ((0 + nDim^0) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bExists^0) <= 0) /\ ((0 + nDim^0) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}> 0.00/0.31 <l22, l22, ((0 + nDim^0) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bExists^0) <= 0) /\ ((1 + (1 + ni^0)) <= (0 + nDim^0)), par{bDomain^0 -> (0 + 1), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> 0.00/0.31 <l22, l7, ((0 + nDim^0) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((0 + nDim^0) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 0), ni^0 -> 0}> 0.00/0.31 <l22, l22, ((0 + nDim^0) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + nDim^0)), par{bDomain^0 -> (0 + 0), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> 0.00/0.31 <l22, l7, ((0 + nDim^0) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ (1 <= (0 + bExists^0)) /\ ((0 + nDim^0) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}> 0.00/0.31 <l22, l22, ((0 + nDim^0) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ (1 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + nDim^0)), par{bDomain^0 -> (0 + 1), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> 0.00/0.31 <l22, l7, ((0 + nDim^0) <= (0 + nj^0)) /\ ((1 + bDomain^0) <= 0) /\ ((1 + bExists^0) <= 0) /\ ((0 + nDim^0) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer_Transition_Systems 2019-03-29 01.54