Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274847
details
property
value
status
complete
benchmark
popl07-fail.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n128.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.144232 seconds
cpu usage
0.14441
user time
0.124552
system time
0.019858
max virtual memory
113176.0
max residence set size
33788.0
stage attributes
key
value
starexec-result
NO
output
0.00/0.14 NO 0.00/0.14 0.00/0.14 Solver Timeout: 4 0.00/0.14 Global Timeout: 300 0.00/0.14 No parsing errors! 0.00/0.14 Init Location: 0 0.00/0.14 Transitions: 0.00/0.14 <l0, l14, true> 0.00/0.14 <l1, l2, true> 0.00/0.14 <l3, l4, true, par{num^0 -> 0}> 0.00/0.14 <l5, l3, true> 0.00/0.14 <l6, l5, ((1 + status^0) <= 2)> 0.00/0.14 <l6, l5, (3 <= (0 + status^0))> 0.00/0.14 <l6, l5, (2 <= (0 + status^0)) /\ ((0 + status^0) <= 2), par{a1111^0 -> (0 + DName^0), num^0 -> (1 + num^0)}> 0.00/0.14 <l7, l6, true, par{Pdoi^0 -> 0}> 0.00/0.14 <l8, l9, (1 <= (0 + status^0)) /\ ((0 + status^0) <= 1), par{i^0 -> (1 + i^0)}> 0.00/0.14 <l8, l7, ((1 + status^0) <= 1)> 0.00/0.14 <l8, l7, (2 <= (0 + status^0))> 0.00/0.14 <l9, l10, true> 0.00/0.14 <l11, l8, ((0 + DName^0) <= 0) /\ (undef275 = undef275) /\ (undef270 = (0 + undef275)) /\ (undef277 = 1), par{a77^0 -> (0 + DName^0), a88^0 -> (0 + Pdoi^0), pc^0 -> 0, ret_IoCreateDevice1010^0 -> undef270, status^0 -> (0 + undef270), tmp99^0 -> undef275}> 0.00/0.14 <l11, l3, (1 <= (0 + DName^0))> 0.00/0.14 <l4, l12, true> 0.00/0.14 <l12, l4, true> 0.00/0.14 <l10, l11, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef367 = undef367) /\ (undef364 = (0 + undef367)), par{DName^0 -> (0 + undef364), a11^0 -> (0 + lptNamei^0), b22^0 -> (0 + PdoType^0), c33^0 -> (0 + dcIdi^0), d44^0 -> (0 + num^0), ret_PPMakeDeviceName66^0 -> undef364, tmp55^0 -> undef367}> 0.00/0.14 <l10, l3, ((0 + Pdolen^0) <= (0 + i^0))> 0.00/0.14 <l13, l9, (undef415 = 0) /\ (undef416 = (0 + undef415)) /\ (undef417 = 1), par{set^0 -> 0, unset^0 -> undef415}> 0.00/0.14 <l14, l13, true> 0.00/0.14 0.00/0.14 Fresh variables: 0.00/0.14 undef270, undef275, undef277, undef364, undef367, undef415, undef416, undef417, 0.00/0.14 0.00/0.14 Undef variables: 0.00/0.14 undef270, undef275, undef277, undef364, undef367, undef415, undef416, undef417, 0.00/0.14 0.00/0.14 Abstraction variables: 0.00/0.14 0.00/0.14 Exit nodes: 0.00/0.14 0.00/0.14 Accepting locations: 0.00/0.14 0.00/0.14 Asserts: 0.00/0.14 0.00/0.14 Preprocessed LLVMGraph 0.00/0.14 Init Location: 0 0.00/0.14 Transitions: 0.00/0.14 <l0, l9, (undef415 = 0) /\ (undef416 = (0 + undef415)) /\ (undef417 = 1)> 0.00/0.14 <l4, l4, true> 0.00/0.14 <l9, l9, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef367 = undef367) /\ (undef364 = (0 + undef367)) /\ ((0 + (0 + undef364)) <= 0) /\ (undef275 = undef275) /\ (undef270 = (0 + undef275)) /\ (undef277 = 1) /\ (1 <= (0 + (0 + undef270))) /\ ((0 + (0 + undef270)) <= 1), par{i^0 -> (1 + i^0)}> 0.00/0.14 <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef367 = undef367) /\ (undef364 = (0 + undef367)) /\ ((0 + (0 + undef364)) <= 0) /\ (undef275 = undef275) /\ (undef270 = (0 + undef275)) /\ (undef277 = 1) /\ ((1 + (0 + undef270)) <= 1) /\ ((1 + (0 + undef270)) <= 2), par{Pdoi^0 -> 0, num^0 -> 0}> 0.00/0.14 <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef367 = undef367) /\ (undef364 = (0 + undef367)) /\ ((0 + (0 + undef364)) <= 0) /\ (undef275 = undef275) /\ (undef270 = (0 + undef275)) /\ (undef277 = 1) /\ (2 <= (0 + (0 + undef270))) /\ (3 <= (0 + (0 + undef270))), par{Pdoi^0 -> 0, num^0 -> 0}> 0.00/0.14 <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef367 = undef367) /\ (undef364 = (0 + undef367)) /\ ((0 + (0 + undef364)) <= 0) /\ (undef275 = undef275) /\ (undef270 = (0 + undef275)) /\ (undef277 = 1) /\ (2 <= (0 + (0 + undef270))) /\ (2 <= (0 + (0 + undef270))) /\ ((0 + (0 + undef270)) <= 2), par{Pdoi^0 -> 0, num^0 -> 0}> 0.00/0.14 <l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef367 = undef367) /\ (undef364 = (0 + undef367)) /\ (1 <= (0 + (0 + undef364))), par{num^0 -> 0}> 0.00/0.14 <l9, l4, ((0 + Pdolen^0) <= (0 + i^0)), par{num^0 -> 0}> 0.00/0.14 0.00/0.14 Fresh variables: 0.00/0.14 undef270, undef275, undef277, undef364, undef367, undef415, undef416, undef417, 0.00/0.14 0.00/0.14 Undef variables: 0.00/0.14 undef270, undef275, undef277, undef364, undef367, undef415, undef416, undef417, 0.00/0.14 0.00/0.14 Abstraction variables: 0.00/0.14 0.00/0.14 Exit nodes: 0.00/0.14 0.00/0.14 Accepting locations: 0.00/0.14 0.00/0.14 Asserts: 0.00/0.14 0.00/0.14 ************************************************************* 0.00/0.14 ******************************************************************************************* 0.00/0.14 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.14 ******************************************************************************************* 0.00/0.14 0.00/0.14 Init Location: 0 0.00/0.14 Graph 0: 0.00/0.14 Transitions: 0.00/0.14 Variables: 0.00/0.14 0.00/0.14 Graph 1: 0.00/0.14 Transitions: 0.00/0.14 <l9, l9, undef364 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef270 = undef275 /\ undef364 = undef367 /\ undef270 = 1 /\ undef277 = 1, {i^0 -> 1 + i^0, rest remain the same}> 0.00/0.14 Variables: 0.00/0.14 Pdolen^0, i^0 0.00/0.14 0.00/0.14 Graph 2: 0.00/0.14 Transitions: 0.00/0.14 <l4, l4, true, {all remain the same}> 0.00/0.14 Variables: 0.00/0.14 0.00/0.14 Precedence: 0.00/0.14 Graph 0 0.00/0.14 0.00/0.14 Graph 1 0.00/0.14 <l0, l9, undef415 = 0 /\ undef415 = undef416 /\ undef417 = 1, {all remain the same}> 0.00/0.14 0.00/0.14 Graph 2 0.00/0.14 <l9, l4, undef270 <= 0 /\ undef364 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef270 = undef275 /\ undef364 = undef367 /\ undef277 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}> 0.00/0.14 <l9, l4, undef364 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 3 <= undef270 /\ undef270 = undef275 /\ undef364 = undef367 /\ undef277 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}> 0.00/0.14 <l9, l4, undef364 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef270 = undef275 /\ undef364 = undef367 /\ undef277 = 1 /\ undef270 = 2, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}> 0.00/0.14 <l9, l4, 1 + i^0 <= Pdolen^0 /\ 1 <= undef364 /\ undef364 = undef367, {num^0 -> 0, rest remain the same}>
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