Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273077
details
property
value
status
complete
benchmark
upAndDownIneq_rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
47.5032 seconds
cpu usage
47.5027
user time
43.5695
system time
3.93325
max virtual memory
1170900.0
max residence set size
402840.0
stage attributes
key
value
starexec-result
NO
output
47.47/47.49 NO 47.47/47.49 47.47/47.50 Solver Timeout: 4 47.47/47.50 Global Timeout: 300 47.47/47.50 No parsing errors! 47.47/47.50 Init Location: 0 47.47/47.50 Transitions: 47.47/47.50 <l0, l3, true> 47.47/47.50 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0, arg2 -> 0, arg3 -> arg2}> 47.47/47.50 <l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}> 47.47/47.50 <l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}> 47.47/47.50 <l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}> 47.47/47.50 <l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 1}> 47.47/47.50 <l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg2 -> 0, arg3 -> (arg3 - 1)}> 47.47/47.50 <l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg2 -> 0, arg3 -> 9}> 47.47/47.50 <l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg2 -> 1, arg3 -> (arg3 + 1)}> 47.47/47.50 <l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}> 47.47/47.50 <l3, l1, true, par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30}> 47.47/47.50 47.47/47.50 Fresh variables: 47.47/47.50 undef28, undef29, undef30, 47.47/47.50 47.47/47.50 Undef variables: 47.47/47.50 undef28, undef29, undef30, 47.47/47.50 47.47/47.50 Abstraction variables: 47.47/47.50 47.47/47.50 Exit nodes: 47.47/47.50 47.47/47.50 Accepting locations: 47.47/47.50 47.47/47.50 Asserts: 47.47/47.50 47.47/47.50 Preprocessed LLVMGraph 47.47/47.50 Init Location: 0 47.47/47.50 Transitions: 47.47/47.50 <l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = undef29) /\ (undef28 > 0) /\ (undef29 > ~(1))> 47.47/47.50 <l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}> 47.47/47.50 <l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}> 47.47/47.50 <l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}> 47.47/47.50 <l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 1}> 47.47/47.50 <l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg2 -> 0, arg3 -> (arg3 - 1)}> 47.47/47.50 <l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg2 -> 0, arg3 -> 9}> 47.47/47.50 <l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg2 -> 1, arg3 -> (arg3 + 1)}> 47.47/47.50 <l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}> 47.47/47.50 47.47/47.50 Fresh variables: 47.47/47.50 undef28, undef29, undef30, 47.47/47.50 47.47/47.50 Undef variables: 47.47/47.50 undef28, undef29, undef30, 47.47/47.50 47.47/47.50 Abstraction variables: 47.47/47.50 47.47/47.50 Exit nodes: 47.47/47.50 47.47/47.50 Accepting locations: 47.47/47.50 47.47/47.50 Asserts: 47.47/47.50 47.47/47.50 ************************************************************* 47.47/47.50 ******************************************************************************************* 47.47/47.50 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 47.47/47.50 ******************************************************************************************* 47.47/47.50 47.47/47.50 Init Location: 0 47.47/47.50 Graph 0: 47.47/47.50 Transitions: 47.47/47.50 Variables: 47.47/47.50 47.47/47.50 Graph 1: 47.47/47.50 Transitions: 47.47/47.50 <l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 <l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 <l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 <l2, l2, arg1 <= 1 /\ arg3 = 0, {arg1 -> 1, arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 <l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 47.47/47.50 <l2, l2, arg1 <= 1 /\ arg3 = 10, {arg2 -> 0, arg3 -> 9, rest remain the same}> 47.47/47.50 <l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 1, {arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> 47.47/47.50 <l2, l2, arg1 <= 1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}> 47.47/47.50 Variables: 47.47/47.50 arg1, arg2, arg3 47.47/47.50 47.47/47.50 Precedence: 47.47/47.50 Graph 0 47.47/47.50 47.47/47.50 Graph 1 47.47/47.50 <l0, l2, 0 <= undef29 /\ 1 <= undef28 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = undef29, {all remain the same}> 47.47/47.50 47.47/47.50 Map Locations to Subgraph: 47.47/47.50 ( 0 , 0 ) 47.47/47.50 ( 2 , 1 ) 47.47/47.50 47.47/47.50 ******************************************************************************************* 47.47/47.50 ******************************** CHECKING ASSERTIONS ******************************** 47.47/47.50 ******************************************************************************************* 47.47/47.50 47.47/47.50 Proving termination of subgraph 0 47.47/47.50 Proving termination of subgraph 1 47.47/47.50 Checking unfeasibility...
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