Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738322
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
n083.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.131344079971 seconds
cpu usage
0.23305576
max memory
6.2885888E7
stage attributes
key
value
output-size
7178
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l4, true> <l1, l2, (arg2 > ~(1)) /\ (undef6 <= (200 * arg2)) /\ (arg1 > 0), par{arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}> <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}> <l3, l3, (arg3 > 0) /\ (arg4 > ~(1)) /\ ((arg2 - 1) < arg2) /\ (arg5 >= arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}> <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)}> <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)}> <l4, l1, true, par{arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, arg5 -> undef35}> Fresh variables: undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, Undef variables: undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <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)> <l3, l3, (arg3 > 0) /\ (arg4 > ~(1)) /\ ((arg2 - 1) < arg2) /\ (arg5 >= arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}> <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)}> <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)}> Fresh variables: undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, Undef variables: undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 1 <= arg3 /\ arg4 <= arg5 /\ 0 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> <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}> <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}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 <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}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Detected abstraction incompatible with non-termination check. Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.033417 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634