Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273602
details
property
value
status
complete
benchmark
PastaC10.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.082708 seconds
cpu usage
0.082874
user time
0.071979
system time
0.010895
max virtual memory
113176.0
max residence set size
13328.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.08 YES 0.00/0.08 0.00/0.08 Solver Timeout: 4 0.00/0.08 Global Timeout: 300 0.00/0.08 No parsing errors! 0.00/0.08 Init Location: 0 0.00/0.08 Transitions: 0.00/0.08 <l0, l3, true> 0.00/0.08 <l1, l2, (undef1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> (undef1 - undef2), arg4 -> 2}> 0.00/0.08 <l2, l2, (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef9 > ~(1)) /\ (undef10 > ~(1)) /\ (arg2 > ~(1)) /\ ((arg2 + (undef10 + 1)) >= 0), par{arg1 -> (arg1 - undef9), arg2 -> (arg2 + (undef10 + 1)), arg3 -> ((arg1 - undef9) - (arg2 + (undef10 + 1))), arg4 -> (arg4 + 2)}> 0.00/0.08 <l3, l1, true, par{arg1 -> undef11, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14}> 0.00/0.08 0.00/0.08 Fresh variables: 0.00/0.08 undef1, undef2, undef9, undef10, undef11, undef12, undef13, undef14, 0.00/0.08 0.00/0.08 Undef variables: 0.00/0.08 undef1, undef2, undef9, undef10, undef11, undef12, undef13, undef14, 0.00/0.08 0.00/0.08 Abstraction variables: 0.00/0.08 0.00/0.08 Exit nodes: 0.00/0.08 0.00/0.08 Accepting locations: 0.00/0.08 0.00/0.08 Asserts: 0.00/0.08 0.00/0.08 Preprocessed LLVMGraph 0.00/0.08 Init Location: 0 0.00/0.08 Transitions: 0.00/0.08 <l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = (undef1 - undef2)) /\ (arg4 = 2) /\ (undef1 > ~(1)) /\ (undef12 > ~(1)) /\ (undef2 > ~(1)) /\ (undef11 > 0)> 0.00/0.08 <l2, l2, (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef9 > ~(1)) /\ (undef10 > ~(1)) /\ (arg2 > ~(1)) /\ ((arg2 + (undef10 + 1)) >= 0), par{arg1 -> (arg1 - undef9), arg2 -> (arg2 + (undef10 + 1)), arg3 -> ((arg1 - undef9) - (arg2 + (undef10 + 1))), arg4 -> (arg4 + 2)}> 0.00/0.08 0.00/0.08 Fresh variables: 0.00/0.08 undef1, undef2, undef9, undef10, undef11, undef12, undef13, undef14, 0.00/0.08 0.00/0.08 Undef variables: 0.00/0.08 undef1, undef2, undef9, undef10, undef11, undef12, undef13, undef14, 0.00/0.08 0.00/0.08 Abstraction variables: 0.00/0.08 0.00/0.08 Exit nodes: 0.00/0.08 0.00/0.08 Accepting locations: 0.00/0.08 0.00/0.08 Asserts: 0.00/0.08 0.00/0.08 ************************************************************* 0.00/0.08 ******************************************************************************************* 0.00/0.08 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.08 ******************************************************************************************* 0.00/0.08 0.00/0.08 Init Location: 0 0.00/0.08 Graph 0: 0.00/0.08 Transitions: 0.00/0.08 Variables: 0.00/0.08 0.00/0.08 Graph 1: 0.00/0.08 Transitions: 0.00/0.08 <l2, l2, 1 <= arg3 /\ 0 <= 1 + arg2 + undef10 /\ 0 <= arg2 /\ 0 <= arg4 /\ 0 <= undef9 /\ 0 <= undef10, {arg1 -> arg1 - undef9, arg2 -> 1 + arg2 + undef10, arg3 -> -1 + arg1 - arg2 - undef9 - undef10, arg4 -> 2 + arg4, rest remain the same}> 0.00/0.08 Variables: 0.00/0.08 arg1, arg2, arg3, arg4 0.00/0.08 0.00/0.08 Precedence: 0.00/0.08 Graph 0 0.00/0.08 0.00/0.08 Graph 1 0.00/0.08 <l0, l2, 1 <= undef11 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef12 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 + undef2 = undef1 /\ arg4 = 2, {all remain the same}> 0.00/0.08 0.00/0.08 Map Locations to Subgraph: 0.00/0.08 ( 0 , 0 ) 0.00/0.08 ( 2 , 1 ) 0.00/0.08 0.00/0.08 ******************************************************************************************* 0.00/0.08 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.08 ******************************************************************************************* 0.00/0.08 0.00/0.08 Proving termination of subgraph 0 0.00/0.08 Proving termination of subgraph 1 0.00/0.08 Checking unfeasibility... 0.00/0.08 Time used: 0.005496 0.00/0.08 0.00/0.08 Checking conditional termination of SCC {l2}... 0.00/0.08 0.00/0.08 LOG: CALL solveLinear 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear - Elapsed time: 0.001054s 0.00/0.08 0.00/0.08 LOG: CALL solveLinear 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear - Elapsed time: 0.004121s 0.00/0.08 Trying to remove transition: <l2, l2, 1 <= arg3 /\ 0 <= 1 + arg2 + undef10 /\ 0 <= arg2 /\ 0 <= arg4 /\ 0 <= undef9 /\ 0 <= undef10, {arg1 -> arg1 - undef9, arg2 -> 1 + arg2 + undef10, arg3 -> -1 + arg1 - arg2 - undef9 - undef10, arg4 -> 2 + arg4, rest remain the same}> 0.00/0.08 Solving with 1 template(s). 0.00/0.08 0.00/0.08 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.08 0.00/0.08 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020619s 0.00/0.08 Time used: 0.020345 0.00/0.08 Solving with 1 template(s). 0.00/0.08 0.00/0.08 LOG: CALL solveNonLinearGetFirstSolution
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