Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273488
details
property
value
status
complete
benchmark
Velroyen08-whileNestedOffset.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
13.2774 seconds
cpu usage
13.2769
user time
12.953
system time
0.32389
max virtual memory
713076.0
max residence set size
73816.0
stage attributes
key
value
starexec-result
NO
output
13.20/13.27 NO 13.20/13.27 13.20/13.27 Solver Timeout: 4 13.20/13.27 Global Timeout: 300 13.20/13.27 No parsing errors! 13.20/13.27 Init Location: 0 13.20/13.27 Transitions: 13.20/13.27 <l0, l4, true> 13.20/13.27 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> 13.20/13.27 <l2, l3, (arg1 < 10), par{arg2 -> arg1, arg3 -> arg1}> 13.20/13.27 <l3, l2, (arg2 < 6) /\ (arg2 = arg3), par{arg1 -> (arg1 + 1), arg2 -> undef8, arg3 -> undef9}> 13.20/13.27 <l3, l3, (arg2 > 5) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 13.20/13.27 <l4, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 13.20/13.27 13.20/13.27 Fresh variables: 13.20/13.27 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 13.20/13.27 13.20/13.27 Undef variables: 13.20/13.27 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 13.20/13.27 13.20/13.27 Abstraction variables: 13.20/13.27 13.20/13.27 Exit nodes: 13.20/13.27 13.20/13.27 Accepting locations: 13.20/13.27 13.20/13.27 Asserts: 13.20/13.27 13.20/13.27 Preprocessed LLVMGraph 13.20/13.27 Init Location: 0 13.20/13.27 Transitions: 13.20/13.27 <l0, l3, (arg1 = undef14) /\ (arg2 = undef14) /\ (arg3 = undef14) /\ (undef13 > 0) /\ (undef14 > ~(1)) /\ (undef14 < 10)> 13.20/13.27 <l3, l3, (arg2 < 6) /\ (arg2 = arg3) /\ ((arg1 + 1) < 10), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 13.20/13.27 <l3, l3, (arg2 > 5) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> 13.20/13.27 13.20/13.27 Fresh variables: 13.20/13.27 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 13.20/13.27 13.20/13.27 Undef variables: 13.20/13.27 undef2, undef3, undef8, undef9, undef13, undef14, undef15, 13.20/13.27 13.20/13.27 Abstraction variables: 13.20/13.27 13.20/13.27 Exit nodes: 13.20/13.27 13.20/13.27 Accepting locations: 13.20/13.27 13.20/13.27 Asserts: 13.20/13.27 13.20/13.27 ************************************************************* 13.20/13.27 ******************************************************************************************* 13.20/13.27 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 13.20/13.27 ******************************************************************************************* 13.20/13.27 13.20/13.27 Init Location: 0 13.20/13.27 Graph 0: 13.20/13.27 Transitions: 13.20/13.27 Variables: 13.20/13.27 13.20/13.27 Graph 1: 13.20/13.27 Transitions: 13.20/13.27 <l3, l3, arg2 <= 5 /\ arg1 <= 8 /\ arg2 = arg3, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 13.20/13.27 <l3, l3, 6 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 Variables: 13.20/13.27 arg1, arg2, arg3 13.20/13.27 13.20/13.27 Precedence: 13.20/13.27 Graph 0 13.20/13.27 13.20/13.27 Graph 1 13.20/13.27 <l0, l3, 0 <= undef14 /\ 1 <= undef13 /\ undef14 <= 9 /\ arg1 = undef14 /\ arg2 = undef14 /\ arg3 = undef14, {all remain the same}> 13.20/13.27 13.20/13.27 Map Locations to Subgraph: 13.20/13.27 ( 0 , 0 ) 13.20/13.27 ( 3 , 1 ) 13.20/13.27 13.20/13.27 ******************************************************************************************* 13.20/13.27 ******************************** CHECKING ASSERTIONS ******************************** 13.20/13.27 ******************************************************************************************* 13.20/13.27 13.20/13.27 Proving termination of subgraph 0 13.20/13.27 Proving termination of subgraph 1 13.20/13.27 Checking unfeasibility... 13.20/13.27 Time used: 0.032012 13.20/13.27 13.20/13.27 Checking conditional termination of SCC {l3}... 13.20/13.27 13.20/13.27 LOG: CALL solveLinear 13.20/13.27 13.20/13.27 LOG: RETURN solveLinear - Elapsed time: 0.001748s 13.20/13.27 �[33mRanking function: �[36m8 - arg1�[0m 13.20/13.27 New Graphs: 13.20/13.27 Transitions: 13.20/13.27 <l3, l3, 6 <= arg2 /\ arg2 = arg3, {arg2 -> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> 13.20/13.27 Variables: 13.20/13.27 arg2, arg3 13.20/13.27 Checking conditional termination of SCC {l3}... 13.20/13.27 13.20/13.27 LOG: CALL solveLinear 13.20/13.27
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