Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737746
details
property
value
status
complete
benchmark
Mod.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0640890598297 seconds
cpu usage
0.060338324
max memory
7135232.0
stage attributes
key
value
output-size
5224
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, (undef2 > ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}> <l2, l3, (arg2 <= arg1) /\ (arg2 > 0), par{arg1 -> arg2, arg2 -> arg1, arg3 -> arg2, arg4 -> arg2}> <l3, l2, (0 = arg3) /\ (0 = arg4), par{arg1 -> arg2, arg2 -> arg1, arg3 -> undef11, arg4 -> undef12}> <l3, l3, (arg3 < 0) /\ (arg3 < 1) /\ (arg3 = arg4), par{arg2 -> (arg2 + 1), arg3 -> (arg3 + 1), arg4 -> (arg3 + 1)}> <l3, l3, (arg3 > 0) /\ (arg3 < 1) /\ (arg3 = arg4), par{arg2 -> (arg2 + 1), arg3 -> (arg3 + 1), arg4 -> (arg3 + 1)}> <l3, l3, (arg3 > 0) /\ (arg3 = arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg3 - 1), arg4 -> (arg3 - 1)}> <l4, l1, true, par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}> Fresh variables: undef1, undef2, undef3, undef4, undef11, undef12, undef25, undef26, undef27, undef28, Undef variables: undef1, undef2, undef3, undef4, undef11, undef12, undef25, undef26, undef27, undef28, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (arg1 = undef2) /\ (arg2 = undef1) /\ (arg3 = undef2) /\ (arg4 = undef2) /\ (undef2 > ~(1)) /\ (undef26 > 1) /\ (undef1 > ~(1)) /\ (undef25 > 0) /\ (undef2 <= undef1) /\ (undef2 > 0)> <l3, l3, (0 = arg3) /\ (0 = arg4) /\ (arg1 <= arg2) /\ (arg1 > 0), par{arg1 -> arg1, arg2 -> arg2, arg3 -> arg1, arg4 -> arg1}> <l3, l3, (arg3 < 0) /\ (arg3 < 1) /\ (arg3 = arg4), par{arg2 -> (arg2 + 1), arg3 -> (arg3 + 1), arg4 -> (arg3 + 1)}> <l3, l3, (arg3 > 0) /\ (arg3 = arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg3 - 1), arg4 -> (arg3 - 1)}> Fresh variables: undef1, undef2, undef3, undef4, undef11, undef12, undef25, undef26, undef27, undef28, Undef variables: undef1, undef2, undef3, undef4, undef11, undef12, undef25, undef26, undef27, undef28, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, 1 <= arg1 /\ arg1 <= arg2 /\ arg3 = 0 /\ arg4 = 0, {arg3 -> arg1, arg4 -> arg1, rest remain the same}> <l3, l3, 1 + arg3 <= 0 /\ arg3 = arg4, {arg2 -> 1 + arg2, arg3 -> 1 + arg3, arg4 -> 1 + arg3, rest remain the same}> <l3, l3, 1 <= arg3 /\ arg3 = arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg3, arg4 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 <l0, l3, 1 <= undef2 /\ 1 <= undef25 /\ 0 <= undef1 /\ undef2 <= undef1 /\ 2 <= undef26 /\ arg1 = undef2 /\ arg2 = undef1 /\ arg3 = undef2 /\ arg4 = undef2, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.011146 �[33mSome transition disabled by a set of invariant(s):�[0m �[36mInvariant at l3: 0 <= arg3 + arg4�[0m �[33mStrengthening and disabling transitions...�[0m > It's unfeasible. Removing transition:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634