Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273794
details
property
value
status
complete
benchmark
Velroyen08-upAndDownIneq.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
43.0576 seconds
cpu usage
43.0421
user time
40.766
system time
2.27612
max virtual memory
1085960.0
max residence set size
417760.0
stage attributes
key
value
starexec-result
NO
output
43.01/43.05 NO 43.01/43.05 43.01/43.05 Solver Timeout: 4 43.01/43.05 Global Timeout: 300 43.01/43.05 No parsing errors! 43.01/43.05 Init Location: 0 43.01/43.05 Transitions: 43.01/43.05 <l0, l3, true> 43.01/43.05 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0}> 43.01/43.05 <l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 43.01/43.05 <l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 43.01/43.05 <l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}> 43.01/43.05 <l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}> 43.01/43.05 <l3, l1, true, par{arg1 -> undef11, arg2 -> undef12}> 43.01/43.05 43.01/43.05 Fresh variables: 43.01/43.05 undef11, undef12, 43.01/43.05 43.01/43.05 Undef variables: 43.01/43.05 undef11, undef12, 43.01/43.05 43.01/43.05 Abstraction variables: 43.01/43.05 43.01/43.05 Exit nodes: 43.01/43.05 43.01/43.05 Accepting locations: 43.01/43.05 43.01/43.05 Asserts: 43.01/43.05 43.01/43.05 Preprocessed LLVMGraph 43.01/43.05 Init Location: 0 43.01/43.05 Transitions: 43.01/43.05 <l0, l2, (arg1 = 0) /\ (arg2 = undef12) /\ (undef11 > 0) /\ (undef12 > ~(1))> 43.01/43.05 <l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}> 43.01/43.05 <l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}> 43.01/43.05 <l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}> 43.01/43.05 <l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}> 43.01/43.05 43.01/43.05 Fresh variables: 43.01/43.05 undef11, undef12, 43.01/43.05 43.01/43.05 Undef variables: 43.01/43.05 undef11, undef12, 43.01/43.05 43.01/43.05 Abstraction variables: 43.01/43.05 43.01/43.05 Exit nodes: 43.01/43.05 43.01/43.05 Accepting locations: 43.01/43.05 43.01/43.05 Asserts: 43.01/43.05 43.01/43.05 ************************************************************* 43.01/43.05 ******************************************************************************************* 43.01/43.05 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 43.01/43.05 ******************************************************************************************* 43.01/43.05 43.01/43.05 Init Location: 0 43.01/43.05 Graph 0: 43.01/43.05 Transitions: 43.01/43.05 Variables: 43.01/43.05 43.01/43.05 Graph 1: 43.01/43.05 Transitions: 43.01/43.05 <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}> 43.01/43.05 <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}> 43.01/43.05 <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}> 43.01/43.05 <l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}> 43.01/43.05 Variables: 43.01/43.05 arg1, arg2 43.01/43.05 43.01/43.05 Precedence: 43.01/43.05 Graph 0 43.01/43.05 43.01/43.05 Graph 1 43.01/43.05 <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}> 43.01/43.05 43.01/43.05 Map Locations to Subgraph: 43.01/43.05 ( 0 , 0 ) 43.01/43.05 ( 2 , 1 ) 43.01/43.05 43.01/43.05 ******************************************************************************************* 43.01/43.05 ******************************** CHECKING ASSERTIONS ******************************** 43.01/43.05 ******************************************************************************************* 43.01/43.05 43.01/43.05 Proving termination of subgraph 0 43.01/43.05 Proving termination of subgraph 1 43.01/43.05 Checking unfeasibility... 43.01/43.05 Time used: 0.160239 43.01/43.05 43.01/43.05 Checking conditional termination of SCC {l2}... 43.01/43.05 43.01/43.05 LOG: CALL solveLinear 43.01/43.05 43.01/43.05 LOG: RETURN solveLinear - Elapsed time: 0.002367s 43.01/43.05 43.01/43.05 LOG: CALL solveLinear 43.01/43.05 43.01/43.05 LOG: RETURN solveLinear - Elapsed time: 0.011660s 43.01/43.05 Trying to remove transition: <l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, 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