Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739835
details
property
value
status
complete
benchmark
tqli.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
18.4979519844 seconds
cpu usage
41.789936473
max memory
7.03971328E8
stage attributes
key
value
output-size
68970
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l29, true> <l1, l2, ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)), par{l^0 -> (1 + l^0)}> <l1, l3, ((1 + l^0) <= (0 + m^0))> <l1, l3, ((1 + m^0) <= (0 + l^0))> <l4, l1, true> <l5, l2, ((1 + n^0) <= (0 + i^0))> <l5, l6, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> <l7, l4, ((1 + i^0) <= (0 + l^0))> <l7, l1, ((0 + l^0) <= (0 + i^0))> <l8, l9, true> <l9, l4, (1 <= (0 + r^0))> <l9, l4, ((1 + r^0) <= 0)> <l9, l7, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0))> <l2, l10, true> <l11, l12, ((1 + n^0) <= (0 + k^0)), par{i^0 -> (~(1) + i^0)}> <l11, l13, ((0 + k^0) <= (0 + n^0)) /\ (undef298 = undef298), par{f^0 -> undef298, k^0 -> (1 + k^0)}> <l14, l13, (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{c^0 -> undef317, g^0 -> undef320, p^0 -> undef327, r^0 -> undef328, s^0 -> undef329}> <l3, l15, true> <l16, l14, (1 <= (0 + r^0))> <l16, l14, ((1 + r^0) <= 0)> <l16, l8, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0))> <l17, l8, ((1 + i^0) <= (0 + l^0))> <l17, l16, ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455), par{b^0 -> undef443, f^0 -> undef446, r^0 -> undef455}> <l15, l18, true> <l19, l12, (undef489 = undef489) /\ (undef486 = 1), par{c^0 -> undef486, g^0 -> undef489, p^0 -> 0, s^0 -> (0 + undef486)}> <l20, l19, ((1 + g^0) <= 0) /\ (undef525 = undef525), par{tmp___4^0 -> undef525, tmp___5^0 -> (0 + (~(1) * undef525))}> <l20, l19, (0 <= (0 + g^0)) /\ (undef545 = undef545), par{tmp___3^0 -> undef545, tmp___5^0 -> (0 + undef545)}> <l21, l20, (undef552 = undef552) /\ (undef560 = undef560), par{g^0 -> undef552, r^0 -> undef560}> <l12, l17, true> <l22, l21, (31 <= (0 + tmp___2^0))> <l22, l21, ((1 + tmp___2^0) <= 30)> <l22, l21, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0))> <l23, l22, true, par{iter^0 -> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> <l24, l25, true> <l25, l1, ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0))> <l25, l23, ((1 + l^0) <= (0 + m^0))> <l25, l23, ((1 + m^0) <= (0 + l^0))> <l26, l15, true, par{m^0 -> (1 + m^0)}> <l27, l26, ((1 + dd^0) <= ((0 + dd^0) + tmp___1^0))> <l27, l26, (((1 + dd^0) + tmp___1^0) <= (0 + dd^0))> <l27, l24, (((0 + dd^0) + tmp___1^0) <= (0 + dd^0)) /\ ((0 + dd^0) <= ((0 + dd^0) + tmp___1^0))> <l13, l11, true> <l18, l24, ((0 + n^0) <= (0 + m^0))> <l18, l27, ((0 + m^0) <= (~(1) + n^0)) /\ (undef898 = undef898) /\ (undef899 = undef899) /\ (undef900 = undef900), par{dd^0 -> ((0 + undef898) + undef899), tmp^0 -> undef898, tmp___0^0 -> undef899, tmp___1^0 -> undef900}> <l10, l28, ((1 + n^0) <= (0 + l^0))> <l10, l3, ((0 + l^0) <= (0 + n^0)), par{iter^0 -> 0}> <l6, l5, true> <l29, l6, true> Fresh variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, Undef variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l6, true> <l6, l28, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + l^0))> <l6, l15, ((1 + n^0) <= (0 + i^0)) /\ ((0 + l^0) <= (0 + n^0)), par{iter^0 -> 0}> <l6, l6, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> <l9, l28, (1 <= (0 + r^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}> <l9, l15, (1 <= (0 + r^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}> <l9, l15, (1 <= (0 + r^0)) /\ ((1 + l^0) <= (0 + m^0))> <l9, l15, (1 <= (0 + r^0)) /\ ((1 + m^0) <= (0 + l^0))> <l9, l28, ((1 + r^0) <= 0) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}> <l9, l15, ((1 + r^0) <= 0) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}> <l9, l15, ((1 + r^0) <= 0) /\ ((1 + l^0) <= (0 + m^0))> <l9, l15, ((1 + r^0) <= 0) /\ ((1 + m^0) <= (0 + l^0))> <l9, l28, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((1 + i^0) <= (0 + l^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}> <l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((1 + i^0) <= (0 + l^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}> <l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((1 + i^0) <= (0 + l^0)) /\ ((1 + l^0) <= (0 + m^0))> <l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((1 + i^0) <= (0 + l^0)) /\ ((1 + m^0) <= (0 + l^0))> <l9, l28, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((0 + l^0) <= (0 + i^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}> <l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((0 + l^0) <= (0 + i^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}> <l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((0 + l^0) <= (0 + i^0)) /\ ((1 + l^0) <= (0 + m^0))> <l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((0 + l^0) <= (0 + i^0)) /\ ((1 + m^0) <= (0 + l^0))>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634