Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432276230
details
property
value
status
complete
benchmark
p-46.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n097.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.39862 seconds
cpu usage
5.39754
user time
4.76177
system time
0.635769
max virtual memory
812676.0
max residence set size
151520.0
stage attributes
key
value
starexec-result
NO
output
5.36/5.39 NO 5.36/5.39 5.36/5.39 Solver Timeout: 4 5.36/5.39 Global Timeout: 300 5.36/5.39 No parsing errors! 5.36/5.39 Init Location: 0 5.36/5.39 Transitions: 5.36/5.39 <l0, l10, true> 5.36/5.39 <l1, l2, true> 5.36/5.39 <l2, l3, ((1 + a_13^0) <= 1), par{result_11^0 -> (0 + temp0_14^0)}> 5.36/5.39 <l2, l4, (1 <= (0 + a_13^0)) /\ (undef19 = undef19) /\ (undef18 = (0 + undef19)) /\ (undef15 = undef15) /\ ((0 + a_13^0) <= (0 + (2 * undef18))) /\ ((0 + (2 * undef18)) <= (0 + a_13^0)) /\ (undef13 = (0 + undef18)) /\ ((0 + undef13) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef13)) /\ (1 <= (0 + (2 * undef18))), par{a_13^0 -> undef13, nondet_12^0 -> undef15, x_15^0 -> undef18}> 5.36/5.39 <l4, l2, true> 5.36/5.39 <l2, l5, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28), par{a_21^0 -> undef27, nondet_12^0 -> undef28, x_15^0 -> (0 + undef32)}> 5.36/5.39 <l5, l6, ((1 + a_13^0) <= (0 + (2 * x_15^0)))> 5.36/5.39 <l5, l6, ((1 + (2 * x_15^0)) <= (0 + a_13^0))> 5.36/5.39 <l6, l7, (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * a_21^0))) /\ ((1 + (3 * a_21^0)) <= (0 + undef45)), par{a_13^0 -> undef45}> 5.36/5.39 <l7, l8, ((1 + a_21^0) <= (0 + (2 * x_15^0)))> 5.36/5.39 <l7, l8, ((1 + (2 * x_15^0)) <= (0 + a_21^0))> 5.36/5.39 <l8, l9, (1 <= (0 + a_21^0))> 5.36/5.39 <l9, l2, true> 5.36/5.39 <l10, l1, true> 5.36/5.39 5.36/5.39 Fresh variables: 5.36/5.39 undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 5.36/5.39 5.36/5.39 Undef variables: 5.36/5.39 undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 5.36/5.39 5.36/5.39 Abstraction variables: 5.36/5.39 5.36/5.39 Exit nodes: 5.36/5.39 5.36/5.39 Accepting locations: 5.36/5.39 5.36/5.39 Asserts: 5.36/5.39 5.36/5.39 Preprocessed LLVMGraph 5.36/5.39 Init Location: 0 5.36/5.39 Transitions: 5.36/5.39 <l0, l2, true> 5.36/5.39 <l2, l3, ((1 + a_13^0) <= 1)> 5.36/5.39 <l2, l2, (1 <= (0 + a_13^0)) /\ (undef19 = undef19) /\ (undef18 = (0 + undef19)) /\ (undef15 = undef15) /\ ((0 + a_13^0) <= (0 + (2 * undef18))) /\ ((0 + (2 * undef18)) <= (0 + a_13^0)) /\ (undef13 = (0 + undef18)) /\ ((0 + undef13) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef13)) /\ (1 <= (0 + (2 * undef18))), par{a_13^0 -> undef13}> 5.36/5.39 <l2, l2, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28) /\ ((1 + a_13^0) <= (0 + (2 * (0 + undef32)))) /\ (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * undef27))) /\ ((1 + (3 * undef27)) <= (0 + undef45)) /\ ((1 + undef27) <= (0 + (2 * (0 + undef32)))) /\ (1 <= (0 + undef27)), par{a_13^0 -> undef45}> 5.36/5.39 <l2, l2, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28) /\ ((1 + (2 * (0 + undef32))) <= (0 + a_13^0)) /\ (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * undef27))) /\ ((1 + (3 * undef27)) <= (0 + undef45)) /\ ((1 + (2 * (0 + undef32))) <= (0 + undef27)) /\ (1 <= (0 + undef27)), par{a_13^0 -> undef45}> 5.36/5.39 5.36/5.39 Fresh variables: 5.36/5.39 undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 5.36/5.39 5.36/5.39 Undef variables: 5.36/5.39 undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 5.36/5.39 5.36/5.39 Abstraction variables: 5.36/5.39 5.36/5.39 Exit nodes: 5.36/5.39 5.36/5.39 Accepting locations: 5.36/5.39 5.36/5.39 Asserts: 5.36/5.39 5.36/5.39 ************************************************************* 5.36/5.39 ******************************************************************************************* 5.36/5.39 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.36/5.39 ******************************************************************************************* 5.36/5.39 5.36/5.39 Init Location: 0 5.36/5.39 Graph 0: 5.36/5.39 Transitions: 5.36/5.39 Variables: 5.36/5.39 5.36/5.39 Graph 1: 5.36/5.39 Transitions: 5.36/5.39 <l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}> 5.36/5.39 <l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}> 5.36/5.39 <l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}> 5.36/5.39 Variables: 5.36/5.39 a_13^0 5.36/5.39 5.36/5.39 Graph 2: 5.36/5.39 Transitions: 5.36/5.39 Variables: 5.36/5.39 5.36/5.39 Precedence: 5.36/5.39 Graph 0 5.36/5.39 5.36/5.39 Graph 1 5.36/5.39 <l0, l2, true, {all remain the same}> 5.36/5.39 5.36/5.39 Graph 2 5.36/5.39 <l2, l3, a_13^0 <= 0, {all remain the same}> 5.36/5.39 5.36/5.39 Map Locations to Subgraph: 5.36/5.39 ( 0 , 0 ) 5.36/5.39 ( 2 , 1 ) 5.36/5.39 ( 3 , 2 ) 5.36/5.39 5.36/5.39 ******************************************************************************************* 5.36/5.39 ******************************** CHECKING ASSERTIONS ******************************** 5.36/5.39 ******************************************************************************************* 5.36/5.39 5.36/5.39 Proving termination of subgraph 0
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