Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432276176
details
property
value
status
complete
benchmark
qrdcmp.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
1.50866 seconds
cpu usage
1.49011
user time
1.27125
system time
0.218868
max virtual memory
808300.0
max residence set size
155520.0
stage attributes
key
value
starexec-result
YES
output
1.44/1.50 YES 1.44/1.50 1.44/1.50 Solver Timeout: 4 1.44/1.50 Global Timeout: 300 1.44/1.50 No parsing errors! 1.44/1.50 Init Location: 0 1.44/1.50 Transitions: 1.44/1.50 <l0, l28, true> 1.44/1.50 <l1, l2, true> 1.44/1.50 <l3, l4, true> 1.44/1.50 <l5, l3, true> 1.44/1.50 <l5, l3, true> 1.44/1.50 <l6, l7, true> 1.44/1.50 <l8, l9, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}> 1.44/1.50 <l8, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 1.44/1.50 <l11, l12, true> 1.44/1.50 <l13, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef155 = undef155), par{tau^0 -> undef155}> 1.44/1.50 <l13, l14, ((0 + i^0) <= (0 + n^0)) /\ (undef172 = undef172), par{i^0 -> (1 + i^0), sum^0 -> undef172}> 1.44/1.50 <l15, l16, ((1 + n^0) <= (0 + j^0))> 1.44/1.50 <l15, l14, ((0 + j^0) <= (0 + n^0))> 1.44/1.50 <l17, l18, true> 1.44/1.50 <l19, l9, true> 1.44/1.50 <l20, l19, (undef269 = undef269) /\ (undef270 = undef270), par{sigma^0 -> (0 + (~(1) * undef270)), tmp___4^0 -> undef269, tmp___5^0 -> undef270}> 1.44/1.50 <l20, l19, (undef285 = undef285) /\ (undef286 = undef286), par{sigma^0 -> (0 + undef286), tmp___2^0 -> undef285, tmp___3^0 -> undef286}> 1.44/1.50 <l21, l22, (undef302 = undef302), par{tmp___1^0 -> undef302}> 1.44/1.50 <l9, l15, true> 1.44/1.50 <l22, l17, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}> 1.44/1.50 <l23, l21, (1 <= (0 + sqrarg^0))> 1.44/1.50 <l23, l21, ((1 + sqrarg^0) <= 0)> 1.44/1.50 <l23, l22, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}> 1.44/1.50 <l18, l20, ((1 + n^0) <= (0 + i^0))> 1.44/1.50 <l18, l23, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423), par{sqrarg^0 -> undef423}> 1.44/1.50 <l14, l13, true> 1.44/1.50 <l12, l17, ((1 + n^0) <= (0 + i^0))> 1.44/1.50 <l12, l11, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 1.44/1.50 <l16, l1, true, par{k^0 -> (1 + k^0)}> 1.44/1.50 <l24, l11, (1 <= (0 + scale^0))> 1.44/1.50 <l24, l11, ((1 + scale^0) <= 0)> 1.44/1.50 <l24, l16, ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)), par{tmp___0^0 -> 0}> 1.44/1.50 <l25, l6, true, par{i^0 -> (1 + i^0)}> 1.44/1.50 <l10, l8, true> 1.44/1.50 <l26, l25, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{scale^0 -> (0 + maxarg2^0)}> 1.44/1.50 <l26, l25, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{scale^0 -> (0 + maxarg1^0)}> 1.44/1.50 <l7, l24, ((1 + n^0) <= (0 + i^0))> 1.44/1.50 <l7, l26, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660), par{maxarg1^0 -> (0 + scale^0), maxarg2^0 -> (0 + undef660), tmp^0 -> undef660}> 1.44/1.50 <l2, l5, ((0 + n^0) <= (0 + k^0))> 1.44/1.50 <l2, l6, ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}> 1.44/1.50 <l27, l1, (2 <= (0 + n^0))> 1.44/1.50 <l28, l27, true> 1.44/1.50 1.44/1.50 Fresh variables: 1.44/1.50 undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 1.44/1.50 1.44/1.50 Undef variables: 1.44/1.50 undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 1.44/1.50 1.44/1.50 Abstraction variables: 1.44/1.50 1.44/1.50 Exit nodes: 1.44/1.50 1.44/1.50 Accepting locations: 1.44/1.50 1.44/1.50 Asserts: 1.44/1.50 1.44/1.50 Preprocessed LLVMGraph 1.44/1.50 Init Location: 0 1.44/1.50 Transitions: 1.44/1.50 <l0, l4, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))> 1.44/1.50 <l0, l4, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))> 1.44/1.50 <l0, l6, (2 <= (0 + n^0)) /\ ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}> 1.44/1.50 <l6, l11, ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + scale^0))> 1.44/1.50 <l6, l11, ((1 + n^0) <= (0 + i^0)) /\ ((1 + scale^0) <= 0)> 1.44/1.50 <l6, l4, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 1.44/1.50 <l6, l4, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 1.44/1.50 <l6, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}> 1.44/1.50 <l6, l6, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660) /\ ((0 + (0 + scale^0)) <= (0 + (0 + undef660))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + undef660))}> 1.44/1.50 <l6, l6, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660) /\ ((1 + (0 + undef660)) <= (0 + (0 + scale^0))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + scale^0))}> 1.44/1.50 <l10, l4, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}> 1.44/1.50 <l10, l4, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}> 1.44/1.50 <l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0), scale^0 -> 0}> 1.44/1.50 <l10, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0)}> 1.44/1.50 <l10, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 1.44/1.50 <l11, l17, ((1 + n^0) <= (0 + i^0))> 1.44/1.50 <l11, l11, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 1.44/1.50 <l14, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef155 = undef155)> 1.44/1.50 <l14, l14, ((0 + i^0) <= (0 + n^0)) /\ (undef172 = undef172), par{i^0 -> (1 + i^0), sum^0 -> undef172}> 1.44/1.50 <l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 1.44/1.50 <l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 1.44/1.50 <l17, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}> 1.44/1.50 <l17, l14, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((0 + j^0) <= (0 + n^0))> 1.44/1.50 <l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 1.44/1.50 <l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> 1.44/1.50 <l17, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}> 1.44/1.50 <l17, l14, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((0 + j^0) <= (0 + n^0))> 1.44/1.50 <l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ (1 <= (0 + undef423)) /\ (undef302 = undef302), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef302)}> 1.44/1.50 <l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ ((1 + undef423) <= 0) /\ (undef302 = undef302), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef302)}> 1.44/1.50 <l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ ((0 + undef423) <= 0) /\ (0 <= (0 + undef423)), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + 0)}> 1.44/1.50 1.44/1.50 Fresh variables: 1.44/1.50 undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660,
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