Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737056
details
property
value
status
complete
benchmark
Test10.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0458559989929 seconds
cpu usage
0.041284845
max memory
5029888.0
stage attributes
key
value
output-size
5013
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, l5, true> <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> <l2, l3, true, par{arg2 -> arg1, arg3 -> arg1}> <l3, l2, ((arg1 - 1) < arg1) /\ (arg1 > 0) /\ (arg2 > 99) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> undef8, arg3 -> undef9}> <l3, l4, (arg2 > 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg1 -> arg2, arg2 -> undef11, arg3 -> undef12}> <l3, l4, (arg2 < 100) /\ (arg2 > 0) /\ (arg2 = arg3), par{arg1 -> arg2, arg2 -> undef14, arg3 -> undef15}> <l3, l3, (arg2 < 100) /\ (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> <l4, l4, (arg1 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef20, arg3 -> undef21}> <l5, l1, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> Fresh variables: undef2, undef3, undef8, undef9, undef11, undef12, undef14, undef15, undef20, undef21, undef22, undef23, undef24, Undef variables: undef2, undef3, undef8, undef9, undef11, undef12, undef14, undef15, undef20, undef21, undef22, undef23, undef24, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (arg1 = undef23) /\ (arg2 = undef23) /\ (arg3 = undef23) /\ (undef22 > 0) /\ (undef23 > ~(1))> <l3, l3, ((arg1 - 1) < arg1) /\ (arg1 > 0) /\ (arg2 > 99) /\ (arg2 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1), arg3 -> (arg1 - 1)}> <l3, l4, (arg2 > 0) /\ (arg2 < 100) /\ (arg2 = arg3), par{arg1 -> arg2, arg2 -> undef11, arg3 -> undef12}> <l3, l4, (arg2 < 100) /\ (arg2 > 0) /\ (arg2 = arg3), par{arg1 -> arg2, arg2 -> undef14, arg3 -> undef15}> <l3, l3, (arg2 < 100) /\ (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> <l4, l4, (arg1 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef20, arg3 -> undef21}> Fresh variables: undef2, undef3, undef8, undef9, undef11, undef12, undef14, undef15, undef20, undef21, undef22, undef23, undef24, Undef variables: undef2, undef3, undef8, undef9, undef11, undef12, undef14, undef15, undef20, undef21, undef22, undef23, undef24, 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 /\ 100 <= arg2 /\ arg2 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg1, arg3 -> -1 + arg1, rest remain the same}> <l3, l3, 1 <= arg2 /\ arg2 <= 99 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: <l4, l4, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef20, arg3 -> undef21, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l3, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = undef23 /\ arg2 = undef23 /\ arg3 = undef23, {all remain the same}> Graph 2 <l3, l4, 1 <= arg2 /\ arg2 <= 99 /\ arg2 = arg3, {arg1 -> arg2, arg2 -> undef11, arg3 -> undef12, rest remain the same}> <l3, l4, 1 <= arg2 /\ arg2 <= 99 /\ arg2 = arg3, {arg1 -> arg2, arg2 -> undef14, arg3 -> undef15, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 4 , 2 )
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634