Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381736959
details
property
value
status
complete
benchmark
polyrank4.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
10.5722558498 seconds
cpu usage
28.012707383
max memory
4.2545152E8
stage attributes
key
value
output-size
59493
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, l5, true> <l1, l2, ((0 + y^0) <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * z^0)), y^0 -> ((0 + y^0) + (~(2) * z^0)), z^0 -> (~(1) + z^0)}> <l2, l1, true> <l1, l3, ((0 + y^0) <= (0 + x^0)) /\ (undef7 = (1 + x^0)), par{x^0 -> undef7, y^0 -> ((0 + undef7) + y^0)}> <l3, l1, true> <l4, l1, true> <l5, l4, true> Fresh variables: undef7, Undef variables: undef7, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, true> <l1, l1, ((0 + y^0) <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * z^0)), y^0 -> ((0 + y^0) + (~(2) * z^0)), z^0 -> (~(1) + z^0)}> <l1, l1, ((0 + y^0) <= (0 + x^0)) /\ (undef7 = (1 + x^0)), par{x^0 -> undef7, y^0 -> ((0 + undef7) + y^0)}> Fresh variables: undef7, Undef variables: undef7, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}> <l1, l1, y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}> Variables: x^0, y^0, z^0 Precedence: Graph 0 Graph 1 <l0, l1, true, {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.00521 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001327s LOG: CALL solveLinear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634