Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739012
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
n092.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
5.18438601494 seconds
cpu usage
14.477091259
max memory
4.10390528E8
stage attributes
key
value
output-size
9801
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, l3, true> <l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l1, l2, (arg1 > 0) /\ (undef4 > ~(1)) /\ (1 = arg2), par{arg1 -> undef4, arg2 -> 0, arg3 -> undef4}> <l1, l2, (undef8 > ~(1)) /\ (arg2 > 1) /\ (undef7 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef7}> <l2, l2, (arg1 > 0) /\ ((arg2 - 1) < arg2) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 - 1), arg3 -> (arg1 + arg2)}> <l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef4, undef7, undef8, undef13, undef14, undef15, Undef variables: undef4, undef7, undef8, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef13 > 0) /\ (0 = undef14), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l0, l2, (undef13 > 0) /\ (undef4 > ~(1)) /\ (1 = undef14), par{arg1 -> undef4, arg2 -> 0, arg3 -> undef4}> <l0, l2, (undef8 > ~(1)) /\ (undef14 > 1) /\ (undef7 > ~(1)) /\ (undef13 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef7}> <l2, l2, (arg1 > 0) /\ ((arg2 - 1) < arg2) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 - 1), arg3 -> (arg1 + arg2)}> Fresh variables: undef4, undef7, undef8, undef13, undef14, undef15, Undef variables: undef4, undef7, undef8, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= arg1 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef13 /\ undef14 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}> <l0, l2, 0 <= undef4 /\ 1 <= undef13 /\ undef14 = 1, {arg1 -> undef4, arg2 -> 0, arg3 -> undef4, rest remain the same}> <l0, l2, 0 <= undef7 /\ 0 <= undef8 /\ 1 <= undef13 /\ 2 <= undef14, {arg1 -> undef7, arg2 -> undef8, arg3 -> undef7, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003194 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000626s
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634