Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273410
details
property
value
status
complete
benchmark
Test12.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n006.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.13409 seconds
cpu usage
0.134229
user time
0.108959
system time
0.02527
max virtual memory
113176.0
max residence set size
25700.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.13 YES 0.00/0.13 0.00/0.13 Solver Timeout: 4 0.00/0.13 Global Timeout: 300 0.00/0.13 No parsing errors! 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 <l0, l4, true> 0.00/0.13 <l1, l2, (arg2 > ~(1)) /\ (undef6 <= (200 * arg2)) /\ (arg1 > 0), par{arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}> 0.00/0.13 <l2, l3, (arg2 > ~(1)) /\ (undef8 <= (200 * arg2)) /\ (arg1 > 0) /\ (((200 * arg2) - (13 * undef8)) < 13) /\ (((200 * arg2) - (13 * undef8)) >= 0), par{arg1 -> (100 * arg2), arg2 -> undef8, arg3 -> ((100 * arg2) + undef8), arg4 -> arg2, arg5 -> 0}> 0.00/0.13 <l3, l3, (arg3 > 0) /\ (arg4 > ~(1)) /\ ((arg2 - 1) < arg2) /\ (arg5 >= arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}> 0.00/0.13 <l3, l3, (arg4 > 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)) /\ ((undef22 * undef23) <= 9) /\ ((arg5 + 2) <= arg4) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1)), arg5 -> (arg5 + 2)}> 0.00/0.13 <l3, l3, (arg4 > 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef29 > ~(1)) /\ (undef30 > ~(1)) /\ ((undef29 * undef30) > 9) /\ ((arg5 + 2) <= arg4) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2), arg5 -> (arg5 + 2)}> 0.00/0.13 <l4, l1, true, par{arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, arg5 -> undef35}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 Preprocessed LLVMGraph 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 <l0, l3, (arg1 = (100 * undef32)) /\ (arg2 = undef8) /\ (arg3 = ((100 * undef32) + undef8)) /\ (arg4 = undef32) /\ (arg5 = 0) /\ (undef32 > ~(1)) /\ (undef6 <= (200 * undef32)) /\ (undef31 > 0) /\ (undef32 > ~(1)) /\ (undef8 <= (200 * undef32)) /\ (undef31 > 0) /\ (((200 * undef32) - (13 * undef8)) < 13) /\ (((200 * undef32) - (13 * undef8)) >= 0)> 0.00/0.13 <l3, l3, (arg3 > 0) /\ (arg4 > ~(1)) /\ ((arg2 - 1) < arg2) /\ (arg5 >= arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}> 0.00/0.13 <l3, l3, (arg4 > 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)) /\ ((arg5 + 2) <= arg4) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1)), arg5 -> (arg5 + 2)}> 0.00/0.13 <l3, l3, (arg4 > 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef29 > ~(1)) /\ (undef30 > ~(1)) /\ ((arg5 + 2) <= arg4) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2), arg5 -> (arg5 + 2)}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 ************************************************************* 0.00/0.13 ******************************************************************************************* 0.00/0.13 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 Init Location: 0 0.00/0.13 Graph 0: 0.00/0.13 Transitions: 0.00/0.13 Variables: 0.00/0.13 0.00/0.13 Graph 1: 0.00/0.13 Transitions: 0.00/0.13 <l3, l3, 1 <= arg3 /\ arg4 <= arg5 /\ 0 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> 0.00/0.13 <l3, l3, 1 <= arg3 /\ 0 <= arg5 /\ 0 <= undef22 /\ 0 <= undef23 /\ 2 <= arg4 /\ 2 + arg5 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}> 0.00/0.13 <l3, l3, 1 <= arg3 /\ 0 <= arg5 /\ 0 <= undef29 /\ 0 <= undef30 /\ 2 <= arg4 /\ 2 + arg5 <= arg4, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 arg1, arg2, arg3, arg4, arg5 0.00/0.13 0.00/0.13 Precedence: 0.00/0.13 Graph 0 0.00/0.13 0.00/0.13 Graph 1 0.00/0.13 <l0, l3, 1 <= undef31 /\ undef6 <= 200*undef32 /\ undef8 <= 200*undef32 /\ 13*undef8 <= 200*undef32 /\ 0 <= undef32 /\ 200*undef32 <= 12 + 13*undef8 /\ arg1 = 100*undef32 /\ arg2 = undef8 /\ arg3 = undef8 + 100*undef32 /\ arg4 = undef32 /\ arg5 = 0, {all remain the same}> 0.00/0.13 0.00/0.13 Map Locations to Subgraph: 0.00/0.13 ( 0 , 0 ) 0.00/0.13 ( 3 , 1 ) 0.00/0.13 0.00/0.13 ******************************************************************************************* 0.00/0.13 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 Detected abstraction incompatible with non-termination check. 0.00/0.13 Proving termination of subgraph 0 0.00/0.13 Proving termination of subgraph 1 0.00/0.13 Checking unfeasibility... 0.00/0.13 Time used: 0.035418 0.00/0.13 0.00/0.13 Checking conditional termination of SCC {l3}... 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.003418s 0.00/0.13 �[33mRanking function: �[36marg4 - arg5�[0m 0.00/0.13 New Graphs: 0.00/0.13 Transitions: 0.00/0.13 <l3, l3, 1 <= arg3 /\ arg4 <= arg5 /\ 0 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 arg1, arg2, arg3, arg4, arg5
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