Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273755
details
property
value
status
complete
benchmark
Et3-rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n018.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
13.4194 seconds
cpu usage
13.4173
user time
12.7978
system time
0.619557
max virtual memory
934352.0
max residence set size
211412.0
stage attributes
key
value
starexec-result
YES
output
13.37/13.41 YES 13.37/13.41 13.37/13.41 Solver Timeout: 4 13.37/13.41 Global Timeout: 300 13.37/13.41 No parsing errors! 13.37/13.41 Init Location: 0 13.37/13.41 Transitions: 13.37/13.41 <l0, l3, true> 13.37/13.41 <l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 13.37/13.41 <l1, l2, (arg1 > 0) /\ (undef4 > ~(1)) /\ (1 = arg2), par{arg1 -> undef4, arg2 -> 0, arg3 -> undef4}> 13.37/13.41 <l1, l2, (undef8 > ~(1)) /\ (arg2 > 1) /\ (undef7 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef7}> 13.37/13.41 <l2, l2, (arg1 > 0) /\ ((arg2 - 1) < arg2) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 - 1), arg3 -> (arg1 + arg2)}> 13.37/13.41 <l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 13.37/13.41 13.37/13.41 Fresh variables: 13.37/13.41 undef4, undef7, undef8, undef13, undef14, undef15, 13.37/13.41 13.37/13.41 Undef variables: 13.37/13.41 undef4, undef7, undef8, undef13, undef14, undef15, 13.37/13.41 13.37/13.41 Abstraction variables: 13.37/13.41 13.37/13.41 Exit nodes: 13.37/13.41 13.37/13.41 Accepting locations: 13.37/13.41 13.37/13.41 Asserts: 13.37/13.41 13.37/13.41 Preprocessed LLVMGraph 13.37/13.41 Init Location: 0 13.37/13.41 Transitions: 13.37/13.41 <l0, l2, (undef13 > 0) /\ (0 = undef14), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 13.37/13.41 <l0, l2, (undef13 > 0) /\ (undef4 > ~(1)) /\ (1 = undef14), par{arg1 -> undef4, arg2 -> 0, arg3 -> undef4}> 13.37/13.41 <l0, l2, (undef8 > ~(1)) /\ (undef14 > 1) /\ (undef7 > ~(1)) /\ (undef13 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef7}> 13.37/13.41 <l2, l2, (arg1 > 0) /\ ((arg2 - 1) < arg2) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 - 1), arg3 -> (arg1 + arg2)}> 13.37/13.41 13.37/13.41 Fresh variables: 13.37/13.41 undef4, undef7, undef8, undef13, undef14, undef15, 13.37/13.41 13.37/13.41 Undef variables: 13.37/13.41 undef4, undef7, undef8, undef13, undef14, undef15, 13.37/13.41 13.37/13.41 Abstraction variables: 13.37/13.41 13.37/13.41 Exit nodes: 13.37/13.41 13.37/13.41 Accepting locations: 13.37/13.41 13.37/13.41 Asserts: 13.37/13.41 13.37/13.41 ************************************************************* 13.37/13.41 ******************************************************************************************* 13.37/13.41 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 13.37/13.41 ******************************************************************************************* 13.37/13.41 13.37/13.41 Init Location: 0 13.37/13.41 Graph 0: 13.37/13.41 Transitions: 13.37/13.41 Variables: 13.37/13.41 13.37/13.41 Graph 1: 13.37/13.41 Transitions: 13.37/13.41 <l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> 13.37/13.41 Variables: 13.37/13.41 arg1, arg2, arg3 13.37/13.41 13.37/13.41 Precedence: 13.37/13.41 Graph 0 13.37/13.41 13.37/13.41 Graph 1 13.37/13.41 <l0, l2, 1 <= undef13 /\ undef14 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}> 13.37/13.41 <l0, l2, 0 <= undef4 /\ 1 <= undef13 /\ undef14 = 1, {arg1 -> undef4, arg2 -> 0, arg3 -> undef4, rest remain the same}> 13.37/13.41 <l0, l2, 0 <= undef7 /\ 0 <= undef8 /\ 1 <= undef13 /\ 2 <= undef14, {arg1 -> undef7, arg2 -> undef8, arg3 -> undef7, rest remain the same}> 13.37/13.41 13.37/13.41 Map Locations to Subgraph: 13.37/13.41 ( 0 , 0 ) 13.37/13.41 ( 2 , 1 ) 13.37/13.41 13.37/13.41 ******************************************************************************************* 13.37/13.41 ******************************** CHECKING ASSERTIONS ******************************** 13.37/13.41 ******************************************************************************************* 13.37/13.41 13.37/13.41 Proving termination of subgraph 0 13.37/13.41 Proving termination of subgraph 1 13.37/13.41 Checking unfeasibility... 13.37/13.41 Time used: 0.003363 13.37/13.41 13.37/13.41 Checking conditional termination of SCC {l2}... 13.37/13.41 13.37/13.41 LOG: CALL solveLinear 13.37/13.41 13.37/13.41 LOG: RETURN solveLinear - Elapsed time: 0.000629s 13.37/13.41 13.37/13.41 LOG: CALL solveLinear 13.37/13.41 13.37/13.41 LOG: RETURN solveLinear - Elapsed time: 0.002002s 13.37/13.41 Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> 13.37/13.41 Solving with 1 template(s). 13.37/13.41 13.37/13.41 LOG: CALL solveNonLinearGetFirstSolution
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