Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275345
details
property
value
status
complete
benchmark
broydn.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n061.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
11.3052 seconds
cpu usage
11.3027
user time
10.2746
system time
1.02809
max virtual memory
702488.0
max residence set size
47912.0
stage attributes
key
value
starexec-result
YES
output
11.29/11.30 YES 11.29/11.30 11.29/11.30 Solver Timeout: 4 11.29/11.30 Global Timeout: 300 11.29/11.30 No parsing errors! 11.29/11.30 Init Location: 0 11.29/11.30 Transitions: 11.29/11.30 <l0, l88, true> 11.29/11.30 <l1, l2, ((1 + n^0) <= (0 + i^0))> 11.29/11.30 <l1, l3, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 11.29/11.30 <l4, l5, ((0 + i^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> 11.29/11.30 <l4, l6, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}> 11.29/11.30 <l7, l8, true> 11.29/11.30 <l9, l10, ((1 + n^0) <= (0 + i^0))> 11.29/11.30 <l9, l6, ((0 + i^0) <= (0 + n^0))> 11.29/11.30 <l11, l12, true, par{k^0 -> (1 + k^0)}> 11.29/11.30 <l13, l14, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}> 11.29/11.30 <l13, l15, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 11.29/11.30 <l16, l17, true> 11.29/11.30 <l18, l15, ((1 + n^0) <= (0 + i^0)) /\ (undef356 = undef356), par{sum^0 -> undef356}> 11.29/11.30 <l18, l19, ((0 + i^0) <= (0 + n^0)) /\ (undef387 = undef387), par{i^0 -> (1 + i^0), sum^0 -> undef387}> 11.29/11.30 <l20, l11, ((1 + n^0) <= (0 + j^0))> 11.29/11.30 <l20, l19, ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}> 11.29/11.30 <l21, l11, ((0 + tmp___2^0) <= 0) /\ (0 <= (0 + tmp___2^0))> 11.29/11.30 <l21, l14, (1 <= (0 + tmp___2^0))> 11.29/11.30 <l21, l14, ((1 + tmp___2^0) <= 0)> 11.29/11.30 <l22, l23, true> 11.29/11.30 <l24, l5, ((0 + n^0) <= (0 + k^0))> 11.29/11.30 <l24, l21, ((1 + k^0) <= (0 + n^0)) /\ (undef644 = undef644), par{tmp___2^0 -> undef644}> 11.29/11.30 <l25, l26, true> 11.29/11.30 <l27, l28, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> 11.29/11.30 <l27, l29, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}> 11.29/11.30 <l30, l12, ((1 + n^0) <= (0 + i^0))> 11.29/11.30 <l30, l29, ((0 + i^0) <= (0 + n^0))> 11.29/11.30 <l31, l3, ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0))> 11.29/11.30 <l31, l28, (1 <= (0 + restrt^0))> 11.29/11.30 <l31, l28, ((1 + restrt^0) <= 0)> 11.29/11.30 <l32, l33, ((1 + __const_200^0) <= (0 + its^0))> 11.29/11.30 <l32, l31, ((0 + its^0) <= (0 + __const_200^0))> 11.29/11.30 <l34, l35, (undef984 = undef984), par{tmp___1^0 -> undef984}> 11.29/11.30 <l36, l37, true> 11.29/11.30 <l35, l38, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}> 11.29/11.30 <l39, l34, (1 <= (0 + sqrarg^0))> 11.29/11.30 <l39, l34, ((1 + sqrarg^0) <= 0)> 11.29/11.30 <l39, l35, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}> 11.29/11.30 <l40, l41, ((1 + n^0) <= (0 + i^0)), par{restrt^0 -> 1}> 11.29/11.30 <l40, l39, ((0 + i^0) <= (0 + n^0)) /\ (undef1192 = undef1192), par{sqrarg^0 -> undef1192}> 11.29/11.30 <l42, l43, true> 11.29/11.30 <l44, l38, (1 <= (0 + test^0))> 11.29/11.30 <l44, l33, ((1 + test^0) <= 1)> 11.29/11.30 <l45, l46, true, par{i^0 -> (1 + i^0)}> 11.29/11.30 <l47, l45, ((0 + tmp___0^0) <= (0 + test^0))> 11.29/11.30 <l47, l45, ((1 + test^0) <= (0 + tmp___0^0)) /\ (undef1382 = undef1382), par{test^0 -> (0 + undef1382), tmp^0 -> undef1382}> 11.29/11.30 <l48, l44, ((1 + n^0) <= (0 + i^0))> 11.29/11.30 <l48, l47, ((0 + i^0) <= (0 + n^0)) /\ (undef1445 = undef1445), par{tmp___0^0 -> undef1445}> 11.29/11.30 <l38, l40, true> 11.29/11.30 <l41, l32, true> 11.29/11.30 <l49, l50, true> 11.29/11.30 <l28, l30, true> 11.29/11.30 <l29, l27, true> 11.29/11.30 <l12, l24, true> 11.29/11.30 <l14, l20, true> 11.29/11.30 <l19, l18, true> 11.29/11.30 <l15, l13, true> 11.29/11.30 <l51, l52, (0 <= (0 + test^0))> 11.29/11.30 <l51, l33, ((1 + test^0) <= 0)> 11.29/11.30 <l53, l54, true, par{i^0 -> (1 + i^0)}> 11.29/11.30 <l5, l9, true> 11.29/11.30 <l55, l53, ((0 + temp^0) <= (0 + test^0))> 11.29/11.30 <l55, l53, ((1 + test^0) <= (0 + temp^0)), par{test^0 -> (0 + temp^0)}> 11.29/11.30 <l56, l55, (undef1938 = undef1938), par{temp^0 -> undef1938}> 11.29/11.30 <l57, l56, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{tmp___11^0 -> (0 + maxarg2^0)}> 11.29/11.30 <l57, l56, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{tmp___11^0 -> (0 + maxarg1^0)}> 11.29/11.30 <l6, l4, true> 11.29/11.30 <l58, l51, ((1 + n^0) <= (0 + i^0))> 11.29/11.30 <l58, l57, ((0 + i^0) <= (0 + n^0)) /\ (undef2108 = undef2108) /\ (undef2097 = undef2097), par{maxarg1^0 -> (0 + undef2097), maxarg2^0 -> 1, tmp___10^0 -> undef2097, tmp___9^0 -> undef2108}> 11.29/11.30 <l52, l41, true, par{its^0 -> (1 + its^0)}> 11.29/11.30 <l50, l52, ((1 + n^0) <= (0 + i^0))> 11.29/11.30 <l50, l49, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 11.29/11.30 <l59, l54, ((0 + tmp___12^0) <= 0) /\ (0 <= (0 + tmp___12^0)), par{restrt^0 -> 0, test^0 -> 0}> 11.29/11.30 <l59, l49, (1 <= (0 + tmp___12^0))> 11.29/11.30 <l59, l49, ((1 + tmp___12^0) <= 0)> 11.29/11.30 <l3, l1, true> 11.29/11.30 <l60, l42, true, par{i^0 -> (1 + i^0)}> 11.29/11.30 <l61, l60, ((0 + tmp___8^0) <= (0 + test^0))> 11.29/11.30 <l61, l60, ((1 + test^0) <= (0 + tmp___8^0)) /\ (undef2416 = undef2416), par{test^0 -> (0 + undef2416), tmp___7^0 -> undef2416}> 11.29/11.30 <l43, l59, ((1 + n^0) <= (0 + i^0)) /\ (undef2440 = undef2440), par{tmp___12^0 -> undef2440}> 11.29/11.30 <l43, l61, ((0 + i^0) <= (0 + n^0)) /\ (undef2479 = undef2479), par{tmp___8^0 -> undef2479}> 11.29/11.30 <l2, l62, true> 11.29/11.30 <l54, l58, true> 11.29/11.30 <l37, l25, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> 11.29/11.30 <l37, l36, ((0 + j^0) <= (0 + n^0)) /\ (undef2588 = undef2588), par{j^0 -> (1 + j^0), sum^0 -> undef2588}> 11.29/11.30 <l63, l64, true> 11.29/11.30 <l26, l42, ((1 + n^0) <= (0 + i^0)), par{test^0 -> 0}> 11.29/11.30 <l26, l36, ((0 + i^0) <= (0 + n^0))> 11.29/11.30 <l23, l25, ((1 + n^0) <= (0 + i^0)), par{fold^0 -> (0 + f_promoted_1^0)}> 11.29/11.30 <l23, l22, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> 11.29/11.30 <l65, l66, true> 11.29/11.30 <l17, l7, ((1 + i^0) <= (0 + j^0)), par{i^0 -> (~(1) + i^0)}> 11.29/11.30 <l17, l16, ((0 + j^0) <= (0 + i^0)) /\ (undef2836 = undef2836), par{j^0 -> (1 + j^0), sum^0 -> undef2836}>
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