About the Execution of ITS-Tools for ShieldRVs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.947 | 3600000.00 | 11470763.00 | 9895.60 | FFFFFFFFFFF?FFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025900852.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025900852
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K Apr 30 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 06:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 06:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 320K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653064131793
Running Version 202205111006
[2022-05-20 16:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 16:28:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 16:28:53] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2022-05-20 16:28:53] [INFO ] Transformed 703 places.
[2022-05-20 16:28:53] [INFO ] Transformed 953 transitions.
[2022-05-20 16:28:53] [INFO ] Found NUPN structural information;
[2022-05-20 16:28:53] [INFO ] Parsed PT model containing 703 places and 953 transitions in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-050A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 65 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:28:53] [INFO ] Computed 201 place invariants in 33 ms
[2022-05-20 16:28:54] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:28:54] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:28:54] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:28:54] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:28:55] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Support contains 75 out of 703 places after structural reductions.
[2022-05-20 16:28:55] [INFO ] Flatten gal took : 154 ms
[2022-05-20 16:28:55] [INFO ] Flatten gal took : 91 ms
[2022-05-20 16:28:55] [INFO ] Input system was already deterministic with 953 transitions.
Support contains 70 out of 703 places (down from 75) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 34) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:28:56] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 16:28:56] [INFO ] [Real]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:28:56] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 16:28:57] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:28:57] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 16:28:57] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 9 ms to minimize.
[2022-05-20 16:28:57] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:28:57] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:28:57] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2022-05-20 16:28:58] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-20 16:28:59] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2022-05-20 16:28:59] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2022-05-20 16:28:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-05-20 16:28:59] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2022-05-20 16:28:59] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1713 ms
[2022-05-20 16:28:59] [INFO ] After 2091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-20 16:28:59] [INFO ] After 2331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 103 place count 702 transition count 952
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 701 transition count 951
Applied a total of 104 rules in 223 ms. Remains 701 /703 variables (removed 2) and now considering 951/953 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 701/703 places, 951/953 transitions.
Finished random walk after 3909 steps, including 6 resets, run visited all 1 properties in 23 ms. (steps per millisecond=169 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1))||G(p2)))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 701 transition count 951
Applied a total of 2 rules in 54 ms. Remains 701 /703 variables (removed 2) and now considering 951/953 (removed 2) transitions.
// Phase 1: matrix 951 rows 701 cols
[2022-05-20 16:29:00] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:29:00] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 951 rows 701 cols
[2022-05-20 16:29:00] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:29:01] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2022-05-20 16:29:01] [INFO ] Redundant transitions in 294 ms returned [299]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:29:01] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:29:01] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 701/703 places, 950/953 transitions.
Applied a total of 0 rules in 31 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 701/703 places, 950/953 transitions.
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p1) (NOT p2)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 5}, { cond=(AND p1 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s424 1), p2:(EQ s364 0), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33262 reset in 792 ms.
Product exploration explored 100000 steps with 33362 reset in 739 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 42 factoid took 2095 ms. Reduced automaton from 8 states, 28 edges and 3 AP to 8 states, 28 edges and 3 AP.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p2)), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:29:06] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:29:07] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:29:07] [INFO ] After 709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 16:29:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-05-20 16:29:08] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 16:29:08] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:29:08] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:29:08] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2022-05-20 16:29:08] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:29:08] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:29:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 493 ms
[2022-05-20 16:29:08] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:29:09] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2022-05-20 16:29:09] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:29:09] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2022-05-20 16:29:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-20 16:29:09] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-20 16:29:09] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2022-05-20 16:29:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 690 ms
[2022-05-20 16:29:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2022-05-20 16:29:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-20 16:29:09] [INFO ] After 1932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 176 ms.
[2022-05-20 16:29:10] [INFO ] After 2351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 3 out of 701 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 701/701 places, 950/950 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 701 transition count 950
Applied a total of 101 rules in 42 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 701/701 places, 950/950 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:29:10] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:29:10] [INFO ] [Real]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:29:11] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:29:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:29:11] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:29:11] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2022-05-20 16:29:11] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 5 ms to minimize.
[2022-05-20 16:29:11] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 408 ms
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:29:12] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2022-05-20 16:29:13] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:29:13] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2022-05-20 16:29:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2022-05-20 16:29:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1027 ms
[2022-05-20 16:29:13] [INFO ] After 1967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-05-20 16:29:13] [INFO ] After 2283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 62 ms.
Support contains 3 out of 701 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 701/701 places, 950/950 transitions.
Applied a total of 0 rules in 19 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 701/701 places, 950/950 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 152516 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152516 steps, saw 95396 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:29:16] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:29:16] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-05-20 16:29:17] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:29:17] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:29:17] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 406 ms
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 5 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:29:18] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:29:19] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:29:19] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:29:19] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:29:19] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:29:19] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2022-05-20 16:29:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 980 ms
[2022-05-20 16:29:19] [INFO ] After 1899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-20 16:29:19] [INFO ] After 2193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 ms.
Support contains 3 out of 701 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 701/701 places, 950/950 transitions.
Applied a total of 0 rules in 30 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 701/701 places, 950/950 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 701/701 places, 950/950 transitions.
Applied a total of 0 rules in 19 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:29:19] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:29:20] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:29:20] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:29:21] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2022-05-20 16:29:21] [INFO ] Redundant transitions in 280 ms returned []
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:29:21] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 16:29:22] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 701/701 places, 950/950 transitions.
Applied a total of 0 rules in 19 ms. Remains 701 /701 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 950 rows 701 cols
[2022-05-20 16:29:22] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:29:22] [INFO ] [Real]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:29:22] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:29:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2022-05-20 16:29:23] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:29:23] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2022-05-20 16:29:23] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
[2022-05-20 16:29:23] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2022-05-20 16:29:23] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-05-20 16:29:23] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-20 16:29:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 400 ms
[2022-05-20 16:29:23] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:29:23] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-05-20 16:29:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 969 ms
[2022-05-20 16:29:24] [INFO ] After 1866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-20 16:29:24] [INFO ] After 2152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 16:29:24] [INFO ] Flatten gal took : 53 ms
[2022-05-20 16:29:25] [INFO ] Flatten gal took : 51 ms
[2022-05-20 16:29:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5505513106179933905.gal : 26 ms
[2022-05-20 16:29:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7461105054987661913.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4505190822649094621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5505513106179933905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7461105054987661913.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7461105054987661913.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :20 after 37
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :37 after 71
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :71 after 135
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :135 after 445
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :445 after 16674
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :16674 after 564407
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :564407 after 7.46573e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :7.46573e+06 after 6.8515e+08
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6.8515e+08 after 6.43491e+10
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :6.43491e+10 after 4.14493e+13
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :4.14493e+13 after 4.71683e+16
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :4.71683e+16 after 3.54068e+21
Detected timeout of ITS tools.
[2022-05-20 16:29:40] [INFO ] Flatten gal took : 46 ms
[2022-05-20 16:29:40] [INFO ] Applying decomposition
[2022-05-20 16:29:40] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6936802481410008492.txt' '-o' '/tmp/graph6936802481410008492.bin' '-w' '/tmp/graph6936802481410008492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6936802481410008492.bin' '-l' '-1' '-v' '-w' '/tmp/graph6936802481410008492.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:29:40] [INFO ] Decomposing Gal with order
[2022-05-20 16:29:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:29:40] [INFO ] Removed a total of 1095 redundant transitions.
[2022-05-20 16:29:40] [INFO ] Flatten gal took : 131 ms
[2022-05-20 16:29:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1016 labels/synchronizations in 36 ms.
[2022-05-20 16:29:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14760704402541476504.gal : 10 ms
[2022-05-20 16:29:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15647852488853946346.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4505190822649094621;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14760704402541476504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15647852488853946346.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality15647852488853946346.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 7.6313e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1974301053349645853
[2022-05-20 16:29:55] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1974301053349645853
Running compilation step : cd /tmp/ltsmin1974301053349645853;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1824 ms.
Running link step : cd /tmp/ltsmin1974301053349645853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1974301053349645853;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 p1 p2)), (F (AND p0 (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p1 p2)), (F (NOT (AND p0 p2))), (F (NOT (AND (NOT p1) p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F p1)]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1) (NOT p2)))
Knowledge based reduction with 42 factoid took 1018 ms. Reduced automaton from 8 states, 28 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldRVs-PT-050A-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-01 finished in 71863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 13 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:11] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:30:12] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:12] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:30:13] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:13] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:30:13] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s285 1) (EQ s287 1) (EQ s291 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-03 finished in 1759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 11 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:13] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:30:14] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:14] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:30:14] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:14] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:15] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s509 1) (EQ s511 1) (EQ s516 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 678 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-04 finished in 1626 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p1||F(p2))&&p0))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:15] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:30:15] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:15] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:30:16] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:16] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:30:16] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(AND (EQ s115 1) (EQ s130 1) (EQ s141 1)), p0:(AND (EQ s460 1) (EQ s462 1) (EQ s471 1)), p1:(EQ s490 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-05 finished in 1764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:17] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:17] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:17] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:18] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:18] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:30:18] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s236 1) (EQ s238 1) (EQ s247 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 682 steps with 0 reset in 9 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-06 finished in 1619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(F(p0)) U p0))&&p1)))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 26 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:18] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:30:19] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:19] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:19] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2022-05-20 16:30:20] [INFO ] Redundant transitions in 187 ms returned [303]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2022-05-20 16:30:20] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:30:20] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/703 places, 952/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 703/703 places, 952/953 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s692 1) (EQ s693 1) (EQ s698 1)), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 31041 steps with 149 reset in 171 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-07 finished in 2239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U p2)))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 37 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:30:20] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:30:21] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:30:21] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:30:22] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2022-05-20 16:30:22] [INFO ] Redundant transitions in 161 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:30:22] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:22] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s185 1) (EQ s200 1) (EQ s212 1)), p0:(EQ s178 1), p1:(NEQ s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1638 steps with 2 reset in 8 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-08 finished in 1905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 28 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:30:22] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:23] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:30:23] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:23] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2022-05-20 16:30:24] [INFO ] Redundant transitions in 142 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:30:24] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:30:24] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s577 1) (EQ s594 1) (EQ s604 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 664 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-09 finished in 1805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U !p1)&&F((G(p0)&&p2))))'
Support contains 9 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 26 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:30:24] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:24] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:30:24] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:25] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
[2022-05-20 16:30:25] [INFO ] Redundant transitions in 168 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:30:25] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:30:26] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p2) p1), (OR (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s416 1) (EQ s420 1) (EQ s429 1)), p0:(AND (EQ s339 1) (EQ s354 1) (EQ s365 1)), p1:(AND (EQ s213 1) (EQ s228 1) (EQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 676 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-10 finished in 2127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(X((X(p0)||p1))))||(X(p2) U p1)))))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:26] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:27] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:27] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:27] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:27] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:28] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=4 dest: 2}, { cond=(NOT p1), acceptance={1} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s141 1), p2:(EQ s690 1), p0:(OR (EQ s146 0) (EQ s147 0) (EQ s152 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20154 reset in 1357 ms.
Product exploration explored 100000 steps with 20049 reset in 1426 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 846 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:30:32] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:30:32] [INFO ] [Real]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:30:33] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:30:33] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2022-05-20 16:30:33] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:30:34] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2022-05-20 16:30:34] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:30:34] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:30:34] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:30:34] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:30:35] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:30:35] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:30:35] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:30:35] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:30:35] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:30:36] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:30:36] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:30:36] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:30:36] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:30:36] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:30:37] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:30:37] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:30:37] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:30:37] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2022-05-20 16:30:37] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:30:37] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:30:38] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:30:38] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:30:38] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:30:38] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:30:38] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:30:38] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:30:39] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:30:39] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:30:39] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:30:39] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:30:39] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:30:39] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:30:40] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:30:40] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:30:40] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:30:40] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:30:40] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2022-05-20 16:30:40] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:30:41] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:30:41] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:30:41] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:30:41] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:30:41] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:30:42] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:30:42] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:30:42] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:30:42] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:30:42] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:30:42] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:30:43] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:30:43] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:30:43] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:30:43] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:30:43] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:30:44] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:30:44] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:30:44] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:30:44] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:30:44] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:30:44] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:30:45] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:30:45] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:30:45] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:30:45] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:30:45] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:30:45] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:30:46] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:30:46] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:30:46] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:30:46] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:30:46] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:30:47] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:30:47] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:30:47] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:30:47] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:30:47] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:30:47] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:30:48] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:30:48] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:30:48] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2022-05-20 16:30:48] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:30:48] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:30:48] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:30:49] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:30:49] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:30:49] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:30:49] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:30:49] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:30:50] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:30:50] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:30:50] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:30:50] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:30:50] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:30:50] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:30:51] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:30:51] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:30:51] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:30:51] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:30:51] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:30:51] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:30:52] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:30:52] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:30:52] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:30:52] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:30:52] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:30:52] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:30:53] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:30:53] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:30:53] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:30:53] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:30:53] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:30:53] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:30:54] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:30:54] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:30:54] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2022-05-20 16:30:54] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:30:54] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:30:54] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:30:55] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:30:55] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:30:55] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:30:55] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:30:55] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:30:55] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:30:55] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:30:56] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:30:56] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:30:56] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:30:56] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:30:56] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:30:56] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:30:57] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:30:57] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:30:57] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:30:57] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:30:57] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:30:57] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:30:57] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:30:58] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:30:58] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:30:58] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:30:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:30:58] [INFO ] After 25135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 52 ms.
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 103 place count 702 transition count 952
Applied a total of 103 rules in 41 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 188620 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188620 steps, saw 59773 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:31:01] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 16:31:01] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-05-20 16:31:02] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:31:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:31:03] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:31:03] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:31:03] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:31:03] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 11 ms to minimize.
[2022-05-20 16:31:03] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:31:04] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:31:04] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:31:04] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2022-05-20 16:31:04] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:31:04] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:31:05] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:31:05] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:31:05] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:31:05] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:31:05] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:31:06] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:31:06] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:31:06] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:31:06] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:31:06] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:31:07] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:31:07] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:31:07] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:31:07] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:31:07] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:31:08] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:31:08] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:31:08] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:31:08] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:31:08] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:31:09] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:31:09] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:31:09] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:31:09] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2022-05-20 16:31:10] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:31:10] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:31:10] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:31:10] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:31:10] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2022-05-20 16:31:11] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:31:11] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:31:11] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:31:11] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:31:11] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:31:12] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:31:12] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:31:12] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:31:12] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:31:13] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:31:13] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2022-05-20 16:31:13] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2022-05-20 16:31:13] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:31:13] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:31:14] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2022-05-20 16:31:14] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2022-05-20 16:31:14] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:31:14] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:31:15] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:31:15] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:31:15] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:31:15] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 28 ms to minimize.
[2022-05-20 16:31:15] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:31:16] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:31:16] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:31:16] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:31:16] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:31:16] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:31:17] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:31:17] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:31:18] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:31:18] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2022-05-20 16:31:18] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:31:18] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2022-05-20 16:31:19] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:31:19] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:31:19] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:31:19] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:31:20] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:31:20] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:31:20] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:31:20] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:31:20] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:31:21] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:31:21] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:31:21] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:31:21] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:31:21] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:31:22] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:31:22] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:31:22] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:31:22] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:31:22] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:31:22] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:31:23] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:31:23] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:31:23] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 9 ms to minimize.
[2022-05-20 16:31:23] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:31:23] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:31:24] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:31:24] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:31:24] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:31:24] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:31:24] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:31:24] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:25] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:31:25] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:31:25] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:25] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:31:25] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:25] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:31:26] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:31:26] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:31:26] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:31:26] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:31:26] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:31:26] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:31:27] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:31:27] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:31:27] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:31:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:31:27] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 46 ms.
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:31:27] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:31:27] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:31:27] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:31:28] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2022-05-20 16:31:28] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:31:28] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:31:29] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:31:29] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:31:29] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-05-20 16:31:29] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:31:29] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:31:30] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:31:30] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:31:31] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:31:31] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:31:31] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:31:31] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:31:31] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:31:32] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:31:32] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:31:32] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:31:32] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:31:32] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:31:32] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:31:33] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:31:33] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:31:33] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:31:33] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:31:33] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:31:34] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:31:34] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:31:34] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:31:34] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:31:34] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:31:35] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:31:35] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:31:35] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:31:35] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:31:35] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:31:35] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:31:36] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:31:36] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:31:36] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:31:36] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:31:37] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:31:37] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:31:37] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:31:37] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:31:37] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:31:38] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:31:38] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:31:38] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:31:38] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:31:38] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:31:38] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:31:39] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:31:39] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:31:39] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:31:39] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2022-05-20 16:31:40] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:31:40] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:31:40] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:31:40] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:31:40] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:31:41] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:31:41] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:31:41] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:31:41] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:31:42] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:31:42] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:31:42] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:31:42] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:31:42] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:31:42] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:31:43] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:31:43] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:31:43] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:31:43] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:31:43] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:31:44] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:31:44] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2022-05-20 16:31:45] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
[2022-05-20 16:31:45] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2022-05-20 16:31:45] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:31:46] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:31:46] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:31:46] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:31:46] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:31:46] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:31:47] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:31:47] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:31:47] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:31:47] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:31:47] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:31:48] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:31:48] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:31:48] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:31:48] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:31:48] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:31:48] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:31:49] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:31:49] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:31:49] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:31:49] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:31:49] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:31:50] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:31:50] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:31:50] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:31:50] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:31:50] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:31:50] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:31:51] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:31:51] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:51] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:51] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:31:51] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:31:52] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:31:52] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:31:52] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:31:52] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:31:52] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:31:52] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:31:53] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:31:53] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:53] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:31:53] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:31:53] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:31:53] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:31:54] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:54] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:31:54] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:54] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:31:54] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:31:54] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:31:55] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:31:55] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:31:55] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:31:55] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:31:55] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:31:55] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:31:56] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:31:56] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:31:56] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:31:56] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:31:56] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:31:56] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:31:57] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:31:57] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:31:57] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:31:57] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:31:57] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:31:57] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:31:58] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:31:58] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:31:58] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:31:58] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:31:58] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:31:58] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:31:59] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:32:00] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:32:01] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:32:01] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:32:01] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:32:01] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:32:01] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:32:01] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:32:02] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:32:02] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:32:02] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:32:02] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:32:03] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:32:03] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:32:03] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:32:03] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:32:03] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:32:03] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:32:04] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:32:04] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:32:04] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2022-05-20 16:32:04] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:32:05] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:32:05] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:32:05] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 24 ms to minimize.
[2022-05-20 16:32:05] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:32:05] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 0 ms to minimize.
[2022-05-20 16:32:06] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:32:06] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:32:06] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:32:06] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:32:06] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:32:06] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:32:07] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:32:07] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:32:07] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:32:07] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:32:07] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:32:08] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:32:08] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:32:08] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:32:08] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:32:08] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:32:09] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:32:09] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:32:09] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:32:09] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:32:09] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:32:10] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:32:10] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:32:10] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:32:10] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:32:10] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:32:10] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:32:11] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:32:11] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:32:11] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:32:11] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:32:11] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:32:12] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:32:12] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:32:12] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:32:12] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2022-05-20 16:32:12] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:32:12] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:32:13] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:32:13] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:32:13] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2022-05-20 16:32:13] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:32:13] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:32:13] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:32:13] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:32:13] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:32:14] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:32:14] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:32:14] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:32:14] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:14] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:32:14] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:32:14] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:32:15] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:32:15] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2022-05-20 16:32:15] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:32:15] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:15] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2022-05-20 16:32:15] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:32:15] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:32:16] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:32:16] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:32:16] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2022-05-20 16:32:16] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:32:16] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:32:16] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:32:16] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:32:17] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2022-05-20 16:32:17] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:17] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:17] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:32:17] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:32:17] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:32:17] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:18] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2022-05-20 16:32:18] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:32:18] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:18] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2022-05-20 16:32:18] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:32:18] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2022-05-20 16:32:18] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:18] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:32:19] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2022-05-20 16:32:19] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2022-05-20 16:32:19] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:32:19] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:32:19] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:32:19] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:32:19] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 1 ms to minimize.
[2022-05-20 16:32:20] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2022-05-20 16:32:20] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:32:20] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:32:20] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:32:20] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:32:20] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:32:20] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 1 ms to minimize.
[2022-05-20 16:32:21] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2022-05-20 16:32:21] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2022-05-20 16:32:21] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:32:21] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:32:21] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:32:21] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:32:21] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:32:22] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:32:22] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:32:22] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:32:22] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:32:22] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:22] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:32:22] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:32:23] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:32:23] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:32:23] [INFO ] Trap strengthening procedure interrupted after too many repetitions 52485 ms
[2022-05-20 16:32:23] [INFO ] Trap strengthening (SAT) tested/added 285/284 trap constraints in 52485 ms
[2022-05-20 16:32:23] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:32:23] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:32:23] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:32:24] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:32:24] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:32:24] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:32:24] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:32:24] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:32:24] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:32:25] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:32:25] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:32:25] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:32:25] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:32:25] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:32:26] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:32:26] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:32:26] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:32:26] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:32:26] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:32:26] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:32:27] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:32:27] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:32:27] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:32:27] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:32:27] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:32:27] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:32:28] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:32:28] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:32:28] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:32:28] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:32:28] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:32:28] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:32:29] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:32:29] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:32:29] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:32:29] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:32:29] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:32:29] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:32:30] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:32:30] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:32:30] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:32:30] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:32:30] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:32:31] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:32:31] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:32:31] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:32:31] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:32:31] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:32:31] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:32:32] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:32:32] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:32:32] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:32:32] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:32:32] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:32:32] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:32:33] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:32:33] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:32:33] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:32:33] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:32:33] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:32:34] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:32:34] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:32:34] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:32:34] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:32:34] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:32:35] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:32:35] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:32:35] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:32:35] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:32:35] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:32:35] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:32:36] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:32:36] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:32:36] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:32:36] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:32:36] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:32:36] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:32:37] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:32:37] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:32:37] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:32:37] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:32:37] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:32:38] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:32:38] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:32:38] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:32:38] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:32:38] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:32:39] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:32:39] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:32:39] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:32:39] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:32:39] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:32:40] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:32:40] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:32:40] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:32:40] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:32:40] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:32:40] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:32:41] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:32:41] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:32:41] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:32:41] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:32:41] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:32:42] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:32:42] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2022-05-20 16:32:42] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:32:42] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:32:43] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2022-05-20 16:32:43] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:32:43] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:32:43] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:32:43] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 0 ms to minimize.
[2022-05-20 16:32:44] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:32:44] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:32:44] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:32:44] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:32:45] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2022-05-20 16:32:45] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:32:45] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:32:45] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:32:45] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:32:46] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:32:46] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:32:46] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:32:46] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:32:46] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:32:47] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:32:47] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:32:47] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:32:47] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:32:48] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:32:48] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:32:48] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:32:49] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:32:49] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:32:49] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:32:49] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:32:49] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:32:50] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:32:50] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:32:50] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:32:50] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:32:50] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:32:51] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:32:51] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:32:51] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:32:51] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:32:51] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2022-05-20 16:32:52] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:32:52] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:32:52] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:32:52] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:32:52] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:32:53] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:32:53] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:32:53] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:32:53] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:32:53] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:32:54] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:32:54] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:32:54] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2022-05-20 16:32:54] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2022-05-20 16:32:55] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2022-05-20 16:32:55] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2022-05-20 16:32:55] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:32:55] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:32:55] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:32:56] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 0 ms to minimize.
[2022-05-20 16:32:56] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:32:56] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:32:56] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:32:56] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2022-05-20 16:32:57] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 0 ms to minimize.
[2022-05-20 16:32:57] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:32:57] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 0 ms to minimize.
[2022-05-20 16:32:57] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:32:58] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:32:58] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:32:58] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:32:58] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:32:58] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2022-05-20 16:32:59] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:32:59] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:32:59] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:32:59] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:32:59] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:33:00] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:33:00] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:33:00] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:33:00] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:33:00] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:33:00] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:33:00] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:33:01] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2022-05-20 16:33:01] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:33:01] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:33:01] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:33:01] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:33:01] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:33:01] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:33:01] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:33:02] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2022-05-20 16:33:02] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:33:02] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2022-05-20 16:33:02] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:33:02] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:33:02] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:33:02] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:33:03] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-05-20 16:33:03] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:33:03] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:33:03] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:33:03] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:33:03] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:33:04] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:33:04] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:33:04] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:33:04] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:33:04] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:33:04] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:33:05] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:33:05] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:33:05] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:33:05] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:33:05] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:33:05] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:33:06] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:33:06] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:33:06] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:33:06] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:33:06] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:33:06] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:33:07] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:33:07] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:33:07] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:33:07] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2022-05-20 16:33:07] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:33:07] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:33:08] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:33:08] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:33:08] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:33:08] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:33:08] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:33:08] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-20 16:33:08] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:33:09] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:33:09] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:33:09] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:33:09] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:33:09] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:33:09] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:33:10] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:33:10] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:33:10] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:33:10] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:33:10] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:33:10] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-05-20 16:33:10] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2022-05-20 16:33:11] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:33:11] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:33:11] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:33:11] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 4 ms to minimize.
[2022-05-20 16:33:11] [INFO ] Trap strengthening (SAT) tested/added 263/262 trap constraints in 48173 ms
[2022-05-20 16:33:11] [INFO ] After 101567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 235 ms.
[2022-05-20 16:33:11] [INFO ] After 101991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 16:33:12] [INFO ] Flatten gal took : 149 ms
[2022-05-20 16:33:12] [INFO ] Flatten gal took : 96 ms
[2022-05-20 16:33:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14521582738868491231.gal : 8 ms
[2022-05-20 16:33:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17063922782871837030.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1057487115148402224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14521582738868491231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17063922782871837030.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17063922782871837030.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 140
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :140 after 1696
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1696 after 33195
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :33195 after 308872
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :308872 after 3.70348e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.70348e+06 after 3.36166e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.36166e+08 after 4.8429e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.8429e+10 after 2.22404e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.22404e+13 after 2.18047e+16
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.18047e+16 after 8.63966e+20
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :8.63966e+20 after 1.15476e+29
Detected timeout of ITS tools.
[2022-05-20 16:33:27] [INFO ] Flatten gal took : 42 ms
[2022-05-20 16:33:27] [INFO ] Applying decomposition
[2022-05-20 16:33:27] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7269758469157786904.txt' '-o' '/tmp/graph7269758469157786904.bin' '-w' '/tmp/graph7269758469157786904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7269758469157786904.bin' '-l' '-1' '-v' '-w' '/tmp/graph7269758469157786904.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:33:27] [INFO ] Decomposing Gal with order
[2022-05-20 16:33:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:33:27] [INFO ] Removed a total of 1105 redundant transitions.
[2022-05-20 16:33:27] [INFO ] Flatten gal took : 162 ms
[2022-05-20 16:33:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1023 labels/synchronizations in 75 ms.
[2022-05-20 16:33:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality267851607950922179.gal : 37 ms
[2022-05-20 16:33:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1563174417615343147.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1057487115148402224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality267851607950922179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1563174417615343147.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityCardinality1563174417615343147.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 455
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :455 after 455
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :455 after 455
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :455 after 455
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :455 after 455
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :455 after 1.82402e+25
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7819365704129147233
[2022-05-20 16:33:42] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7819365704129147233
Running compilation step : cd /tmp/ltsmin7819365704129147233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1658 ms.
Running link step : cd /tmp/ltsmin7819365704129147233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7819365704129147233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 13 factoid took 710 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:33:59] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:33:59] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:33:59] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:34:00] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:34:00] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:34:00] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 541 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:34:01] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:34:01] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:34:02] [INFO ] After 559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:34:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:34:02] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:34:03] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:34:03] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:34:03] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:34:03] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:34:03] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:34:03] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:34:04] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:34:04] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:34:04] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:34:04] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:34:04] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:34:05] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:34:05] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:34:05] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:34:05] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:34:05] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:34:05] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:34:06] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:06] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:34:06] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:34:06] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:34:06] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:34:07] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:34:07] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:34:07] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:34:07] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:34:07] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:34:07] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:34:08] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:34:08] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:34:08] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:34:08] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:34:08] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:34:09] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:34:09] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:34:09] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:34:09] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:34:09] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:34:09] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:34:10] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:34:10] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:34:10] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:34:10] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:34:10] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:34:10] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:34:11] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:34:11] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:34:11] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:34:11] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:34:11] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:34:12] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:34:12] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:34:12] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:34:12] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:34:12] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:34:12] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:34:12] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:34:13] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:34:13] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:34:13] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:34:13] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:34:13] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:34:13] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2022-05-20 16:34:13] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:34:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:34:14] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:34:14] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:34:14] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:34:14] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:34:14] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:34:14] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:34:14] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:34:15] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:34:15] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:34:15] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:34:15] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:34:15] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:34:15] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:34:15] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:34:15] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:34:16] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:34:17] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:34:17] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2022-05-20 16:34:17] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:34:17] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:34:17] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:34:17] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:34:17] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:34:17] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:34:18] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:34:18] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:34:18] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:34:18] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:34:18] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:34:18] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:34:19] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:20] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:34:20] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2022-05-20 16:34:20] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 1 ms to minimize.
[2022-05-20 16:34:20] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:34:20] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:34:21] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:34:21] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:34:21] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:34:21] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:34:21] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:34:22] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:34:22] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:34:22] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:34:22] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:34:22] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:34:22] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:34:23] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:34:23] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:34:23] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:34:23] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:34:23] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:34:24] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:34:24] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:34:24] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:34:24] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:34:24] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:34:24] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:34:25] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:34:25] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:25] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:34:25] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:34:25] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:34:26] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:34:26] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:34:26] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:34:26] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:34:26] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:34:26] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:34:27] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:34:27] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:34:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:34:27] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 53 ms.
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 103 place count 702 transition count 952
Applied a total of 103 rules in 42 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 194377 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194377 steps, saw 60978 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:34:30] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:34:30] [INFO ] [Real]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:34:31] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:34:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:34:31] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:34:31] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:34:32] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:34:32] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:34:32] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:34:32] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2022-05-20 16:34:32] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:34:33] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:34:33] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:34:33] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:34:33] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:34:33] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:34:33] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:34:33] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:34:34] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:34:34] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:34:34] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:34:34] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2022-05-20 16:34:34] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2022-05-20 16:34:34] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:34:34] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2022-05-20 16:34:35] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2022-05-20 16:34:35] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:34:35] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:34:35] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:34:35] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:34:35] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:34:35] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:34:36] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:34:36] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:34:36] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:34:36] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:34:36] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:34:37] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2022-05-20 16:34:37] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:34:37] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:34:37] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:34:37] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:34:38] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2022-05-20 16:34:38] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:34:38] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:34:38] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:34:38] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:34:39] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:34:39] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:34:39] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:34:39] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:39] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:34:40] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:34:40] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:34:40] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:34:40] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:34:40] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:34:40] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:34:41] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:34:41] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:41] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:34:41] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:34:41] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:34:42] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:42] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:34:42] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:34:42] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:34:42] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:34:42] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:34:43] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:34:43] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 0 ms to minimize.
[2022-05-20 16:34:43] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:34:43] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:34:43] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:34:44] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:34:44] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:34:44] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:34:44] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:34:44] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:34:44] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:45] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:34:45] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:45] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:34:45] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:34:45] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:34:46] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:34:46] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:34:46] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:46] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:34:46] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:34:47] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:34:47] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:34:47] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:34:47] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2022-05-20 16:34:47] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:34:48] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:34:48] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:34:48] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
[2022-05-20 16:34:48] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:34:48] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2022-05-20 16:34:49] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:34:49] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:34:49] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:34:49] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:34:49] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:34:50] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2022-05-20 16:34:50] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:34:50] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:34:50] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2022-05-20 16:34:50] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:34:51] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:34:51] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:34:51] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:34:51] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:34:51] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2022-05-20 16:34:52] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:34:52] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:34:52] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:34:52] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:34:53] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:34:53] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:34:53] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:34:53] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:34:53] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:34:54] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2022-05-20 16:34:54] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2022-05-20 16:34:54] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:34:54] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:34:55] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2022-05-20 16:34:55] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2022-05-20 16:34:55] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2022-05-20 16:34:55] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2022-05-20 16:34:55] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:34:56] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:34:56] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2022-05-20 16:34:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:34:56] [INFO ] After 25190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 54 ms.
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:34:56] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:34:56] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:34:56] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:34:57] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2022-05-20 16:34:57] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:34:57] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:34:58] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:34:58] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:34:58] [INFO ] [Real]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:34:58] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:34:59] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:34:59] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:34:59] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:34:59] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:35:00] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:35:00] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:35:00] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:35:00] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:35:00] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:35:01] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:35:01] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:35:01] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:35:01] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:35:01] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:35:01] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:35:01] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:35:02] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:35:02] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:35:02] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:35:02] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2022-05-20 16:35:02] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:35:02] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:35:02] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:35:03] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:35:03] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:35:03] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:35:03] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:35:03] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:35:03] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2022-05-20 16:35:03] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:35:04] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2022-05-20 16:35:04] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:35:04] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:35:04] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:35:05] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:35:05] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:35:05] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2022-05-20 16:35:05] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2022-05-20 16:35:05] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:35:06] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:35:06] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2022-05-20 16:35:06] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2022-05-20 16:35:06] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2022-05-20 16:35:06] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:35:07] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:35:07] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:35:07] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:35:07] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:35:07] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:35:08] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:35:08] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:35:08] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:35:08] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:35:08] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:35:08] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:35:09] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:35:09] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:35:09] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:35:09] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:35:09] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:35:09] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:35:10] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:35:10] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:35:10] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:35:10] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2022-05-20 16:35:10] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:35:11] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:35:11] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:35:11] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:35:11] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:35:11] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:35:12] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:35:12] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:35:12] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:35:12] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:35:12] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:35:12] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:35:13] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:35:13] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:35:13] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:35:13] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:35:13] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:35:13] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:35:14] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:35:14] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:35:14] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:35:14] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:35:14] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:35:15] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:35:15] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 0 ms to minimize.
[2022-05-20 16:35:15] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:35:15] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:35:16] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2022-05-20 16:35:16] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:35:16] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:35:16] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:35:16] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:35:17] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:35:17] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:35:17] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2022-05-20 16:35:17] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2022-05-20 16:35:17] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:35:18] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:35:18] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:35:18] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:35:18] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:35:18] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2022-05-20 16:35:19] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:35:19] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2022-05-20 16:35:19] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2022-05-20 16:35:19] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:35:20] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:35:20] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:35:20] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:35:20] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:35:20] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:35:21] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:35:21] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:35:21] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:35:21] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:35:21] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2022-05-20 16:35:22] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2022-05-20 16:35:22] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:35:22] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 0 ms to minimize.
[2022-05-20 16:35:22] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 0 ms to minimize.
[2022-05-20 16:35:23] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:35:23] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2022-05-20 16:35:23] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:35:23] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:35:23] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2022-05-20 16:35:24] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2022-05-20 16:35:24] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:35:24] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2022-05-20 16:35:24] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:35:25] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2022-05-20 16:35:25] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:35:25] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2022-05-20 16:35:25] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2022-05-20 16:35:25] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:35:26] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2022-05-20 16:35:26] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 0 ms to minimize.
[2022-05-20 16:35:26] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:35:26] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:35:26] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 ms to minimize.
[2022-05-20 16:35:27] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:35:27] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:35:27] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:35:27] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:35:28] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:35:28] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:35:28] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:35:28] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:35:28] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:35:28] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:35:29] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:35:29] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:35:29] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:35:29] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:35:29] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:35:29] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:35:30] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:35:30] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:35:30] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:35:30] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:35:30] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:35:31] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:35:31] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:35:31] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2022-05-20 16:35:32] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:35:32] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:35:32] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:35:32] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2022-05-20 16:35:32] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:35:33] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:35:33] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:35:33] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:35:33] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:35:33] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:35:34] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:35:34] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2022-05-20 16:35:34] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:35:34] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:35:34] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:35:35] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:35:35] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:35:35] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:35:35] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:35:35] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:35:36] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:35:36] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:35:36] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2022-05-20 16:35:36] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:35:36] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:35:37] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:35:37] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:35:37] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:35:37] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:35:37] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:35:38] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:35:38] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:35:38] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:35:38] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:35:38] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:35:39] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:35:39] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:35:39] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:35:39] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:35:39] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:35:40] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 0 ms to minimize.
[2022-05-20 16:35:40] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:35:40] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:35:40] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:35:41] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:35:41] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:35:41] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:35:41] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:35:41] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:35:42] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:35:42] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:35:42] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:35:42] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:35:42] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:35:43] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:35:43] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:35:43] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:35:43] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:35:43] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:35:44] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:35:44] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:35:44] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:35:44] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:35:44] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:35:45] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:35:45] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:35:45] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:35:45] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:35:45] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:35:46] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:35:46] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:35:46] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:35:46] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:35:46] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 1 ms to minimize.
[2022-05-20 16:35:47] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:35:47] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:35:47] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:35:47] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:35:47] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:35:48] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 0 ms to minimize.
[2022-05-20 16:35:48] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 0 ms to minimize.
[2022-05-20 16:35:48] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:35:48] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:35:48] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:35:49] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:35:49] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:35:49] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:35:49] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:35:49] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:35:50] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:35:50] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:35:50] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:35:50] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:35:50] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:35:51] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:35:51] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:35:51] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:35:51] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:35:51] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:35:52] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:35:52] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 0 ms to minimize.
[2022-05-20 16:35:52] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:35:52] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:35:52] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:35:53] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:35:53] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 1 ms to minimize.
[2022-05-20 16:35:53] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:35:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 54008 ms
[2022-05-20 16:35:53] [INFO ] Trap strengthening (SAT) tested/added 273/272 trap constraints in 54008 ms
[2022-05-20 16:35:53] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:35:54] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2022-05-20 16:35:54] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:35:54] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:35:54] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 0 ms to minimize.
[2022-05-20 16:35:54] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:35:55] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:35:55] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:35:56] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:35:56] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:35:56] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:35:56] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:35:56] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:35:57] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:35:57] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 0 ms to minimize.
[2022-05-20 16:35:57] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:35:57] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:35:58] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:35:58] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:35:58] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:35:58] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:35:58] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:35:58] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:35:59] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:35:59] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:35:59] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:35:59] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:35:59] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:35:59] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:36:00] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:36:00] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:36:00] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:36:00] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:36:00] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:36:00] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:36:01] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:36:01] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:36:01] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:36:01] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2022-05-20 16:36:01] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:36:01] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2022-05-20 16:36:01] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:36:02] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:36:02] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:02] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2022-05-20 16:36:02] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:36:02] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:36:02] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:36:02] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:03] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2022-05-20 16:36:03] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:03] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2022-05-20 16:36:03] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:36:03] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:36:03] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:36:03] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:36:04] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:36:04] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:36:04] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:36:04] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:36:04] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2022-05-20 16:36:04] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:36:04] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:36:05] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:36:05] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:36:05] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:36:05] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2022-05-20 16:36:05] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:36:05] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:36:05] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2022-05-20 16:36:05] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:36:06] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:36:06] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:36:06] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:36:06] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:36:06] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:36:06] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:36:06] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:36:06] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:36:07] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:36:07] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:36:07] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:36:07] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:36:07] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:36:07] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:36:07] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:36:08] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2022-05-20 16:36:08] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:36:08] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:36:08] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:36:08] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:36:08] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:36:08] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:36:09] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:36:09] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2022-05-20 16:36:09] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:36:09] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:36:10] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:36:10] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:36:10] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:36:10] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:36:10] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:36:10] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:36:11] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:36:11] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:36:11] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:36:11] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:36:11] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:36:12] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:36:12] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:36:12] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:36:12] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:36:12] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:36:13] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:36:13] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:36:13] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:36:13] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:36:13] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:36:13] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:36:14] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:36:14] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:36:14] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:36:14] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:36:14] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:36:15] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:36:15] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:36:15] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:36:15] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:36:15] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:36:15] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:36:16] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:36:16] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:36:16] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:36:16] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:36:16] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:36:16] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:36:17] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:36:17] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:36:17] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:36:17] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:36:17] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:36:18] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:36:18] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:36:18] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:36:18] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:36:18] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:36:18] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:36:19] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:36:19] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:36:19] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:36:19] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:36:19] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:36:20] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2022-05-20 16:36:20] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:36:20] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:36:20] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:36:20] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:36:21] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:36:21] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:36:21] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:36:21] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:36:21] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:36:21] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:36:22] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:36:22] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:36:22] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:36:22] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:36:22] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:36:23] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:36:23] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:36:23] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:36:23] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:36:24] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:36:24] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:36:24] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:36:24] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:36:24] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:36:25] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2022-05-20 16:36:25] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:36:25] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:36:25] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:36:25] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:36:26] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:36:26] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:36:26] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:36:26] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:36:26] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:36:26] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:36:27] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:36:27] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:36:27] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:36:27] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:36:27] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:36:28] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:36:28] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:36:28] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:36:28] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:36:28] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:36:28] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:36:29] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:36:29] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:36:29] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:36:29] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:36:29] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:36:30] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:36:30] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:36:30] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:36:30] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:36:30] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:36:30] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:36:31] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:36:31] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:36:31] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:36:31] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:36:31] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:36:32] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:36:32] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:36:32] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:36:32] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:36:32] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:36:32] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:36:33] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:36:33] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:36:33] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:36:33] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:36:33] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:36:33] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:36:34] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:36:34] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:36:34] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:36:34] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:36:34] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:36:34] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:36:35] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:36:35] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:36:35] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:36:35] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:36:35] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:36:36] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:36:36] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:36:36] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:36:36] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:36:36] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:36:36] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:36:37] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:36:37] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:36:37] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:36:37] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:36:37] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:36:38] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:36:38] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:36:38] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:36:38] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:36:38] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:36:38] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:36:39] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:36:39] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:36:39] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:36:39] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:36:39] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:36:39] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:36:40] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:36:40] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:36:40] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:36:40] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:36:40] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:36:41] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:36:41] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:36:41] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:36:41] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:36:41] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:36:41] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:36:42] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:36:42] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2022-05-20 16:36:42] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:36:42] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:36:42] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:36:43] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:36:43] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:36:43] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:36:43] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:36:43] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:36:43] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:36:43] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:36:44] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:36:44] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:36:44] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:36:44] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:36:44] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2022-05-20 16:36:44] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:36:45] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:36:45] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:36:45] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:36:45] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:36:45] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:36:45] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:36:45] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-05-20 16:36:46] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:36:46] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:36:46] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:36:46] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:36:46] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:36:46] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:36:46] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:36:46] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2022-05-20 16:36:47] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:36:47] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:36:47] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:36:47] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:47] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:36:47] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2022-05-20 16:36:48] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:36:48] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:36:48] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:36:48] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:36:48] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:36:48] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:48] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:36:49] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:36:49] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2022-05-20 16:36:49] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:36:49] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:36:49] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:36:49] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:36:49] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:36:49] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:50] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2022-05-20 16:36:50] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:36:50] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:36:50] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:36:50] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:36:50] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:36:50] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:36:51] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:36:51] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2022-05-20 16:36:51] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:51] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:36:51] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2022-05-20 16:36:51] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:36:51] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:36:52] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:36:52] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:36:52] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2022-05-20 16:36:52] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:36:52] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:36:52] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:36:52] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:36:53] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:53] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:36:53] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:36:53] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:36:53] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:36:53] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:36:53] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:36:54] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:36:54] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:36:54] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:36:54] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:36:54] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:36:54] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:36:54] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2022-05-20 16:36:55] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:36:55] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:36:55] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:36:55] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2022-05-20 16:36:55] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:36:55] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2022-05-20 16:36:55] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2022-05-20 16:36:56] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:36:56] [INFO ] Trap strengthening procedure interrupted after too many repetitions 62346 ms
[2022-05-20 16:36:56] [INFO ] Trap strengthening (SAT) tested/added 369/368 trap constraints in 62346 ms
[2022-05-20 16:36:56] [INFO ] After 117000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 716 ms.
[2022-05-20 16:36:56] [INFO ] After 117898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 16:36:56] [INFO ] Flatten gal took : 53 ms
[2022-05-20 16:36:56] [INFO ] Flatten gal took : 44 ms
[2022-05-20 16:36:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13051740610737783680.gal : 13 ms
[2022-05-20 16:36:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality41569247655158940.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15991113186260642377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13051740610737783680.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality41569247655158940.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality41569247655158940.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 140
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :140 after 1696
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1696 after 33195
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :33195 after 308872
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :308872 after 3.70348e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.70348e+06 after 3.36166e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.36166e+08 after 4.8429e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.8429e+10 after 2.22404e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.22404e+13 after 2.18047e+16
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.18047e+16 after 8.63966e+20
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :8.63966e+20 after 1.15476e+29
Detected timeout of ITS tools.
[2022-05-20 16:37:12] [INFO ] Flatten gal took : 47 ms
[2022-05-20 16:37:12] [INFO ] Applying decomposition
[2022-05-20 16:37:12] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1350930646054818998.txt' '-o' '/tmp/graph1350930646054818998.bin' '-w' '/tmp/graph1350930646054818998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1350930646054818998.bin' '-l' '-1' '-v' '-w' '/tmp/graph1350930646054818998.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:37:12] [INFO ] Decomposing Gal with order
[2022-05-20 16:37:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:37:12] [INFO ] Removed a total of 1099 redundant transitions.
[2022-05-20 16:37:12] [INFO ] Flatten gal took : 124 ms
[2022-05-20 16:37:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1096 labels/synchronizations in 41 ms.
[2022-05-20 16:37:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10901946702942127296.gal : 12 ms
[2022-05-20 16:37:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13185068046436044396.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15991113186260642377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10901946702942127296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13185068046436044396.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality13185068046436044396.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 7
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7 after 7
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7 after 1.41469e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9927643572168978109
[2022-05-20 16:37:27] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9927643572168978109
Running compilation step : cd /tmp/ltsmin9927643572168978109;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1664 ms.
Running link step : cd /tmp/ltsmin9927643572168978109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9927643572168978109;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 13 factoid took 900 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20014 reset in 1357 ms.
Product exploration explored 100000 steps with 19922 reset in 1419 ms.
Built C files in :
/tmp/ltsmin10849172410659457015
[2022-05-20 16:37:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10849172410659457015
Running compilation step : cd /tmp/ltsmin10849172410659457015;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1809 ms.
Running link step : cd /tmp/ltsmin10849172410659457015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10849172410659457015;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15951648233707634020.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:38:02] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:38:02] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:38:02] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:38:03] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:38:03] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:38:03] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Built C files in :
/tmp/ltsmin603323595713025159
[2022-05-20 16:38:03] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin603323595713025159
Running compilation step : cd /tmp/ltsmin603323595713025159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1700 ms.
Running link step : cd /tmp/ltsmin603323595713025159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin603323595713025159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15714002333063712932.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:38:19] [INFO ] Flatten gal took : 45 ms
[2022-05-20 16:38:19] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:38:19] [INFO ] Time to serialize gal into /tmp/LTL3259516391278016739.gal : 4 ms
[2022-05-20 16:38:19] [INFO ] Time to serialize properties into /tmp/LTL11678067680085018375.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3259516391278016739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11678067680085018375.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3259516...267
Read 1 LTL properties
Checking formula 0 : !((F(G((F(G(X((X("(((p146==0)||(p147==0))||(p152==0))"))||("(p141==1)")))))||((X("(p690==1)"))U("(p141==1)"))))))
Formula 0 simplified : !FG(FGX("(p141==1)" | X"(((p146==0)||(p147==0))||(p152==0))") | (X"(p690==1)" U "(p141==1)"))
Detected timeout of ITS tools.
[2022-05-20 16:38:34] [INFO ] Flatten gal took : 41 ms
[2022-05-20 16:38:34] [INFO ] Applying decomposition
[2022-05-20 16:38:34] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16735476754751599147.txt' '-o' '/tmp/graph16735476754751599147.bin' '-w' '/tmp/graph16735476754751599147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16735476754751599147.bin' '-l' '-1' '-v' '-w' '/tmp/graph16735476754751599147.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:38:34] [INFO ] Decomposing Gal with order
[2022-05-20 16:38:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:38:34] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:38:34] [INFO ] Flatten gal took : 59 ms
[2022-05-20 16:38:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 824 labels/synchronizations in 30 ms.
[2022-05-20 16:38:34] [INFO ] Time to serialize gal into /tmp/LTL807286989584970335.gal : 6 ms
[2022-05-20 16:38:34] [INFO ] Time to serialize properties into /tmp/LTL5460220376209027693.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL807286989584970335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5460220376209027693.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8072869...244
Read 1 LTL properties
Checking formula 0 : !((F(G((F(G(X((X("(((i4.u41.p146==0)||(i4.u42.p147==0))||(i4.u43.p152==0))"))||("(i3.u40.p141==1)")))))||((X("(i16.u197.p690==1)"))U("...178
Formula 0 simplified : !FG(FGX("(i3.u40.p141==1)" | X"(((i4.u41.p146==0)||(i4.u42.p147==0))||(i4.u43.p152==0))") | (X"(i16.u197.p690==1)" U "(i3.u40.p141==...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7046459501645695657
[2022-05-20 16:38:49] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7046459501645695657
Running compilation step : cd /tmp/ltsmin7046459501645695657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1710 ms.
Running link step : cd /tmp/ltsmin7046459501645695657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7046459501645695657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>([](X((X((LTLAPp0==true))||(LTLAPp1==true)))))||(X((LTLAPp2==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050A-LTLFireability-11 finished in 517890 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 21 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:04] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:39:04] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:04] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:39:05] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:05] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:39:06] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s454 1) (EQ s455 1) (EQ s460 1)), p1:(AND (EQ s594 1) (EQ s595 1) (EQ s599 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-12 finished in 1688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (X(p1)||(G(p3)&&p2))))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 11 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:06] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:39:06] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:06] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:39:07] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:07] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:39:07] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p2 p3 (NOT p0)), acceptance={1} source=0 dest: 3}, { cond=(AND p2 p3 p0), acceptance={1} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 3}, { cond=(AND p2 p3 p0 (NOT p1)), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p1))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND p2 p3 p0 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p3 p0 (NOT p1)), acceptance={1} source=3 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND p3 p0 (NOT p1)), acceptance={1} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={1} source=5 dest: 3}, { cond=(AND p3 p0), acceptance={1} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s612 1) (EQ s616 1) (EQ s625 1)), p0:(AND (EQ s494 1) (EQ s612 1) (EQ s616 1) (EQ s625 1)), p3:(EQ s201 1), p1:(EQ s697 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 633 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-13 finished in 1813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p2)||p1)&&p0))||(F(p3) U p3)))'
Support contains 12 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 35 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:39:08] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:39:08] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:39:08] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:39:09] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2022-05-20 16:39:09] [INFO ] Redundant transitions in 146 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2022-05-20 16:39:09] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 16:39:09] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s136 1) (EQ s142 1) (EQ s149 1)), p3:(AND (EQ s276 1) (EQ s280 1) (EQ s289 1)), p1:(OR (EQ s558 0) (EQ s562 0) (EQ s569 0)), p2:(OR (EQ s454 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 693 steps with 0 reset in 9 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-14 finished in 1863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X(X(p2)))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 14 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:10] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:39:10] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:10] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:39:11] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
// Phase 1: matrix 953 rows 703 cols
[2022-05-20 16:39:11] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:39:11] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s35 1) (EQ s40 1)), p1:(EQ s402 1), p2:(AND (EQ s640 1) (EQ s644 1) (EQ s653 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 613 steps with 1 reset in 4 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-15 finished in 1764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(X((X(p0)||p1))))||(X(p2) U p1)))))'
Found a SL insensitive property : ShieldRVs-PT-050A-LTLFireability-11
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 40 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:39:12] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:39:12] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:39:12] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:39:13] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:39:13] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:39:13] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 702/703 places, 952/953 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/703 places, 952/953 transitions.
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=4 dest: 2}, { cond=(NOT p1), acceptance={1} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s141 1), p2:(EQ s689 1), p0:(OR (EQ s146 0) (EQ s147 0) (EQ s152 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19967 reset in 1324 ms.
Product exploration explored 100000 steps with 20055 reset in 1394 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 539 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:39:17] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:39:17] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:39:17] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:39:18] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:39:18] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:39:18] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:39:18] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:39:19] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:39:19] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:39:19] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:39:19] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:39:19] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:39:20] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:39:20] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:39:20] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:39:20] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:39:20] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:39:21] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:39:21] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:39:21] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:39:21] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:39:21] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:39:21] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-05-20 16:39:21] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:39:22] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:39:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:39:22] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2022-05-20 16:39:22] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:39:22] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:39:22] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2022-05-20 16:39:23] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:39:23] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:39:23] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:39:23] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:39:23] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:39:23] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:39:24] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:39:24] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:39:24] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:39:24] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:39:24] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:39:24] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:39:25] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:39:25] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:39:25] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:39:25] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:39:25] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:39:25] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:39:25] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:39:26] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2022-05-20 16:39:26] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:39:26] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:39:26] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:39:26] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:39:26] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:39:26] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:39:27] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:39:27] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:39:27] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2022-05-20 16:39:27] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:39:27] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-20 16:39:27] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2022-05-20 16:39:27] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:39:28] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:39:28] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:39:28] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:39:28] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:39:28] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:39:29] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:39:29] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:39:29] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:39:29] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:39:29] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:39:29] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:39:30] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:39:30] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:39:30] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:39:30] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:39:30] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:39:30] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:39:31] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:39:31] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:39:31] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:39:31] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:39:31] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:39:31] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:39:31] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:39:32] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:39:32] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:39:32] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:39:32] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:39:32] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:39:32] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:39:33] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:39:33] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:39:33] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:39:33] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:39:33] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:39:33] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:39:34] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:39:34] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:39:34] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:39:34] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:39:34] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:39:34] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2022-05-20 16:39:34] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:39:35] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:39:35] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:39:35] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:39:35] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:39:35] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:39:35] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:39:36] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2022-05-20 16:39:36] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:39:36] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:39:36] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:39:36] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:39:36] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:39:36] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:39:37] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:39:37] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:39:37] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2022-05-20 16:39:37] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:39:37] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:39:37] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:39:37] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2022-05-20 16:39:38] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:39:38] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:39:38] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:39:38] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:39:38] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:39:38] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:39:39] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:39:39] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2022-05-20 16:39:39] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:39:39] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:39:39] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:39:39] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:39:39] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:39:40] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:39:40] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:39:40] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:39:40] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:39:40] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:39:40] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:39:40] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2022-05-20 16:39:41] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:39:41] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:39:41] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:39:41] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:39:41] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:39:41] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-05-20 16:39:41] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2022-05-20 16:39:42] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:39:42] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:39:42] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:39:42] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2022-05-20 16:39:42] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:39:42] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:39:42] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2022-05-20 16:39:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:39:42] [INFO ] After 25095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 74 ms.
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 952
Applied a total of 101 rules in 33 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 189441 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189441 steps, saw 59966 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:39:46] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:39:46] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:39:46] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:39:47] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:39:47] [INFO ] After 570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:39:48] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:39:48] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:39:48] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:39:48] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:39:48] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:39:48] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:39:49] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:39:49] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:39:49] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:39:49] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:39:49] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:39:50] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:39:50] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:39:50] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:39:50] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:39:50] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:39:51] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:39:51] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:39:51] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:39:51] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:39:51] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:39:51] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:39:52] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:39:52] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:39:52] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:39:52] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:39:52] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:39:53] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:39:53] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:39:53] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:39:53] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:39:54] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:39:54] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:39:54] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:39:54] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:39:54] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:39:55] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:39:55] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:39:55] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:39:55] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:39:55] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:39:55] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:39:56] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:39:56] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:39:56] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:39:56] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:39:57] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:39:57] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:39:57] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:39:57] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:39:57] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:39:58] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:39:58] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:39:58] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:39:58] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:39:59] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:39:59] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:39:59] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:39:59] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:39:59] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:39:59] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:40:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:40:00] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:40:00] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:40:00] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:40:00] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:40:00] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:40:01] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:40:02] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:40:02] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2022-05-20 16:40:02] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:40:02] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2022-05-20 16:40:03] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:40:03] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:40:03] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:40:03] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:40:03] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:40:04] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:40:04] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:40:04] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:40:04] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:40:04] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:40:05] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:40:05] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:40:05] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:40:05] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:40:05] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:40:06] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:40:06] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:40:06] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:40:06] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:40:06] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:40:06] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:40:07] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:40:07] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:40:07] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:40:07] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:40:07] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:40:08] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:40:08] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:40:08] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:40:08] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:40:08] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:40:08] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:40:09] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:40:09] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:40:09] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:40:09] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:40:09] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:40:09] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:40:10] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:40:10] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:40:10] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:40:10] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:40:10] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:40:11] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:40:11] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:40:11] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:40:11] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:40:11] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:40:11] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:40:12] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:40:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:40:12] [INFO ] After 25144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 51 ms.
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:40:12] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:40:12] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:40:12] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:40:13] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
[2022-05-20 16:40:13] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:40:13] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:40:13] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 17 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:40:13] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:40:14] [INFO ] [Real]Absence check using 201 positive place invariants in 37 ms returned sat
[2022-05-20 16:40:14] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:40:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:40:15] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:40:15] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:40:15] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:40:15] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:40:16] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:40:16] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:40:16] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:40:16] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:40:16] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:40:17] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:40:17] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:40:17] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:40:17] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:40:17] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:40:18] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:40:18] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:40:18] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:40:18] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:40:18] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:40:18] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:40:19] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:40:19] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:40:19] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:40:19] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:40:19] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:40:20] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:40:20] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:40:20] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:40:20] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:40:20] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:40:21] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:40:21] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:40:21] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:40:21] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:40:22] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:40:22] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:40:22] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:40:22] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:40:22] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:40:23] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:40:23] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:40:23] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:40:23] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:40:23] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:40:24] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:40:24] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:40:24] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:40:24] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:40:24] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:40:25] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:40:25] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:40:25] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:40:25] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:40:25] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:40:26] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:40:26] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:40:26] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2022-05-20 16:40:26] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 0 ms to minimize.
[2022-05-20 16:40:27] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:40:27] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:40:27] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:40:27] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:40:27] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:40:28] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:40:28] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:40:28] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:40:28] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:40:28] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:40:29] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2022-05-20 16:40:29] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2022-05-20 16:40:30] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2022-05-20 16:40:30] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2022-05-20 16:40:30] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2022-05-20 16:40:31] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:40:31] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:40:31] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2022-05-20 16:40:31] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:40:31] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:40:32] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2022-05-20 16:40:32] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:40:32] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:40:32] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:40:32] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:40:33] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2022-05-20 16:40:33] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 0 ms to minimize.
[2022-05-20 16:40:33] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:40:33] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:40:34] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2022-05-20 16:40:34] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:40:34] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:40:34] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2022-05-20 16:40:34] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:40:35] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:40:35] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:40:35] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:40:35] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:40:35] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2022-05-20 16:40:36] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:40:36] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:40:36] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:40:36] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:40:36] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:40:36] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:40:37] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:40:37] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:40:37] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:40:37] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:40:37] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:40:37] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:40:38] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:40:38] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:40:38] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:40:38] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:40:38] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:40:39] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:40:39] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:40:39] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:40:39] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:40:39] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:40:39] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:40:40] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:40:40] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:40:40] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:40:40] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:40:40] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:40:40] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:40:41] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:40:41] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:40:41] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:40:41] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:40:41] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:40:42] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:40:42] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:40:42] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:40:42] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:40:42] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:40:42] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:40:43] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:40:43] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:40:43] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:40:43] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:40:43] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:40:43] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:40:44] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:40:44] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:40:44] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:40:44] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:40:44] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:40:46] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:40:46] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:40:47] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:40:47] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:40:47] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:40:47] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:40:47] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:40:47] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:40:48] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:40:48] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:40:48] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:40:48] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:40:48] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:40:49] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:40:49] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:40:49] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:40:49] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:40:49] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:40:49] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:40:50] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:40:50] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:40:50] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:40:50] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:40:51] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:40:51] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:40:51] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:40:51] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:40:51] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:40:51] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:40:52] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:40:52] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:40:52] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:40:52] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:40:52] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:40:52] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:40:53] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:40:53] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:40:53] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:40:53] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:40:53] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:40:54] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:40:54] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:40:54] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:40:54] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:40:54] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:40:54] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:40:55] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:40:55] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:40:55] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:40:55] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:40:55] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:40:55] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:40:56] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:40:56] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:40:56] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:40:56] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:40:56] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:40:57] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:40:57] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:40:57] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:40:57] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2022-05-20 16:40:57] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2022-05-20 16:40:57] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2022-05-20 16:40:57] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:40:58] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:40:58] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-05-20 16:40:58] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:40:58] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:40:58] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:40:58] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:40:58] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:40:58] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:40:59] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:40:59] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:40:59] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:40:59] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:40:59] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:40:59] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:40:59] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:41:00] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:41:00] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:41:00] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:41:00] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:41:00] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:41:00] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:41:00] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:00] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:41:01] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:41:01] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:01] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:41:01] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:41:01] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:41:01] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:41:01] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:41:01] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:41:02] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:41:02] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:41:02] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2022-05-20 16:41:02] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:41:02] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:41:02] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:41:02] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:41:02] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:41:03] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:41:03] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:41:03] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:03] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:03] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:03] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:03] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:41:03] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:41:04] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:41:04] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:41:04] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:41:04] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:41:04] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:41:04] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:41:04] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:05] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:41:05] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:41:05] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:41:05] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:41:05] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:41:05] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:41:05] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:41:05] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:41:06] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:41:06] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:41:06] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:41:06] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:41:06] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:41:06] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:06] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:41:06] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:41:07] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:41:07] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:41:07] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:41:07] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:41:07] [INFO ] Trap strengthening procedure interrupted after too many repetitions 52098 ms
[2022-05-20 16:41:07] [INFO ] Trap strengthening (SAT) tested/added 285/284 trap constraints in 52098 ms
[2022-05-20 16:41:07] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:41:07] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:41:08] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:41:08] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:41:08] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:41:08] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:41:08] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:41:08] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:41:09] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:41:09] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:41:09] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:41:09] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:41:09] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:41:09] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:41:10] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:41:10] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:41:10] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:41:10] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:41:10] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:41:10] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:41:11] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:41:11] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:41:11] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2022-05-20 16:41:11] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:41:11] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:41:11] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:41:12] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:41:12] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:41:12] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:41:12] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:12] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:41:12] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:41:13] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:41:13] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:41:13] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:13] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:41:13] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:41:13] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:41:14] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:41:14] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:41:14] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:41:14] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:41:14] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:41:15] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:41:15] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:41:15] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:15] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:41:15] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:41:15] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:41:16] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:41:16] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:41:16] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:41:16] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:41:16] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:41:16] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:41:17] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:17] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:41:17] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:41:17] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:41:17] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:41:17] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:18] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:18] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:41:18] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:18] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:41:18] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:41:19] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:19] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:41:19] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:41:19] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:41:19] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:41:19] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:41:20] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:41:20] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:41:20] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:41:20] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:41:20] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:41:20] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:41:21] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:41:21] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:41:21] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:41:21] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:41:21] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:41:21] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:41:22] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:41:22] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:41:22] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:41:22] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:41:23] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:41:23] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:41:23] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:41:23] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:41:23] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:41:24] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:41:24] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:41:24] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:41:24] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:41:24] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:41:24] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:41:24] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:41:25] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:41:25] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:41:25] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2022-05-20 16:41:25] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:41:26] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:41:26] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:41:26] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:41:26] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:41:26] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:41:27] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:41:27] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:41:27] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:41:27] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:41:27] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:41:28] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:41:28] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:41:28] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:41:28] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:41:29] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:41:29] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:41:29] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:41:29] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:41:29] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:41:30] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:41:30] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:41:30] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2022-05-20 16:41:30] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:41:31] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:41:31] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:41:31] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:41:31] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:41:32] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:41:32] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:41:32] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:41:32] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:41:32] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:41:33] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:41:33] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:41:33] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:41:33] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:41:33] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:41:34] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:41:34] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:41:34] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:41:34] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:41:35] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:41:35] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:41:35] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:41:35] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:41:35] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:41:36] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:41:36] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:41:36] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:41:36] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:41:36] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:41:37] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:41:37] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:41:37] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:41:37] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:41:37] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:41:38] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:41:38] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:41:38] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:41:38] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:41:38] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:41:39] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:41:39] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:41:39] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:41:39] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:41:39] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:41:40] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:41:40] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:41:40] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:41:40] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:41:41] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:41:41] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:41:41] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:41:41] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:41:41] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:41:42] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:41:42] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:41:42] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:41:42] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:41:42] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:41:42] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:41:43] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:41:43] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:41:43] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:41:43] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:41:43] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2022-05-20 16:41:43] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-20 16:41:44] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-20 16:41:45] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:41:45] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:41:45] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2022-05-20 16:41:45] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:41:45] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2022-05-20 16:41:45] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 3 ms to minimize.
[2022-05-20 16:41:45] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:41:45] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:41:46] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2022-05-20 16:41:46] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2022-05-20 16:41:46] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2022-05-20 16:41:46] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:41:46] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:41:46] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:41:47] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2022-05-20 16:41:47] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:41:47] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:41:47] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:41:47] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:41:47] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:41:47] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:41:48] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2022-05-20 16:41:48] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2022-05-20 16:41:48] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2022-05-20 16:41:48] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:41:48] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:41:48] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:41:49] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2022-05-20 16:41:49] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2022-05-20 16:41:49] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:41:49] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:41:49] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2022-05-20 16:41:49] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2022-05-20 16:41:49] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2022-05-20 16:41:50] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2022-05-20 16:41:50] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2022-05-20 16:41:50] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:41:50] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:41:50] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:41:50] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:41:50] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:41:50] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2022-05-20 16:41:51] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2022-05-20 16:41:51] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:41:51] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:41:51] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:41:51] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2022-05-20 16:41:51] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:41:51] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:41:52] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:41:52] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:41:52] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:41:52] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:41:52] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:41:52] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:41:52] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:41:53] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2022-05-20 16:41:53] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2022-05-20 16:41:53] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:41:53] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:41:53] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-20 16:41:53] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-05-20 16:41:53] [INFO ] Trap strengthening (SAT) tested/added 263/262 trap constraints in 46082 ms
[2022-05-20 16:41:53] [INFO ] After 99131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 233 ms.
[2022-05-20 16:41:53] [INFO ] After 99545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 16:41:54] [INFO ] Flatten gal took : 50 ms
[2022-05-20 16:41:54] [INFO ] Flatten gal took : 42 ms
[2022-05-20 16:41:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5754442138013776691.gal : 4 ms
[2022-05-20 16:41:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality83574691430203989.prop : 6 ms
Invoking ITS tools like this :cd /tmp/redAtoms1890073698189205221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5754442138013776691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality83574691430203989.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...317
Loading property file /tmp/ReachabilityCardinality83574691430203989.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 140
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :140 after 1696
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1696 after 33195
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :33195 after 308872
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :308872 after 3.70348e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.70348e+06 after 3.36166e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.36166e+08 after 4.8429e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.8429e+10 after 2.22404e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.22404e+13 after 2.18047e+16
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.18047e+16 after 8.63966e+20
Detected timeout of ITS tools.
[2022-05-20 16:42:09] [INFO ] Flatten gal took : 40 ms
[2022-05-20 16:42:09] [INFO ] Applying decomposition
[2022-05-20 16:42:09] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1355444500284872734.txt' '-o' '/tmp/graph1355444500284872734.bin' '-w' '/tmp/graph1355444500284872734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1355444500284872734.bin' '-l' '-1' '-v' '-w' '/tmp/graph1355444500284872734.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:42:09] [INFO ] Decomposing Gal with order
[2022-05-20 16:42:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:42:09] [INFO ] Removed a total of 1091 redundant transitions.
[2022-05-20 16:42:09] [INFO ] Flatten gal took : 59 ms
[2022-05-20 16:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 918 labels/synchronizations in 21 ms.
[2022-05-20 16:42:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5542965363757378892.gal : 6 ms
[2022-05-20 16:42:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5680854769277393528.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1890073698189205221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5542965363757378892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5680854769277393528.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5680854769277393528.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9 after 16956
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin86126885309351144
[2022-05-20 16:42:24] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin86126885309351144
Running compilation step : cd /tmp/ltsmin86126885309351144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1641 ms.
Running link step : cd /tmp/ltsmin86126885309351144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin86126885309351144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 13 factoid took 684 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 12 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:42:40] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:42:40] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:42:40] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:42:41] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:42:41] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:42:42] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 583 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:42:43] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:42:43] [INFO ] [Real]Absence check using 201 positive place invariants in 29 ms returned sat
[2022-05-20 16:42:43] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:42:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:42:44] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:42:44] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:42:44] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:42:45] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:42:45] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2022-05-20 16:42:45] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:42:45] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:42:45] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:42:46] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:42:46] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 19 ms to minimize.
[2022-05-20 16:42:46] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:42:46] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:42:46] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:42:46] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:42:47] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:42:47] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:42:47] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:42:47] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:42:47] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:42:48] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:42:48] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:42:48] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:42:48] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:42:48] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:42:48] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:42:49] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:42:49] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:42:49] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:42:49] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:42:49] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:42:49] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:42:50] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:42:50] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:42:50] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:42:50] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:42:50] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:42:50] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:42:51] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:42:51] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:42:51] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:42:51] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:42:51] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:42:51] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:42:52] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:42:52] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:42:52] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:42:52] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:42:52] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:42:52] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:42:53] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:42:53] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:42:53] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:42:53] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:42:53] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:42:53] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:42:53] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:42:54] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:42:54] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:42:54] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:42:54] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:42:54] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:42:54] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:42:55] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:42:55] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:42:55] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:42:55] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:42:55] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:42:55] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:42:56] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:42:56] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:42:56] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:42:56] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:42:56] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:42:56] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:42:57] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:42:57] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:42:57] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:42:57] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:42:57] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:42:57] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:42:58] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:42:58] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:42:58] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:42:58] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:42:58] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:42:58] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2022-05-20 16:42:58] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:42:58] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2022-05-20 16:42:59] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Trap strengthening (SAT) tested/added 107/106 trap constraints in 16097 ms
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-05-20 16:43:00] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:43:01] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:43:01] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:43:01] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2022-05-20 16:43:01] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2022-05-20 16:43:01] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2022-05-20 16:43:01] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2022-05-20 16:43:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 818 ms
[2022-05-20 16:43:01] [INFO ] After 17554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-20 16:43:01] [INFO ] After 17836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 92 ms.
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 952
Applied a total of 101 rules in 40 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 189255 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189255 steps, saw 59916 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:43:05] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 16:43:05] [INFO ] [Real]Absence check using 201 positive place invariants in 33 ms returned sat
[2022-05-20 16:43:05] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:43:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:43:06] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:43:06] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:43:06] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:43:06] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:43:06] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:43:07] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:43:07] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:43:07] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2022-05-20 16:43:07] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:43:07] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:43:07] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2022-05-20 16:43:08] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:43:08] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2022-05-20 16:43:08] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:43:08] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:43:08] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:43:08] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:43:08] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:43:09] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:43:09] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:43:09] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:43:09] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:43:09] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:43:09] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:43:09] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:43:09] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-05-20 16:43:10] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:43:10] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:43:10] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:43:10] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:43:10] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:43:11] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:43:11] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:43:11] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:43:11] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:43:11] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:43:12] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:43:12] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:43:12] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:43:12] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:43:13] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:43:13] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:43:13] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:43:13] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:43:13] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:43:13] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:43:14] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:43:14] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:43:14] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:43:14] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:43:14] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:43:15] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:43:15] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:43:15] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:43:15] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:43:15] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:43:15] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:43:16] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:43:16] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:43:16] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:43:16] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:43:16] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:43:16] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:43:17] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:43:17] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:43:17] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:43:17] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:43:17] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:43:18] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:43:18] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:43:18] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:43:18] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:43:18] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2022-05-20 16:43:18] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:43:19] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:43:19] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:43:19] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:43:19] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:43:19] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:43:19] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:43:20] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:43:20] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:43:20] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:43:20] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:43:20] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:43:21] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:43:21] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:43:21] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:43:21] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:43:21] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:43:22] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:43:22] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:43:22] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:43:22] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:43:22] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:43:23] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:43:23] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:43:23] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:43:23] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:43:23] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:43:24] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:43:24] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:43:24] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:43:24] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:43:24] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:43:25] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:43:25] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:43:25] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:43:25] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2022-05-20 16:43:25] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:43:26] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:43:26] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:43:26] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:43:26] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:43:27] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:43:27] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:43:27] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2022-05-20 16:43:27] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:43:27] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:43:28] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:43:28] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:43:28] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2022-05-20 16:43:28] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2022-05-20 16:43:29] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2022-05-20 16:43:29] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:43:29] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2022-05-20 16:43:29] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2022-05-20 16:43:29] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:43:30] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:43:30] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:43:30] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2022-05-20 16:43:30] [INFO ] Deduced a trap composed of 3 places in 323 ms of which 1 ms to minimize.
[2022-05-20 16:43:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:43:30] [INFO ] After 25332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 35 ms.
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:43:30] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:43:31] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:43:31] [INFO ] Computed 201 place invariants in 1 ms
[2022-05-20 16:43:32] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
[2022-05-20 16:43:32] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:43:32] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:43:32] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:43:32] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:43:32] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-05-20 16:43:33] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 16:43:33] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:43:33] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 16:43:34] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:43:34] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:43:34] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:43:34] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:43:34] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:43:34] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:43:35] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:43:35] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:43:35] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:43:35] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:43:35] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:43:35] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:43:36] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:43:37] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-20 16:43:37] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2022-05-20 16:43:37] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2022-05-20 16:43:37] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:43:37] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:43:37] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:43:37] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:43:38] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:43:38] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:43:38] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:43:38] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:43:38] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:43:39] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:43:39] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:43:39] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:43:39] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:43:39] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:43:40] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:43:40] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:43:40] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:43:40] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:43:40] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2022-05-20 16:43:40] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:43:41] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:43:41] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:43:41] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:43:41] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:43:41] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:43:42] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:43:42] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:43:42] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:43:42] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:43:42] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:43:42] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:43:43] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-05-20 16:43:43] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:43:43] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:43:43] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:43:43] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:43:43] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:43:44] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:43:44] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:43:44] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:43:44] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:43:44] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:43:45] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:43:45] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:43:45] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:43:45] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:43:45] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:43:46] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:43:46] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:43:46] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:43:46] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:43:46] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:43:46] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:43:47] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:43:47] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:43:47] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:43:47] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:43:47] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:43:48] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2022-05-20 16:43:48] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:43:48] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2022-05-20 16:43:48] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2022-05-20 16:43:48] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:43:49] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:43:49] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2022-05-20 16:43:49] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:43:49] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:43:49] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2022-05-20 16:43:50] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:43:50] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2022-05-20 16:43:50] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:43:50] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2022-05-20 16:43:51] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:43:51] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:43:51] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:43:51] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:43:51] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2022-05-20 16:43:51] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:43:52] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:43:52] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:43:52] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:43:52] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:43:53] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2022-05-20 16:43:53] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:43:53] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:43:53] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:43:53] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:43:54] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:43:54] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:43:54] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:43:54] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:43:54] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:43:55] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:43:55] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:43:55] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:43:55] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:43:55] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-05-20 16:43:56] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:43:56] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2022-05-20 16:43:56] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2022-05-20 16:43:56] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:43:57] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:43:57] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:43:57] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:43:57] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:43:57] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:43:58] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:43:58] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:43:58] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:43:58] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:43:58] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:43:59] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:43:59] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:43:59] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:43:59] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:43:59] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:44:00] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:44:00] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2022-05-20 16:44:00] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:44:00] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:44:00] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2022-05-20 16:44:01] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:44:01] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:44:01] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:44:01] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:44:01] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:44:02] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:44:02] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:44:02] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:44:02] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:44:02] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2022-05-20 16:44:02] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:44:03] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:44:03] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:44:03] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:44:03] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-05-20 16:44:03] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:44:03] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:44:03] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-05-20 16:44:04] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:44:04] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:44:04] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:44:05] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:44:05] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:44:05] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:44:05] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:44:05] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:44:06] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:44:06] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:44:06] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:44:06] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:44:06] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:44:07] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:07] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:07] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:44:07] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:44:07] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:44:08] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:44:08] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:44:08] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:44:08] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:44:08] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:44:09] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:44:09] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:44:09] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:44:09] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:44:09] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2022-05-20 16:44:10] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:44:10] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:44:10] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:10] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:10] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:44:11] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:44:11] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:11] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:11] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:44:11] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:12] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:44:12] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:44:12] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:44:12] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:44:12] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:44:13] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:44:13] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:44:13] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:44:13] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:44:13] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:14] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:14] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:44:14] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:44:14] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:44:14] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:15] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:44:15] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:44:15] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:44:15] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2022-05-20 16:44:15] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:44:16] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:44:16] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:44:16] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 0 ms to minimize.
[2022-05-20 16:44:16] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:44:16] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:44:17] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:17] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:44:17] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:44:17] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:44:17] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:44:17] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2022-05-20 16:44:18] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:44:18] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:44:18] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:44:18] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:44:18] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:44:19] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:44:19] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:44:19] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2022-05-20 16:44:19] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:44:19] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:44:20] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:44:20] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:44:20] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:44:20] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:44:20] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:44:21] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:44:21] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:44:21] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:44:21] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:44:21] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:44:22] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:44:22] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:44:22] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:44:22] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:44:22] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:44:23] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:44:23] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:44:23] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:44:23] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:44:23] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:44:24] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:44:24] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:44:24] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2022-05-20 16:44:24] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:44:24] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2022-05-20 16:44:24] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2022-05-20 16:44:25] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:44:25] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:44:25] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2022-05-20 16:44:25] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:44:25] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2022-05-20 16:44:25] [INFO ] Trap strengthening procedure interrupted after too many repetitions 52056 ms
[2022-05-20 16:44:25] [INFO ] Trap strengthening (SAT) tested/added 273/272 trap constraints in 52057 ms
[2022-05-20 16:44:26] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:44:26] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:44:26] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:44:26] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:44:27] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:44:27] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:44:27] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:44:27] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:44:28] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:44:28] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2022-05-20 16:44:28] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:44:29] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:44:29] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:44:29] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2022-05-20 16:44:29] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2022-05-20 16:44:29] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 16:44:30] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2022-05-20 16:44:30] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:44:30] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:44:30] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2022-05-20 16:44:30] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:44:30] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:44:31] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:44:31] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:44:31] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:44:31] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:44:31] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:44:31] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:44:31] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:44:32] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:44:32] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:44:32] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:44:32] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:44:32] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:44:32] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:44:33] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:44:33] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-05-20 16:44:33] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:44:33] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:44:33] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:44:33] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:44:33] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:44:33] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:44:34] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:44:34] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:44:34] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:44:34] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2022-05-20 16:44:34] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:44:34] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:44:34] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:44:35] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2022-05-20 16:44:35] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:44:35] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:44:35] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:44:35] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:44:35] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:44:35] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:44:35] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2022-05-20 16:44:36] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:44:36] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:44:36] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:44:36] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:44:36] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:44:36] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:44:36] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:44:36] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:44:37] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:44:37] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:44:37] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-20 16:44:37] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:44:37] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:44:37] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:44:37] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:44:37] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2022-05-20 16:44:38] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:44:38] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:44:38] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:44:38] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-20 16:44:38] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2022-05-20 16:44:38] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2022-05-20 16:44:38] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2022-05-20 16:44:38] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-20 16:44:39] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:44:39] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:44:39] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2022-05-20 16:44:39] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:44:39] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-20 16:44:39] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:44:39] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:44:39] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:44:40] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:44:40] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:44:40] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:44:40] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:44:40] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2022-05-20 16:44:41] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:44:41] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:44:41] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:44:41] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2022-05-20 16:44:41] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:44:42] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:44:42] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:44:42] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2022-05-20 16:44:42] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:44:42] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:44:42] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:44:43] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:44:43] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2022-05-20 16:44:43] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:44:43] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-05-20 16:44:43] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:44:43] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:44:44] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2022-05-20 16:44:44] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2022-05-20 16:44:44] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:44:44] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2022-05-20 16:44:44] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:44:45] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:44:45] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:44:45] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:44:45] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:44:45] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:44:45] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:44:46] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:44:46] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:44:46] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:44:46] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:44:46] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:44:46] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:44:47] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2022-05-20 16:44:47] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:44:47] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:44:47] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:44:47] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:44:47] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:44:48] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:44:48] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:44:48] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:44:48] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:44:48] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:44:48] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:44:49] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:44:49] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2022-05-20 16:44:49] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:44:49] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:44:49] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:44:49] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:44:50] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:44:50] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:44:50] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:44:50] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:44:50] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2022-05-20 16:44:50] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:44:51] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:44:51] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:44:51] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:44:51] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2022-05-20 16:44:51] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:44:51] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:44:52] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:44:52] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:44:52] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:44:52] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:44:52] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:44:52] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:44:53] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:44:53] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:44:53] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:44:53] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2022-05-20 16:44:53] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:44:54] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:44:54] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:44:54] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 1 ms to minimize.
[2022-05-20 16:44:54] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:44:55] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2022-05-20 16:44:55] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:44:55] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:44:55] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-05-20 16:44:56] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-05-20 16:44:56] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:44:56] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:44:56] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-20 16:44:56] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-20 16:44:56] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:44:57] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-05-20 16:44:57] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2022-05-20 16:44:57] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:44:57] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:44:57] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:44:57] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:44:58] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:44:58] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:44:58] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:44:58] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:44:58] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-20 16:44:59] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:44:59] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2022-05-20 16:44:59] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:44:59] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:44:59] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:44:59] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:45:00] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:45:00] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2022-05-20 16:45:00] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:45:00] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:45:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-05-20 16:45:00] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:45:01] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-05-20 16:45:01] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:45:01] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2022-05-20 16:45:01] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:45:01] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2022-05-20 16:45:01] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2022-05-20 16:45:02] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:45:02] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2022-05-20 16:45:02] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:45:02] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:45:02] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:45:02] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2022-05-20 16:45:03] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2022-05-20 16:45:03] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2022-05-20 16:45:03] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:45:03] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:45:03] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:45:03] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:45:03] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:45:04] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:45:04] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:45:04] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2022-05-20 16:45:04] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:45:04] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:45:04] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:45:05] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:45:05] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:45:05] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2022-05-20 16:45:05] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:45:05] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:45:05] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:45:06] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:45:06] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:45:06] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:45:06] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:45:06] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2022-05-20 16:45:06] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:45:07] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2022-05-20 16:45:07] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:45:07] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:45:07] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:45:07] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:45:07] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:45:08] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2022-05-20 16:45:08] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2022-05-20 16:45:08] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:45:08] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-05-20 16:45:08] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:45:08] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-05-20 16:45:09] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-20 16:45:09] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2022-05-20 16:45:09] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2022-05-20 16:45:09] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:45:09] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:45:09] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2022-05-20 16:45:10] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:45:10] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-05-20 16:45:10] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:45:10] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:45:10] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2022-05-20 16:45:10] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-05-20 16:45:11] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-20 16:45:11] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-05-20 16:45:11] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:45:11] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:45:11] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2022-05-20 16:45:11] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2022-05-20 16:45:12] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-05-20 16:45:12] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2022-05-20 16:45:12] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:45:12] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2022-05-20 16:45:12] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-20 16:45:12] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2022-05-20 16:45:13] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2022-05-20 16:45:13] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2022-05-20 16:45:13] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2022-05-20 16:45:13] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:13] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:45:13] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:45:13] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:45:14] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:14] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:45:14] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:45:14] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:45:14] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-05-20 16:45:14] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:14] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:15] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:15] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:15] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:15] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-20 16:45:15] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:45:15] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:45:15] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:15] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:45:16] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:45:16] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:45:16] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:16] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:45:16] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2022-05-20 16:45:16] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2022-05-20 16:45:16] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:45:16] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-05-20 16:45:17] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:45:17] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2022-05-20 16:45:17] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:45:17] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:45:17] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:45:17] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:45:17] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:45:18] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:45:18] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:45:18] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2022-05-20 16:45:18] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2022-05-20 16:45:18] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:45:18] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:45:18] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:45:18] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-20 16:45:19] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:45:19] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2022-05-20 16:45:19] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:19] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2022-05-20 16:45:19] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:45:19] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:45:19] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:45:20] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:45:20] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:20] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2022-05-20 16:45:20] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:45:20] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:20] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:45:20] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:45:20] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2022-05-20 16:45:21] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:45:21] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2022-05-20 16:45:21] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:21] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2022-05-20 16:45:21] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:21] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:45:21] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2022-05-20 16:45:21] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-20 16:45:22] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:45:22] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:45:22] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:45:22] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:45:22] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:22] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:45:22] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:45:23] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-20 16:45:23] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-20 16:45:23] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-20 16:45:23] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2022-05-20 16:45:23] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:23] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:23] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:45:23] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2022-05-20 16:45:24] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2022-05-20 16:45:24] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-05-20 16:45:24] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-20 16:45:24] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:45:24] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2022-05-20 16:45:24] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-20 16:45:24] [INFO ] Trap strengthening procedure interrupted after too many repetitions 58620 ms
[2022-05-20 16:45:24] [INFO ] Trap strengthening (SAT) tested/added 369/368 trap constraints in 58620 ms
[2022-05-20 16:45:24] [INFO ] After 111370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 704 ms.
[2022-05-20 16:45:25] [INFO ] After 112258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 16:45:25] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:45:25] [INFO ] Flatten gal took : 36 ms
[2022-05-20 16:45:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11269277010449829652.gal : 4 ms
[2022-05-20 16:45:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality883274294504719620.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14112541247846441305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11269277010449829652.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality883274294504719620.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality883274294504719620.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 140
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :140 after 1696
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1696 after 33195
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :33195 after 308872
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :308872 after 3.70348e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.70348e+06 after 3.36166e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.36166e+08 after 4.8429e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.8429e+10 after 2.22404e+13
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.22404e+13 after 2.18047e+16
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.18047e+16 after 8.63966e+20
Detected timeout of ITS tools.
[2022-05-20 16:45:40] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:45:40] [INFO ] Applying decomposition
[2022-05-20 16:45:40] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18406090638037349024.txt' '-o' '/tmp/graph18406090638037349024.bin' '-w' '/tmp/graph18406090638037349024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18406090638037349024.bin' '-l' '-1' '-v' '-w' '/tmp/graph18406090638037349024.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:45:40] [INFO ] Decomposing Gal with order
[2022-05-20 16:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:45:40] [INFO ] Removed a total of 1101 redundant transitions.
[2022-05-20 16:45:40] [INFO ] Flatten gal took : 62 ms
[2022-05-20 16:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 935 labels/synchronizations in 28 ms.
[2022-05-20 16:45:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12253661539374487374.gal : 4 ms
[2022-05-20 16:45:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2624771993546486925.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14112541247846441305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12253661539374487374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2624771993546486925.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality2624771993546486925.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 706
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :706 after 706
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :706 after 706
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :706 after 706
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :706 after 706
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :706 after 3.0887e+56
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin121174738862559790
[2022-05-20 16:45:56] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin121174738862559790
Running compilation step : cd /tmp/ltsmin121174738862559790;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1810 ms.
Running link step : cd /tmp/ltsmin121174738862559790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin121174738862559790;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 13 factoid took 709 ms. Reduced automaton from 5 states, 16 edges and 3 AP to 5 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20032 reset in 1294 ms.
Product exploration explored 100000 steps with 19898 reset in 1355 ms.
Built C files in :
/tmp/ltsmin13846053732367510232
[2022-05-20 16:46:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13846053732367510232
Running compilation step : cd /tmp/ltsmin13846053732367510232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1659 ms.
Running link step : cd /tmp/ltsmin13846053732367510232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13846053732367510232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9857760220428824158.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 9 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:46:30] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:46:30] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:46:30] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:46:31] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
// Phase 1: matrix 952 rows 702 cols
[2022-05-20 16:46:31] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:46:31] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 702/702 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin9270784694975662876
[2022-05-20 16:46:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9270784694975662876
Running compilation step : cd /tmp/ltsmin9270784694975662876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1717 ms.
Running link step : cd /tmp/ltsmin9270784694975662876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9270784694975662876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1413113723852550419.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:46:47] [INFO ] Flatten gal took : 39 ms
[2022-05-20 16:46:47] [INFO ] Flatten gal took : 52 ms
[2022-05-20 16:46:47] [INFO ] Time to serialize gal into /tmp/LTL14892997007144494782.gal : 4 ms
[2022-05-20 16:46:47] [INFO ] Time to serialize properties into /tmp/LTL1992733438289105555.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14892997007144494782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1992733438289105555.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1489299...267
Read 1 LTL properties
Checking formula 0 : !((F(G((F(G(X((X("(((p146==0)||(p147==0))||(p152==0))"))||("(p141==1)")))))||((X("(p690==1)"))U("(p141==1)"))))))
Formula 0 simplified : !FG(FGX("(p141==1)" | X"(((p146==0)||(p147==0))||(p152==0))") | (X"(p690==1)" U "(p141==1)"))
Detected timeout of ITS tools.
[2022-05-20 16:47:02] [INFO ] Flatten gal took : 38 ms
[2022-05-20 16:47:02] [INFO ] Applying decomposition
[2022-05-20 16:47:02] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15335876908486082250.txt' '-o' '/tmp/graph15335876908486082250.bin' '-w' '/tmp/graph15335876908486082250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15335876908486082250.bin' '-l' '-1' '-v' '-w' '/tmp/graph15335876908486082250.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:47:02] [INFO ] Decomposing Gal with order
[2022-05-20 16:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:47:02] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:47:02] [INFO ] Flatten gal took : 55 ms
[2022-05-20 16:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 920 labels/synchronizations in 29 ms.
[2022-05-20 16:47:02] [INFO ] Time to serialize gal into /tmp/LTL17310750128418991887.gal : 19 ms
[2022-05-20 16:47:02] [INFO ] Time to serialize properties into /tmp/LTL1505481669612886457.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17310750128418991887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1505481669612886457.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1731075...246
Read 1 LTL properties
Checking formula 0 : !((F(G((F(G(X((X("(((i3.u41.p146==0)||(i3.u42.p147==0))||(i3.u43.p152==0))"))||("(i3.u40.p141==1)")))))||((X("(i16.u197.p690==1)"))U("...178
Formula 0 simplified : !FG(FGX("(i3.u40.p141==1)" | X"(((i3.u41.p146==0)||(i3.u42.p147==0))||(i3.u43.p152==0))") | (X"(i16.u197.p690==1)" U "(i3.u40.p141==...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18276520953645059728
[2022-05-20 16:47:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18276520953645059728
Running compilation step : cd /tmp/ltsmin18276520953645059728;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1669 ms.
Running link step : cd /tmp/ltsmin18276520953645059728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18276520953645059728;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>([](X((X((LTLAPp0==true))||(LTLAPp1==true)))))||(X((LTLAPp2==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050A-LTLFireability-11 finished in 500910 ms.
[2022-05-20 16:47:32] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1230985525025439049
[2022-05-20 16:47:32] [INFO ] Computing symmetric may disable matrix : 953 transitions.
[2022-05-20 16:47:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:47:32] [INFO ] Computing symmetric may enable matrix : 953 transitions.
[2022-05-20 16:47:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:47:32] [INFO ] Applying decomposition
[2022-05-20 16:47:32] [INFO ] Flatten gal took : 43 ms
[2022-05-20 16:47:32] [INFO ] Computing Do-Not-Accords matrix : 953 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18371566343354035375.txt' '-o' '/tmp/graph18371566343354035375.bin' '-w' '/tmp/graph18371566343354035375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18371566343354035375.bin' '-l' '-1' '-v' '-w' '/tmp/graph18371566343354035375.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:47:32] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:47:32] [INFO ] Decomposing Gal with order
[2022-05-20 16:47:32] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1230985525025439049
Running compilation step : cd /tmp/ltsmin1230985525025439049;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 16:47:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:47:32] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 16:47:32] [INFO ] Flatten gal took : 49 ms
[2022-05-20 16:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1008 labels/synchronizations in 30 ms.
[2022-05-20 16:47:33] [INFO ] Time to serialize gal into /tmp/LTLFireability2917652839311609094.gal : 5 ms
[2022-05-20 16:47:33] [INFO ] Time to serialize properties into /tmp/LTLFireability6309261393647944065.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2917652839311609094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6309261393647944065.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((F(G((F(G(X((X("(((i3.u41.p146==0)||(i3.u42.p147==0))||(i3.u43.p152==0))"))||("(i3.u40.p141==1)")))))||((X("(i15.u197.p690==1)"))U("...178
Formula 0 simplified : !FG(FGX("(i3.u40.p141==1)" | X"(((i3.u41.p146==0)||(i3.u42.p147==0))||(i3.u43.p152==0))") | (X"(i15.u197.p690==1)" U "(i3.u40.p141==...160
Compilation finished in 2691 ms.
Running link step : cd /tmp/ltsmin1230985525025439049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1230985525025439049;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>([](X((X((LTLAPp0==true))||(LTLAPp1==true)))))||(X((LTLAPp2==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 17:14:09] [INFO ] Applying decomposition
[2022-05-20 17:14:10] [INFO ] Flatten gal took : 370 ms
[2022-05-20 17:14:10] [INFO ] Decomposing Gal with order
[2022-05-20 17:14:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:14:10] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 17:14:10] [INFO ] Flatten gal took : 361 ms
[2022-05-20 17:14:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 150 ms.
[2022-05-20 17:14:11] [INFO ] Time to serialize gal into /tmp/LTLFireability17096226627688799288.gal : 30 ms
[2022-05-20 17:14:11] [INFO ] Time to serialize properties into /tmp/LTLFireability7553855630478026441.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17096226627688799288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7553855630478026441.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F(G((F(G(X((X("(((u42.p146==0)||(u43.p147==0))||(u44.p152==0))"))||("(u41.p141==1)")))))||((X("(u198.p690==1)"))U("(u41.p141==1)"))...159
Formula 0 simplified : !FG(FGX("(u41.p141==1)" | X"(((u42.p146==0)||(u43.p147==0))||(u44.p152==0))") | (X"(u198.p690==1)" U "(u41.p141==1)"))
Reverse transition relation is NOT exact ! Due to transitions t304, t307, t310, t317, t320, t324, t326, t331, t336, t339, t344, t348, t350, t356, t361, t36...4105
Computing Next relation with stutter on 2.394e+38 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="ShieldRVs-PT-050A"
export BK_EXAMINATION="LTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025900852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;