Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738808
details
property
value
status
complete
benchmark
NO_24.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n099.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
4.09132289886 seconds
cpu usage
5.578251263
max memory
9.5870976E7
stage attributes
key
value
output-size
3345
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, l2, true, par{arg1 -> 1, arg2 -> 2, arg3 -> 3}> <l2, l2, (arg3 < 5), par{arg1 -> (((arg1 - arg2) + arg2) - (arg1 - arg2)), arg2 -> ((arg1 - arg2) + arg2), arg3 -> ((((arg1 - arg2) + arg2) - (arg1 - arg2)) + ((arg1 - arg2) + arg2))}> <l3, l1, true, par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> Fresh variables: undef7, undef8, undef9, Undef variables: undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = 1) /\ (arg2 = 2) /\ (arg3 = 3)> <l2, l2, (arg3 < 5), par{arg1 -> (((arg1 - arg2) + arg2) - (arg1 - arg2)), arg2 -> ((arg1 - arg2) + arg2), arg3 -> ((((arg1 - arg2) + arg2) - (arg1 - arg2)) + ((arg1 - arg2) + arg2))}> Fresh variables: undef7, undef8, undef9, Undef variables: 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, arg3 <= 4, {arg1 -> arg2, arg2 -> arg1, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {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.007039 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000657s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001641s [31982 : 31983] [31982 : 31984] 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