Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381736900
details
property
value
status
complete
benchmark
costa09-example_2.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n192.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0299379825592 seconds
cpu usage
0.026167815
max memory
4263936.0
stage attributes
key
value
output-size
3001
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/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 > 0) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef2}> <l2, l3, (arg2 > 0) /\ (arg2 > undef5) /\ (undef5 > ~(1)) /\ (arg1 > ~(1))> <l3, l2, (arg2 > 0) /\ (arg2 > undef7) /\ (arg1 > ~(1)) /\ (undef7 > ~(1)) /\ ((arg2 - (2 * undef7)) < 2) /\ ((arg2 - (2 * undef7)) >= 0), par{arg1 -> (arg1 + undef7), arg2 -> undef7}> <l4, l1, true, par{arg1 -> undef8, arg2 -> undef9}> Fresh variables: undef2, undef5, undef7, undef8, undef9, Undef variables: undef2, undef5, undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = 0) /\ (arg2 = undef2) /\ (undef2 > ~(1)) /\ (undef9 > 0) /\ (undef8 > 0)> <l2, l2, (arg2 > 0) /\ (arg2 > undef5) /\ (undef5 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (arg2 > undef7) /\ (arg1 > ~(1)) /\ (undef7 > ~(1)) /\ ((arg2 - (2 * undef7)) < 2) /\ ((arg2 - (2 * undef7)) >= 0), par{arg1 -> (arg1 + undef7), arg2 -> undef7}> Fresh variables: undef2, undef5, undef7, undef8, undef9, Undef variables: undef2, undef5, undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= arg2 /\ 1 + undef5 <= arg2 /\ 1 + undef7 <= arg2 /\ arg2 <= 1 + 2*undef7 /\ 0 <= arg1 /\ 2*undef7 <= arg2 /\ 0 <= undef5 /\ 0 <= undef7, {arg1 -> arg1 + undef7, arg2 -> undef7, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef8 /\ 1 <= undef9 /\ 0 <= undef2 /\ arg1 = 0 /\ arg2 = undef2, {all 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.002478 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001241s �[33mRanking function: �[36m-2 + 2*arg2�[0m New Graphs: �[32mProgram Terminates�[0m
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634