Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738838
details
property
value
status
complete
benchmark
Swingers.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
5.01843285561 seconds
cpu usage
6.516475276
max memory
1.12922624E8
stage attributes
key
value
output-size
3069
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l3, true> <l1, l1, (arg1 > 0) /\ (arg2 > 0) /\ ((arg1 + arg2) < 100), par{arg1 -> arg2, arg2 -> arg1}> <l2, l1, true, par{arg1 -> 17, arg2 -> 13}> <l3, l2, true, par{arg1 -> undef5, arg2 -> undef6}> Fresh variables: undef5, undef6, Undef variables: undef5, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (arg1 = 17) /\ (arg2 = 13)> <l1, l1, (arg1 > 0) /\ (arg2 > 0) /\ ((arg1 + arg2) < 100), par{arg1 -> arg2, arg2 -> arg1}> Fresh variables: undef5, undef6, Undef variables: undef5, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 99, {arg1 -> arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 <l0, l1, arg1 = 17 /\ arg2 = 13, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.133018 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000867s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002289s [50331 : 50332] [50331 : 50333] Solving with 1 template(s).
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634