fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814475400493
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DES-PT-60a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1478.939 353358.00 377223.00 993.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475400493.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DES-PT-60a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 110K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-60a-UpperBounds-00
FORMULA_NAME DES-PT-60a-UpperBounds-01
FORMULA_NAME DES-PT-60a-UpperBounds-02
FORMULA_NAME DES-PT-60a-UpperBounds-03
FORMULA_NAME DES-PT-60a-UpperBounds-04
FORMULA_NAME DES-PT-60a-UpperBounds-05
FORMULA_NAME DES-PT-60a-UpperBounds-06
FORMULA_NAME DES-PT-60a-UpperBounds-07
FORMULA_NAME DES-PT-60a-UpperBounds-08
FORMULA_NAME DES-PT-60a-UpperBounds-09
FORMULA_NAME DES-PT-60a-UpperBounds-10
FORMULA_NAME DES-PT-60a-UpperBounds-11
FORMULA_NAME DES-PT-60a-UpperBounds-12
FORMULA_NAME DES-PT-60a-UpperBounds-13
FORMULA_NAME DES-PT-60a-UpperBounds-14
FORMULA_NAME DES-PT-60a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678281036886

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 13:10:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 13:10:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 13:10:38] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-08 13:10:38] [INFO ] Transformed 354 places.
[2023-03-08 13:10:38] [INFO ] Transformed 311 transitions.
[2023-03-08 13:10:38] [INFO ] Found NUPN structural information;
[2023-03-08 13:10:38] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 297 rows 354 cols
[2023-03-08 13:10:38] [INFO ] Computed 59 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 223 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :3
FORMULA DES-PT-60a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
[2023-03-08 13:10:38] [INFO ] Invariant cache hit.
[2023-03-08 13:10:39] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2023-03-08 13:10:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 13:10:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:39] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-08 13:10:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:10:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 13:10:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 194 ms returned sat
[2023-03-08 13:10:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:41] [INFO ] [Nat]Absence check using state equation in 1715 ms returned sat
[2023-03-08 13:10:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 13:10:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1492 ms returned sat
[2023-03-08 13:10:43] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 25 ms.
[2023-03-08 13:10:44] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 3 ms to minimize.
[2023-03-08 13:10:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 13:10:44] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 13:10:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:44] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-08 13:10:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:10:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-08 13:10:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-08 13:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:46] [INFO ] [Nat]Absence check using state equation in 1404 ms returned sat
[2023-03-08 13:10:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2023-03-08 13:10:46] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-08 13:10:48] [INFO ] Added : 156 causal constraints over 32 iterations in 1920 ms. Result :sat
Minimization took 329 ms.
[2023-03-08 13:10:48] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:10:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:48] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2023-03-08 13:10:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:10:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:10:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 106 ms returned sat
[2023-03-08 13:10:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:50] [INFO ] [Nat]Absence check using state equation in 1023 ms returned sat
[2023-03-08 13:10:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-08 13:10:50] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 28 ms.
[2023-03-08 13:10:52] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2023-03-08 13:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-08 13:10:52] [INFO ] Added : 155 causal constraints over 31 iterations in 1974 ms. Result :sat
Minimization took 287 ms.
[2023-03-08 13:10:52] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:10:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2023-03-08 13:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:52] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-08 13:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:10:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:10:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 91 ms returned sat
[2023-03-08 13:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:54] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2023-03-08 13:10:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 74 ms returned sat
[2023-03-08 13:10:54] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 30 ms.
[2023-03-08 13:10:56] [INFO ] Added : 236 causal constraints over 48 iterations in 2097 ms. Result :sat
Minimization took 482 ms.
[2023-03-08 13:10:56] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:10:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 13:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:10:57] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-08 13:10:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:10:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-08 13:10:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 154 ms returned sat
[2023-03-08 13:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:01] [INFO ] [Nat]Absence check using state equation in 3640 ms returned sat
[2023-03-08 13:11:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 73 ms returned sat
[2023-03-08 13:11:01] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 24 ms.
[2023-03-08 13:11:02] [INFO ] Added : 135 causal constraints over 27 iterations in 1049 ms. Result :unknown
[2023-03-08 13:11:02] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 13:11:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:02] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-08 13:11:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:11:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 13:11:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:03] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2023-03-08 13:11:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2023-03-08 13:11:03] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 39 ms.
[2023-03-08 13:11:04] [INFO ] Added : 167 causal constraints over 34 iterations in 1569 ms. Result :sat
Minimization took 707 ms.
[2023-03-08 13:11:05] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 13:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:05] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-08 13:11:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 670 ms returned sat
[2023-03-08 13:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:09] [INFO ] [Nat]Absence check using state equation in 2422 ms returned sat
[2023-03-08 13:11:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 107 ms returned sat
[2023-03-08 13:11:09] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 13:11:10] [INFO ] Added : 113 causal constraints over 23 iterations in 1001 ms. Result :sat
Minimization took 307 ms.
[2023-03-08 13:11:10] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:11:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:11:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:10] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-08 13:11:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 216 ms returned sat
[2023-03-08 13:11:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:12] [INFO ] [Nat]Absence check using state equation in 1340 ms returned sat
[2023-03-08 13:11:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 200 ms returned sat
[2023-03-08 13:11:12] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2023-03-08 13:11:14] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-08 13:11:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-08 13:11:14] [INFO ] Added : 106 causal constraints over 22 iterations in 2383 ms. Result :sat
Minimization took 355 ms.
[2023-03-08 13:11:15] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:11:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:15] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2023-03-08 13:11:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:11:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 125 ms returned sat
[2023-03-08 13:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:19] [INFO ] [Nat]Absence check using state equation in 3635 ms returned sat
[2023-03-08 13:11:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 575 ms returned sat
[2023-03-08 13:11:20] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 20 ms.
[2023-03-08 13:11:20] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-08 13:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-08 13:11:20] [INFO ] Added : 83 causal constraints over 17 iterations in 544 ms. Result :sat
Minimization took 42 ms.
[2023-03-08 13:11:20] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:11:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:20] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-08 13:11:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:11:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 13:11:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:21] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2023-03-08 13:11:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-08 13:11:21] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-08 13:11:25] [INFO ] Added : 15 causal constraints over 3 iterations in 4095 ms. Result :unknown
[2023-03-08 13:11:25] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:11:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:26] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-03-08 13:11:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 13:11:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-08 13:11:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:29] [INFO ] [Nat]Absence check using state equation in 2739 ms returned sat
[2023-03-08 13:11:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 295 ms returned sat
[2023-03-08 13:11:29] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-08 13:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 13:11:29] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-08 13:11:30] [INFO ] Added : 113 causal constraints over 24 iterations in 1424 ms. Result :sat
Minimization took 335 ms.
[2023-03-08 13:11:31] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 13:11:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:31] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-08 13:11:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 13:11:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:32] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2023-03-08 13:11:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 121 ms returned sat
[2023-03-08 13:11:32] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-03-08 13:11:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 13:11:32] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-08 13:11:35] [INFO ] Added : 247 causal constraints over 50 iterations in 3036 ms. Result :sat
Minimization took 460 ms.
[2023-03-08 13:11:35] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 13:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:36] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-03-08 13:11:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 13:11:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 131 ms returned sat
[2023-03-08 13:11:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:36] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-08 13:11:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 43 ms returned sat
[2023-03-08 13:11:36] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-08 13:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-08 13:11:36] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-08 13:11:38] [INFO ] Added : 203 causal constraints over 41 iterations in 1590 ms. Result :sat
Minimization took 352 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 353 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 352 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 351 transition count 293
Applied a total of 12 rules in 108 ms. Remains 351 /354 variables (removed 3) and now considering 293/297 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 351/354 places, 293/297 transitions.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 13:11:42] [INFO ] Computed 60 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 13633 resets, run finished after 2117 ms. (steps per millisecond=472 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2262 resets, run finished after 932 ms. (steps per millisecond=1072 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2273 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2252 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2305 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2260 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2255 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2252 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2261 resets, run finished after 925 ms. (steps per millisecond=1081 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2277 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2273 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2315 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2306 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2270 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 13) seen :0
[2023-03-08 13:11:56] [INFO ] Invariant cache hit.
[2023-03-08 13:11:56] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 13:11:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 13:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:11:56] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-08 13:11:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:11:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:11:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 848 ms returned sat
[2023-03-08 13:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:04] [INFO ] [Nat]Absence check using state equation in 6153 ms returned unknown
[2023-03-08 13:12:04] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:04] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-08 13:12:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 204 ms returned sat
[2023-03-08 13:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:10] [INFO ] [Nat]Absence check using state equation in 6163 ms returned unknown
[2023-03-08 13:12:10] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:10] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2023-03-08 13:12:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 122 ms returned sat
[2023-03-08 13:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:11] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-08 13:12:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:12:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 13:12:11] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-08 13:12:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-08 13:12:11] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 13:12:12] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-08 13:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-08 13:12:12] [INFO ] Added : 146 causal constraints over 30 iterations in 880 ms. Result :sat
Minimization took 126 ms.
[2023-03-08 13:12:12] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:12] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 13:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:12] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-08 13:12:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 13:12:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 347 ms returned sat
[2023-03-08 13:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:13] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2023-03-08 13:12:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2023-03-08 13:12:13] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:12:19] [INFO ] Added : 239 causal constraints over 48 iterations in 5113 ms. Result :sat
Minimization took 83 ms.
[2023-03-08 13:12:19] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 13:12:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 13:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:19] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-03-08 13:12:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 191 ms returned sat
[2023-03-08 13:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:21] [INFO ] [Nat]Absence check using state equation in 1817 ms returned sat
[2023-03-08 13:12:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2023-03-08 13:12:21] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:12:22] [INFO ] Added : 139 causal constraints over 28 iterations in 719 ms. Result :sat
Minimization took 86 ms.
[2023-03-08 13:12:22] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:12:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:22] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-08 13:12:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 224 ms returned sat
[2023-03-08 13:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:23] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-08 13:12:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:12:23] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 13:12:24] [INFO ] Added : 208 causal constraints over 42 iterations in 1066 ms. Result :sat
Minimization took 70 ms.
[2023-03-08 13:12:24] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:24] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-08 13:12:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-08 13:12:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 9371 ms returned unknown
[2023-03-08 13:12:34] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:34] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:34] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-08 13:12:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:12:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 242 ms returned sat
[2023-03-08 13:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:34] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2023-03-08 13:12:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 32 ms returned sat
[2023-03-08 13:12:34] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 13:12:35] [INFO ] Added : 116 causal constraints over 24 iterations in 614 ms. Result :sat
Minimization took 157 ms.
[2023-03-08 13:12:35] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:35] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-08 13:12:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 264 ms returned sat
[2023-03-08 13:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:36] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-08 13:12:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2023-03-08 13:12:36] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2023-03-08 13:12:36] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-03-08 13:12:36] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2023-03-08 13:12:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2023-03-08 13:12:36] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 13:12:37] [INFO ] Added : 208 causal constraints over 43 iterations in 1053 ms. Result :sat
Minimization took 158 ms.
[2023-03-08 13:12:38] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:38] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-08 13:12:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:12:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 226 ms returned sat
[2023-03-08 13:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:39] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2023-03-08 13:12:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:12:39] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 13:12:40] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2023-03-08 13:12:40] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-08 13:12:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-08 13:12:40] [INFO ] Added : 171 causal constraints over 35 iterations in 1068 ms. Result :sat
Minimization took 64 ms.
[2023-03-08 13:12:40] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:40] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-08 13:12:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 193 ms returned sat
[2023-03-08 13:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:41] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-08 13:12:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 13:12:41] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-08 13:12:41] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2023-03-08 13:12:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2023-03-08 13:12:41] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 13:12:41] [INFO ] Added : 142 causal constraints over 29 iterations in 645 ms. Result :sat
Minimization took 128 ms.
[2023-03-08 13:12:42] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:12:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:42] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2023-03-08 13:12:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 238 ms returned sat
[2023-03-08 13:12:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:42] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2023-03-08 13:12:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:12:43] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:12:43] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-08 13:12:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 13:12:44] [INFO ] Added : 179 causal constraints over 36 iterations in 1010 ms. Result :sat
Minimization took 64 ms.
[2023-03-08 13:12:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:44] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2023-03-08 13:12:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 267 ms returned sat
[2023-03-08 13:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:45] [INFO ] [Nat]Absence check using state equation in 884 ms returned sat
[2023-03-08 13:12:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-08 13:12:45] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2023-03-08 13:12:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-08 13:12:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2023-03-08 13:12:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2023-03-08 13:12:45] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:12:47] [INFO ] Added : 232 causal constraints over 47 iterations in 1221 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 19 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:12:50] [INFO ] Invariant cache hit.
[2023-03-08 13:12:50] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-08 13:12:50] [INFO ] Invariant cache hit.
[2023-03-08 13:12:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:12:51] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-08 13:12:51] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 13:12:51] [INFO ] Invariant cache hit.
[2023-03-08 13:12:51] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 912 ms. Remains : 351/351 places, 293/293 transitions.
Starting property specific reduction for DES-PT-60a-UpperBounds-00
[2023-03-08 13:12:51] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:12:51] [INFO ] Invariant cache hit.
[2023-03-08 13:12:51] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:51] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-08 13:12:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:52] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 843 ms returned sat
[2023-03-08 13:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:56] [INFO ] [Nat]Absence check using state equation in 4111 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 20 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:12:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13654 resets, run finished after 1908 ms. (steps per millisecond=524 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2288 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :0
[2023-03-08 13:12:59] [INFO ] Invariant cache hit.
[2023-03-08 13:12:59] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:12:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 13:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:12:59] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-08 13:12:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:12:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 13:13:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 856 ms returned sat
[2023-03-08 13:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:06] [INFO ] [Nat]Absence check using state equation in 6122 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 27 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:13:06] [INFO ] Invariant cache hit.
[2023-03-08 13:13:06] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-08 13:13:06] [INFO ] Invariant cache hit.
[2023-03-08 13:13:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:07] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-08 13:13:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 13:13:07] [INFO ] Invariant cache hit.
[2023-03-08 13:13:07] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 821 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-00 in 16200 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-02
[2023-03-08 13:13:07] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:13:07] [INFO ] Invariant cache hit.
[2023-03-08 13:13:07] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 13:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:07] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-08 13:13:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 203 ms returned sat
[2023-03-08 13:13:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:12] [INFO ] [Nat]Absence check using state equation in 4753 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:13:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13597 resets, run finished after 1899 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2263 resets, run finished after 875 ms. (steps per millisecond=1142 ) properties (out of 1) seen :0
[2023-03-08 13:13:15] [INFO ] Invariant cache hit.
[2023-03-08 13:13:15] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 13:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:15] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-08 13:13:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 199 ms returned sat
[2023-03-08 13:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:22] [INFO ] [Nat]Absence check using state equation in 6166 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:13:22] [INFO ] Invariant cache hit.
[2023-03-08 13:13:22] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 13:13:22] [INFO ] Invariant cache hit.
[2023-03-08 13:13:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:22] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2023-03-08 13:13:22] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 13:13:22] [INFO ] Invariant cache hit.
[2023-03-08 13:13:23] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 836 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-02 in 15563 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-03
[2023-03-08 13:13:23] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:13:23] [INFO ] Invariant cache hit.
[2023-03-08 13:13:23] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 13:13:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 13:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:23] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2023-03-08 13:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 123 ms returned sat
[2023-03-08 13:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:23] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2023-03-08 13:13:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:13:24] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-08 13:13:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 13:13:24] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:13:24] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2023-03-08 13:13:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-08 13:13:24] [INFO ] Added : 146 causal constraints over 30 iterations in 905 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:13:25] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13681 resets, run finished after 1915 ms. (steps per millisecond=522 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2268 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 1) seen :0
[2023-03-08 13:13:28] [INFO ] Invariant cache hit.
[2023-03-08 13:13:28] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 13:13:28] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:28] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2023-03-08 13:13:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 13:13:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 122 ms returned sat
[2023-03-08 13:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:29] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-08 13:13:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 13:13:29] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-08 13:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 13:13:29] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 13:13:30] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-08 13:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-08 13:13:30] [INFO ] Added : 146 causal constraints over 30 iterations in 868 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:13:30] [INFO ] Invariant cache hit.
[2023-03-08 13:13:30] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 13:13:30] [INFO ] Invariant cache hit.
[2023-03-08 13:13:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:31] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2023-03-08 13:13:31] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 13:13:31] [INFO ] Invariant cache hit.
[2023-03-08 13:13:31] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 855 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-03 in 8233 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-05
[2023-03-08 13:13:31] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:13:31] [INFO ] Invariant cache hit.
[2023-03-08 13:13:31] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:31] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-08 13:13:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:13:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 346 ms returned sat
[2023-03-08 13:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:32] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2023-03-08 13:13:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2023-03-08 13:13:32] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 13:13:36] [INFO ] Added : 239 causal constraints over 48 iterations in 3943 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:13:37] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13701 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2289 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :0
[2023-03-08 13:13:39] [INFO ] Invariant cache hit.
[2023-03-08 13:13:39] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:40] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-08 13:13:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 13:13:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 346 ms returned sat
[2023-03-08 13:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:41] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2023-03-08 13:13:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2023-03-08 13:13:41] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 13:13:45] [INFO ] Added : 239 causal constraints over 48 iterations in 4778 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:13:46] [INFO ] Invariant cache hit.
[2023-03-08 13:13:46] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 13:13:46] [INFO ] Invariant cache hit.
[2023-03-08 13:13:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:47] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2023-03-08 13:13:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:13:47] [INFO ] Invariant cache hit.
[2023-03-08 13:13:47] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 836 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-05 in 16020 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-06
[2023-03-08 13:13:47] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:13:47] [INFO ] Invariant cache hit.
[2023-03-08 13:13:47] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 13:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:47] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-08 13:13:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 197 ms returned sat
[2023-03-08 13:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:49] [INFO ] [Nat]Absence check using state equation in 1802 ms returned sat
[2023-03-08 13:13:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2023-03-08 13:13:49] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:13:50] [INFO ] Added : 139 causal constraints over 28 iterations in 717 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:13:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13620 resets, run finished after 1934 ms. (steps per millisecond=517 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2319 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 1) seen :0
[2023-03-08 13:13:53] [INFO ] Invariant cache hit.
[2023-03-08 13:13:53] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:53] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-03-08 13:13:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 197 ms returned sat
[2023-03-08 13:13:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:55] [INFO ] [Nat]Absence check using state equation in 1827 ms returned sat
[2023-03-08 13:13:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2023-03-08 13:13:56] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 13:13:56] [INFO ] Added : 139 causal constraints over 28 iterations in 718 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:13:57] [INFO ] Invariant cache hit.
[2023-03-08 13:13:57] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 13:13:57] [INFO ] Invariant cache hit.
[2023-03-08 13:13:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:57] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2023-03-08 13:13:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:13:57] [INFO ] Invariant cache hit.
[2023-03-08 13:13:57] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 795 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-06 in 10561 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-07
[2023-03-08 13:13:57] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:13:57] [INFO ] Invariant cache hit.
[2023-03-08 13:13:57] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 13:13:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 13:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:58] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-08 13:13:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:13:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:13:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 222 ms returned sat
[2023-03-08 13:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:13:58] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2023-03-08 13:13:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:13:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2023-03-08 13:13:58] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:13:59] [INFO ] Added : 208 causal constraints over 42 iterations in 1004 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:14:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13673 resets, run finished after 1885 ms. (steps per millisecond=530 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2267 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 1) seen :0
[2023-03-08 13:14:03] [INFO ] Invariant cache hit.
[2023-03-08 13:14:03] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:03] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-08 13:14:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 226 ms returned sat
[2023-03-08 13:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:04] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2023-03-08 13:14:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:14:04] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:14:05] [INFO ] Added : 208 causal constraints over 42 iterations in 1031 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:14:05] [INFO ] Invariant cache hit.
[2023-03-08 13:14:05] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 13:14:05] [INFO ] Invariant cache hit.
[2023-03-08 13:14:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:06] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-08 13:14:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:14:06] [INFO ] Invariant cache hit.
[2023-03-08 13:14:06] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 845 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-07 in 8556 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-08
[2023-03-08 13:14:06] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:14:06] [INFO ] Invariant cache hit.
[2023-03-08 13:14:06] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:06] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:06] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-08 13:14:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-08 13:14:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 4959 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:14:11] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13582 resets, run finished after 1956 ms. (steps per millisecond=511 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2279 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 1) seen :0
[2023-03-08 13:14:14] [INFO ] Invariant cache hit.
[2023-03-08 13:14:14] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:14:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 13:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:14] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-08 13:14:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-08 13:14:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 9369 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:14:24] [INFO ] Invariant cache hit.
[2023-03-08 13:14:24] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 13:14:24] [INFO ] Invariant cache hit.
[2023-03-08 13:14:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:25] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-08 13:14:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:14:25] [INFO ] Invariant cache hit.
[2023-03-08 13:14:25] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 803 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-08 in 18758 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-09
[2023-03-08 13:14:25] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:14:25] [INFO ] Invariant cache hit.
[2023-03-08 13:14:25] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 13:14:25] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:25] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-08 13:14:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 243 ms returned sat
[2023-03-08 13:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:25] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-08 13:14:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 31 ms returned sat
[2023-03-08 13:14:25] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 13:14:26] [INFO ] Added : 116 causal constraints over 24 iterations in 585 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:14:26] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13680 resets, run finished after 1897 ms. (steps per millisecond=527 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2323 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 1) seen :0
[2023-03-08 13:14:29] [INFO ] Invariant cache hit.
[2023-03-08 13:14:29] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 13:14:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 13:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:29] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-08 13:14:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 243 ms returned sat
[2023-03-08 13:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:30] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-03-08 13:14:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 31 ms returned sat
[2023-03-08 13:14:30] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:14:31] [INFO ] Added : 116 causal constraints over 24 iterations in 584 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:14:31] [INFO ] Invariant cache hit.
[2023-03-08 13:14:31] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 13:14:31] [INFO ] Invariant cache hit.
[2023-03-08 13:14:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:32] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-08 13:14:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:14:32] [INFO ] Invariant cache hit.
[2023-03-08 13:14:32] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 819 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-09 in 6988 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-10
[2023-03-08 13:14:32] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:14:32] [INFO ] Invariant cache hit.
[2023-03-08 13:14:32] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:32] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-08 13:14:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:14:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 263 ms returned sat
[2023-03-08 13:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:33] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-08 13:14:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2023-03-08 13:14:33] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-08 13:14:33] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2023-03-08 13:14:33] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-08 13:14:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2023-03-08 13:14:33] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:14:34] [INFO ] Added : 208 causal constraints over 43 iterations in 1018 ms. Result :sat
Minimization took 155 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:14:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13627 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2276 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 1) seen :0
[2023-03-08 13:14:37] [INFO ] Invariant cache hit.
[2023-03-08 13:14:37] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:37] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:37] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-08 13:14:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 263 ms returned sat
[2023-03-08 13:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:38] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2023-03-08 13:14:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2023-03-08 13:14:38] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2023-03-08 13:14:38] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2023-03-08 13:14:38] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-08 13:14:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2023-03-08 13:14:38] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:14:39] [INFO ] Added : 208 causal constraints over 43 iterations in 1018 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:14:40] [INFO ] Invariant cache hit.
[2023-03-08 13:14:40] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-08 13:14:40] [INFO ] Invariant cache hit.
[2023-03-08 13:14:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:41] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-08 13:14:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:14:41] [INFO ] Invariant cache hit.
[2023-03-08 13:14:41] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 797 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-10 in 9065 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-11
[2023-03-08 13:14:41] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:14:41] [INFO ] Invariant cache hit.
[2023-03-08 13:14:41] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:14:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:41] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-08 13:14:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:14:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 226 ms returned sat
[2023-03-08 13:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:42] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-08 13:14:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:14:42] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:14:43] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-08 13:14:43] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-08 13:14:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-08 13:14:43] [INFO ] Added : 171 causal constraints over 35 iterations in 1037 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:14:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13552 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2293 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
[2023-03-08 13:14:46] [INFO ] Invariant cache hit.
[2023-03-08 13:14:46] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 13:14:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 13:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:46] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-08 13:14:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 232 ms returned sat
[2023-03-08 13:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:47] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-08 13:14:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 23 ms returned sat
[2023-03-08 13:14:47] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:14:48] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-08 13:14:48] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-08 13:14:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-08 13:14:48] [INFO ] Added : 171 causal constraints over 35 iterations in 1037 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:14:48] [INFO ] Invariant cache hit.
[2023-03-08 13:14:48] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 13:14:48] [INFO ] Invariant cache hit.
[2023-03-08 13:14:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:49] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2023-03-08 13:14:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:14:49] [INFO ] Invariant cache hit.
[2023-03-08 13:14:49] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 784 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-11 in 8146 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-12
[2023-03-08 13:14:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:14:49] [INFO ] Invariant cache hit.
[2023-03-08 13:14:49] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:49] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-08 13:14:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 13:14:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 194 ms returned sat
[2023-03-08 13:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:50] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-08 13:14:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 13:14:50] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-08 13:14:50] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2023-03-08 13:14:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-08 13:14:50] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 13:14:51] [INFO ] Added : 142 causal constraints over 29 iterations in 631 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:14:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13589 resets, run finished after 1908 ms. (steps per millisecond=524 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2257 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 1) seen :0
[2023-03-08 13:14:54] [INFO ] Invariant cache hit.
[2023-03-08 13:14:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:54] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2023-03-08 13:14:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 191 ms returned sat
[2023-03-08 13:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:55] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2023-03-08 13:14:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 13:14:55] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-08 13:14:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-08 13:14:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-03-08 13:14:55] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 13:14:55] [INFO ] Added : 142 causal constraints over 29 iterations in 618 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:14:56] [INFO ] Invariant cache hit.
[2023-03-08 13:14:56] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-08 13:14:56] [INFO ] Invariant cache hit.
[2023-03-08 13:14:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:56] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2023-03-08 13:14:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:14:56] [INFO ] Invariant cache hit.
[2023-03-08 13:14:57] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 807 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-12 in 7598 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-13
[2023-03-08 13:14:57] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:14:57] [INFO ] Invariant cache hit.
[2023-03-08 13:14:57] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:14:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:57] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-08 13:14:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:14:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 13:14:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 226 ms returned sat
[2023-03-08 13:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:14:58] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2023-03-08 13:14:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:14:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2023-03-08 13:14:58] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:14:58] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2023-03-08 13:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-08 13:14:59] [INFO ] Added : 179 causal constraints over 36 iterations in 992 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:14:59] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13665 resets, run finished after 1914 ms. (steps per millisecond=522 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2289 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
[2023-03-08 13:15:02] [INFO ] Invariant cache hit.
[2023-03-08 13:15:02] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:15:02] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 13:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:15:02] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-08 13:15:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:15:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 13:15:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 224 ms returned sat
[2023-03-08 13:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:15:03] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2023-03-08 13:15:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:15:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:15:03] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 13:15:04] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2023-03-08 13:15:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-08 13:15:04] [INFO ] Added : 179 causal constraints over 36 iterations in 1008 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:15:04] [INFO ] Invariant cache hit.
[2023-03-08 13:15:04] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 13:15:04] [INFO ] Invariant cache hit.
[2023-03-08 13:15:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:15:05] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-08 13:15:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:15:05] [INFO ] Invariant cache hit.
[2023-03-08 13:15:05] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 791 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-13 in 8169 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-14
[2023-03-08 13:15:05] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 13:15:05] [INFO ] Invariant cache hit.
[2023-03-08 13:15:05] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:15:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 13:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:15:05] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-03-08 13:15:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:15:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:15:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 265 ms returned sat
[2023-03-08 13:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:15:06] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2023-03-08 13:15:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:15:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-08 13:15:06] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2023-03-08 13:15:06] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-08 13:15:06] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-08 13:15:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2023-03-08 13:15:07] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 13:15:08] [INFO ] Added : 232 causal constraints over 47 iterations in 1226 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 13:15:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13656 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2251 resets, run finished after 890 ms. (steps per millisecond=1123 ) properties (out of 1) seen :0
[2023-03-08 13:15:11] [INFO ] Invariant cache hit.
[2023-03-08 13:15:11] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:15:11] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 13:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:15:11] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-08 13:15:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:15:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 13:15:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 275 ms returned sat
[2023-03-08 13:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:15:13] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2023-03-08 13:15:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:15:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-08 13:15:13] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2023-03-08 13:15:13] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-08 13:15:13] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-08 13:15:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2023-03-08 13:15:13] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 13:15:14] [INFO ] Added : 232 causal constraints over 47 iterations in 1256 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 13:15:15] [INFO ] Invariant cache hit.
[2023-03-08 13:15:15] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 13:15:15] [INFO ] Invariant cache hit.
[2023-03-08 13:15:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 13:15:16] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2023-03-08 13:15:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:15:16] [INFO ] Invariant cache hit.
[2023-03-08 13:15:16] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 821 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-14 in 10993 ms.
[2023-03-08 13:15:16] [INFO ] Flatten gal took : 68 ms
[2023-03-08 13:15:16] [INFO ] Applying decomposition
[2023-03-08 13:15:16] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15901031620163208021.txt' '-o' '/tmp/graph15901031620163208021.bin' '-w' '/tmp/graph15901031620163208021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15901031620163208021.bin' '-l' '-1' '-v' '-w' '/tmp/graph15901031620163208021.weights' '-q' '0' '-e' '0.001'
[2023-03-08 13:15:16] [INFO ] Decomposing Gal with order
[2023-03-08 13:15:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 13:15:16] [INFO ] Removed a total of 70 redundant transitions.
[2023-03-08 13:15:16] [INFO ] Flatten gal took : 62 ms
[2023-03-08 13:15:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 5 ms.
[2023-03-08 13:15:16] [INFO ] Time to serialize gal into /tmp/UpperBounds3471342949583353202.gal : 6 ms
[2023-03-08 13:15:16] [INFO ] Time to serialize properties into /tmp/UpperBounds6133689878360221531.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3471342949583353202.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6133689878360221531.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6133689878360221531.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.13707e+13,41.4932,686112,23993,9338,1.4502e+06,35869,315,1.8348e+06,544,305666,0
Total reachable state count : 41370672495980

Verifying 13 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-00 :0 <= u48.p77 <= 1
FORMULA DES-PT-60a-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-00,0,50.1058,687492,1,0,1.4502e+06,248388,499,3.14397e+06,714,616773,12237
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-02 :0 <= u48.p93 <= 1
FORMULA DES-PT-60a-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-02,0,56.3486,690416,1,0,1.4502e+06,436362,523,3.96149e+06,777,1.08716e+06,12455
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-03 :0 <= u2.p216 <= 1
FORMULA DES-PT-60a-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-03,0,58.4837,690416,1,0,1.4502e+06,463241,559,4.17897e+06,830,1.15592e+06,12998
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-05 :0 <= u2.p191 <= 1
FORMULA DES-PT-60a-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-05,0,58.4849,690416,1,0,1.4502e+06,463297,575,4.17898e+06,943,1.15624e+06,13024
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-06 :0 <= u2.p214 <= 1
FORMULA DES-PT-60a-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-06,0,58.4856,690416,1,0,1.4502e+06,463325,591,4.17898e+06,1000,1.1564e+06,13050
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-07 :0 <= u13.p127 <= 1
FORMULA DES-PT-60a-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-07,0,58.4873,690416,1,0,1.4502e+06,463379,607,4.17898e+06,1115,1.15652e+06,13074
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-08 :0 <= u2.p226 <= 1
FORMULA DES-PT-60a-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-08,0,58.4894,690416,1,0,1.4502e+06,463395,623,4.17899e+06,1148,1.15661e+06,13100
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-09 :0 <= u48.p101 <= 1
FORMULA DES-PT-60a-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-09,0,64.2232,772432,1,0,1.4502e+06,588365,647,4.89523e+06,1195,1.4717e+06,13318
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-10 :0 <= u48.p78 <= 1
FORMULA DES-PT-60a-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-10,0,69.052,913604,1,0,1.4502e+06,751993,671,5.48233e+06,1296,1.88043e+06,13536
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-11 :0 <= u13.p161 <= 1
FORMULA DES-PT-60a-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-11,0,69.0525,913604,1,0,1.4502e+06,751993,685,5.48233e+06,1296,1.88043e+06,13560
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-12 :0 <= u2.p220 <= 1
FORMULA DES-PT-60a-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-12,0,69.0531,913604,1,0,1.4502e+06,752015,701,5.48234e+06,1341,1.88056e+06,13586
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-13 :0 <= u13.p153 <= 1
FORMULA DES-PT-60a-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-13,0,69.0535,913604,1,0,1.4502e+06,752015,715,5.48234e+06,1341,1.88056e+06,13610
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60a-UpperBounds-14 :0 <= i4.u14.p14 <= 1
FORMULA DES-PT-60a-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60a-UpperBounds-14,0,72.4704,999932,1,0,1.4502e+06,855545,743,5.74084e+06,1341,2.2092e+06,22847
Total runtime 351029 ms.

BK_STOP 1678281390244

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-60a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475400493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;