Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275450
details
property
value
status
complete
benchmark
two_arrays2.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n113.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.068279 seconds
cpu usage
0.068371
user time
0.058781
system time
0.00959
max virtual memory
113176.0
max residence set size
6592.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.06 YES 0.00/0.06 0.00/0.06 Solver Timeout: 4 0.00/0.06 Global Timeout: 300 0.00/0.06 No parsing errors! 0.00/0.06 Init Location: 0 0.00/0.06 Transitions: 0.00/0.06 <l0, l19, true> 0.00/0.06 <l1, l2, true> 0.00/0.06 <l3, l4, ((0 + arraySize^0) <= (0 + i^0))> 0.00/0.06 <l3, l5, ((1 + i^0) <= (0 + arraySize^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l6, l7, true> 0.00/0.06 <l8, l5, ((0 + arraySize^0) <= (0 + i17^0)), par{i^0 -> 0}> 0.00/0.06 <l8, l9, ((1 + i17^0) <= (0 + arraySize^0)), par{i17^0 -> (1 + i17^0)}> 0.00/0.06 <l10, l11, true> 0.00/0.06 <l12, l9, ((0 + arraySize^0) <= (0 + i15^0)) /\ (undef81 = 0), par{i17^0 -> 0}> 0.00/0.06 <l12, l13, ((1 + i15^0) <= (0 + arraySize^0)), par{i15^0 -> (1 + i15^0)}> 0.00/0.06 <l14, l15, true> 0.00/0.06 <l16, l13, ((0 + arraySize^0) <= (0 + i13^0)) /\ (undef112 = 0), par{i15^0 -> 0}> 0.00/0.06 <l16, l17, ((1 + i13^0) <= (0 + arraySize^0)), par{i13^0 -> (1 + i13^0)}> 0.00/0.06 <l17, l16, true> 0.00/0.06 <l15, l17, ((0 + arraySize^0) <= (0 + i^0)) /\ (undef143 = 0), par{i13^0 -> 0}> 0.00/0.06 <l15, l14, ((1 + i^0) <= (0 + arraySize^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l13, l12, true> 0.00/0.06 <l11, l14, ((0 + arraySize^0) <= (0 + i11^0)), par{i^0 -> 0}> 0.00/0.06 <l11, l10, ((1 + i11^0) <= (0 + arraySize^0)), par{i11^0 -> (1 + i11^0)}> 0.00/0.06 <l9, l8, true> 0.00/0.06 <l7, l10, ((0 + arraySize^0) <= (0 + i9^0)) /\ (undef204 = 0), par{i11^0 -> 0}> 0.00/0.06 <l7, l6, ((1 + i9^0) <= (0 + arraySize^0)), par{i9^0 -> (1 + i9^0)}> 0.00/0.06 <l5, l3, true> 0.00/0.06 <l2, l6, ((0 + arraySize^0) <= (0 + i7^0)) /\ (undef235 = 0), par{i9^0 -> 0}> 0.00/0.06 <l2, l1, ((1 + i7^0) <= (0 + arraySize^0)), par{i7^0 -> (1 + i7^0)}> 0.00/0.06 <l18, l1, (undef254 = undef254) /\ (undef255 = undef255) /\ (undef256 = 0), par{i7^0 -> 0, i^0 -> 0, tmp^0 -> undef254, tmp___0^0 -> undef255}> 0.00/0.06 <l19, l18, true> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef81, undef112, undef143, undef204, undef235, undef254, undef255, undef256, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef81, undef112, undef143, undef204, undef235, undef254, undef255, undef256, 0.00/0.06 0.00/0.06 Abstraction variables: 0.00/0.06 0.00/0.06 Exit nodes: 0.00/0.06 0.00/0.06 Accepting locations: 0.00/0.06 0.00/0.06 Asserts: 0.00/0.06 0.00/0.06 Preprocessed LLVMGraph 0.00/0.06 Init Location: 0 0.00/0.06 Transitions: 0.00/0.06 <l0, l1, (i7^0 = 0) /\ (i^0 = 0) /\ (undef254 = undef254) /\ (undef255 = undef255) /\ (undef256 = 0)> 0.00/0.06 <l1, l6, ((0 + arraySize^0) <= (0 + i7^0)) /\ (undef235 = 0), par{i9^0 -> 0}> 0.00/0.06 <l1, l1, ((1 + i7^0) <= (0 + arraySize^0)), par{i7^0 -> (1 + i7^0)}> 0.00/0.06 <l5, l4, ((0 + arraySize^0) <= (0 + i^0))> 0.00/0.06 <l5, l5, ((1 + i^0) <= (0 + arraySize^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l6, l10, ((0 + arraySize^0) <= (0 + i9^0)) /\ (undef204 = 0), par{i11^0 -> 0}> 0.00/0.06 <l6, l6, ((1 + i9^0) <= (0 + arraySize^0)), par{i9^0 -> (1 + i9^0)}> 0.00/0.06 <l9, l5, ((0 + arraySize^0) <= (0 + i17^0)), par{i^0 -> 0}> 0.00/0.06 <l9, l9, ((1 + i17^0) <= (0 + arraySize^0)), par{i17^0 -> (1 + i17^0)}> 0.00/0.06 <l10, l14, ((0 + arraySize^0) <= (0 + i11^0)), par{i^0 -> 0}> 0.00/0.06 <l10, l10, ((1 + i11^0) <= (0 + arraySize^0)), par{i11^0 -> (1 + i11^0)}> 0.00/0.06 <l13, l9, ((0 + arraySize^0) <= (0 + i15^0)) /\ (undef81 = 0), par{i17^0 -> 0}> 0.00/0.06 <l13, l13, ((1 + i15^0) <= (0 + arraySize^0)), par{i15^0 -> (1 + i15^0)}> 0.00/0.06 <l14, l17, ((0 + arraySize^0) <= (0 + i^0)) /\ (undef143 = 0), par{i13^0 -> 0}> 0.00/0.06 <l14, l14, ((1 + i^0) <= (0 + arraySize^0)), par{i^0 -> (1 + i^0)}> 0.00/0.06 <l17, l13, ((0 + arraySize^0) <= (0 + i13^0)) /\ (undef112 = 0), par{i15^0 -> 0}> 0.00/0.06 <l17, l17, ((1 + i13^0) <= (0 + arraySize^0)), par{i13^0 -> (1 + i13^0)}> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef81, undef112, undef143, undef204, undef235, undef254, undef255, undef256, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef81, undef112, undef143, undef204, undef235, undef254, undef255, undef256, 0.00/0.06 0.00/0.06 Abstraction variables: 0.00/0.06 0.00/0.06 Exit nodes: 0.00/0.06 0.00/0.06 Accepting locations: 0.00/0.06 0.00/0.06 Asserts: 0.00/0.06 0.00/0.06 ************************************************************* 0.00/0.06 ******************************************************************************************* 0.00/0.06 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.06 ******************************************************************************************* 0.00/0.06 0.00/0.06 Init Location: 0 0.00/0.06 Graph 0: 0.00/0.06 Transitions: 0.00/0.06 Variables: 0.00/0.06 0.00/0.06 Graph 1: 0.00/0.06 Transitions: 0.00/0.06 <l1, l1, 1 + i7^0 <= arraySize^0, {i7^0 -> 1 + i7^0, rest remain the same}> 0.00/0.06 Variables: 0.00/0.06 arraySize^0, i7^0 0.00/0.06
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