Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275654
details
property
value
status
complete
benchmark
p-63.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.042215 seconds
cpu usage
0.042367
user time
0.032584
system time
0.009783
max virtual memory
113176.0
max residence set size
7368.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.03 YES 0.00/0.03 0.00/0.04 Solver Timeout: 4 0.00/0.04 Global Timeout: 300 0.00/0.04 No parsing errors! 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 <l0, l7, true> 0.00/0.04 <l1, l2, true> 0.00/0.04 <l3, l4, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)), par{Result_4^0 -> (0 + undef10), ___cil_tmp4_8^0 -> undef10, ___retres3_7^0 -> undef12}> 0.00/0.04 <l3, l5, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + d_6^0) + i_5^0)}> 0.00/0.04 <l5, l3, true> 0.00/0.04 <l2, l4, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)), par{Result_4^0 -> (0 + undef31), ___cil_tmp4_8^0 -> undef31, ___retres3_7^0 -> undef33}> 0.00/0.04 <l2, l3, (0 <= (~(1) + (~(1) * d_6^0)))> 0.00/0.04 <l4, l6, (undef46 = 0) /\ (undef44 = (0 + undef46)), par{Result_4^0 -> (0 + undef44), ___cil_tmp2_10^0 -> undef44, ___retres1_9^0 -> undef46}> 0.00/0.04 <l7, l1, true> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef10, undef12, undef31, undef33, undef44, undef46, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef10, undef12, undef31, undef33, undef44, undef46, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 Preprocessed LLVMGraph 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 <l0, l6, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))> 0.00/0.04 <l0, l3, (0 <= (~(1) + (~(1) * d_6^0)))> 0.00/0.04 <l3, l6, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))> 0.00/0.04 <l3, l3, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + d_6^0) + i_5^0)}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef10, undef12, undef31, undef33, undef44, undef46, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef10, undef12, undef31, undef33, undef44, undef46, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 ************************************************************* 0.00/0.04 ******************************************************************************************* 0.00/0.04 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Init Location: 0 0.00/0.04 Graph 0: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Graph 1: 0.00/0.04 Transitions: 0.00/0.04 <l3, l3, 0 <= i_5^0, {i_5^0 -> d_6^0 + i_5^0, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 d_6^0, i_5^0 0.00/0.04 0.00/0.04 Graph 2: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Precedence: 0.00/0.04 Graph 0 0.00/0.04 0.00/0.04 Graph 1 0.00/0.04 <l0, l3, 1 + d_6^0 <= 0, {all remain the same}> 0.00/0.04 0.00/0.04 Graph 2 0.00/0.04 <l0, l6, 0 <= d_6^0 /\ undef31 = undef33 /\ undef33 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}> 0.00/0.04 <l3, l6, 1 + i_5^0 <= 0 /\ undef10 = undef12 /\ undef12 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}> 0.00/0.04 0.00/0.04 Map Locations to Subgraph: 0.00/0.04 ( 0 , 0 ) 0.00/0.04 ( 3 , 1 ) 0.00/0.04 ( 6 , 2 ) 0.00/0.04 0.00/0.04 ******************************************************************************************* 0.00/0.04 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Proving termination of subgraph 0 0.00/0.04 Proving termination of subgraph 1 0.00/0.04 Checking unfeasibility... 0.00/0.04 Time used: 0.002254 0.00/0.04 0.00/0.04 Checking conditional termination of SCC {l3}... 0.00/0.04 0.00/0.04 LOG: CALL solveLinear
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