About the Execution of GreatSPN+red for EisenbergMcGuire-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14616.235 | 2859917.00 | 4315897.00 | 6763.00 | FFFFFT??TFTFFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r157-smll-171636265100164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is EisenbergMcGuire-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265100164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 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 EisenbergMcGuire-PT-05-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716483088102
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 16:51:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 16:51:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:51:30] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-23 16:51:30] [INFO ] Transformed 295 places.
[2024-05-23 16:51:30] [INFO ] Transformed 800 transitions.
[2024-05-23 16:51:30] [INFO ] Found NUPN structural information;
[2024-05-23 16:51:30] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 280 transition count 725
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 280 transition count 725
Applied a total of 30 rules in 104 ms. Remains 280 /295 variables (removed 15) and now considering 725/800 (removed 75) transitions.
[2024-05-23 16:51:30] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
// Phase 1: matrix 390 rows 280 cols
[2024-05-23 16:51:30] [INFO ] Computed 16 invariants in 31 ms
[2024-05-23 16:51:31] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-23 16:51:31] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-23 16:51:31] [INFO ] Invariant cache hit.
[2024-05-23 16:51:31] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-05-23 16:51:32] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
Running 720 sub problems to find dead transitions.
[2024-05-23 16:51:32] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-23 16:51:32] [INFO ] Invariant cache hit.
[2024-05-23 16:51:32] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 16:51:38] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 25 ms to minimize.
[2024-05-23 16:51:38] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-23 16:51:38] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:51:38] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 4 ms to minimize.
[2024-05-23 16:51:38] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:51:38] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:51:39] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:51:39] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 3 ms to minimize.
[2024-05-23 16:51:39] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:51:39] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-23 16:51:40] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:51:40] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:51:40] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:51:40] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
[2024-05-23 16:51:40] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 16:51:42] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:51:42] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:51:42] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:51:43] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:51:43] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:51:43] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:51:43] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:51:43] [INFO ] Deduced a trap composed of 48 places in 260 ms of which 3 ms to minimize.
[2024-05-23 16:51:44] [INFO ] Deduced a trap composed of 81 places in 236 ms of which 3 ms to minimize.
[2024-05-23 16:51:44] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:51:44] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:51:44] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:51:44] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:51:44] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:51:45] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 5 ms to minimize.
[2024-05-23 16:51:45] [INFO ] Deduced a trap composed of 68 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:51:45] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:51:45] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:51:45] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:51:46] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 16:51:51] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:51:51] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-23 16:51:51] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:51:51] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:51:52] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 3 ms to minimize.
[2024-05-23 16:51:52] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:51:52] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:51:52] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:51:52] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:51:53] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 16:51:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-05-23 16:51:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:51:53] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:51:54] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2024-05-23 16:51:54] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:51:54] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:51:54] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:51:55] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:51:59] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:52:00] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 16:52:01] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:52:02] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:52:02] [INFO ] Deduced a trap composed of 84 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:52:02] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:52:02] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:52:02] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:52:02] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 30688ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30738ms
Starting structural reductions in LTL mode, iteration 1 : 280/295 places, 725/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32310 ms. Remains : 280/295 places, 725/800 transitions.
Support contains 40 out of 280 places after structural reductions.
[2024-05-23 16:52:03] [INFO ] Flatten gal took : 111 ms
[2024-05-23 16:52:03] [INFO ] Flatten gal took : 69 ms
[2024-05-23 16:52:03] [INFO ] Input system was already deterministic with 725 transitions.
Support contains 39 out of 280 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2894 ms. (13 steps per ms) remains 17/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
[2024-05-23 16:52:04] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-05-23 16:52:04] [INFO ] Invariant cache hit.
[2024-05-23 16:52:04] [INFO ] State equation strengthened by 136 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 246/276 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 16:52:05] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-23 16:52:05] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:52:05] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 3 ms to minimize.
[2024-05-23 16:52:05] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-23 16:52:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 16:52:05] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 16:52:06] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:52:06] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 16:52:06] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/277 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 16:52:07] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2024-05-23 16:52:07] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:52:07] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:52:07] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 3/280 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 16:52:07] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:52:08] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:52:09] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:52:09] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:52:09] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 390/670 variables, 280/322 constraints. Problems are: Problem set: 0 solved, 17 unsolved
SMT process timed out in 5030ms, After SMT, problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 280 transition count 721
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 276 transition count 721
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 8 place count 276 transition count 649
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 152 place count 204 transition count 649
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 203 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 203 transition count 644
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 194 place count 183 transition count 624
Applied a total of 194 rules in 130 ms. Remains 183 /280 variables (removed 97) and now considering 624/725 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 183/280 places, 624/725 transitions.
RANDOM walk for 40000 steps (8 resets) in 630 ms. (63 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
[2024-05-23 16:52:10] [INFO ] Flow matrix only has 289 transitions (discarded 335 similar events)
// Phase 1: matrix 289 rows 183 cols
[2024-05-23 16:52:10] [INFO ] Computed 16 invariants in 12 ms
[2024-05-23 16:52:10] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 120/148 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:10] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 27/175 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:10] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:52:10] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:52:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:52:10] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:52:10] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:52:11] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 8/183 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:11] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:52:11] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 2 ms to minimize.
[2024-05-23 16:52:11] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:52:11] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:52:11] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:52:12] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:52:12] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:52:12] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-05-23 16:52:12] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:52:12] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:52:12] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2024-05-23 16:52:12] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:52:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 289/472 variables, 183/220 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 132/352 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/472 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 352 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3305 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 120/148 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 27/175 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:13] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 8/183 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:52:15] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-05-23 16:52:15] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 289/472 variables, 183/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 132/360 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/472 variables, 15/375 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 16:52:16] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:52:16] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:52:16] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 0/472 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 378 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3577 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 32/32 constraints]
After SMT, in 6929ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 6 properties in 9756 ms.
Support contains 19 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 624/624 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 183 transition count 619
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 178 transition count 619
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 175 transition count 604
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 175 transition count 604
Applied a total of 16 rules in 36 ms. Remains 175 /183 variables (removed 8) and now considering 604/624 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 175/183 places, 604/624 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/8 properties
[2024-05-23 16:52:27] [INFO ] Flow matrix only has 269 transitions (discarded 335 similar events)
// Phase 1: matrix 269 rows 175 cols
[2024-05-23 16:52:27] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 16:52:27] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 123/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 28/168 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:28] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 3 ms to minimize.
[2024-05-23 16:52:28] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/175 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:28] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-23 16:52:28] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-23 16:52:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:28] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 269/444 variables, 175/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 120/323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/444 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 323 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 175/175 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 123/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:28] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 28/168 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 7/175 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:29] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 269/444 variables, 175/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 120/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 7/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:29] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/444 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:52:29] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/444 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/444 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 334 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1520 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 175/175 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 16/16 constraints]
After SMT, in 2934ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 2870 ms.
Support contains 16 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 604/604 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 175 transition count 602
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 172 transition count 597
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 172 transition count 597
Applied a total of 6 rules in 34 ms. Remains 172 /175 variables (removed 3) and now considering 597/604 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 172/175 places, 597/604 transitions.
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 353262 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 6
Probabilistic random walk after 353262 steps, saw 76173 distinct states, run finished after 3012 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-23 16:52:36] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2024-05-23 16:52:36] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 16:52:36] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 121/137 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 28/165 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/172 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 262/434 variables, 172/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/434 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 304 constraints, problems are : Problem set: 0 solved, 6 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 172/172 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 121/137 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 28/165 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 3 ms to minimize.
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/172 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 262/434 variables, 172/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 116/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/434 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 320 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 172/172 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 10/10 constraints]
After SMT, in 1795ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2774 ms.
Support contains 16 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 27 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 15 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2024-05-23 16:52:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-05-23 16:52:41] [INFO ] Invariant cache hit.
[2024-05-23 16:52:41] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-23 16:52:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-05-23 16:52:41] [INFO ] Invariant cache hit.
[2024-05-23 16:52:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 16:52:41] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-23 16:52:41] [INFO ] Redundant transitions in 36 ms returned []
Running 592 sub problems to find dead transitions.
[2024-05-23 16:52:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-05-23 16:52:41] [INFO ] Invariant cache hit.
[2024-05-23 16:52:41] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:52:45] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:52:45] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:52:45] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:52:45] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:52:45] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:52:45] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-23 16:52:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 16:52:46] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:52:46] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:52:46] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:52:46] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:52:46] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:52:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-23 16:52:47] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:52:47] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:52:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 16:52:47] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:52:47] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-23 16:52:47] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:52:47] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:52:48] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:52:48] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:52:48] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:52:48] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:52:48] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:52:48] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-05-23 16:52:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 16:52:49] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:52:49] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:52:50] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:52:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 16:52:50] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:52:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-23 16:52:51] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2024-05-23 16:52:51] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:52:51] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:52:51] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:52:51] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:52:52] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:52:52] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:52:55] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2024-05-23 16:52:55] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:52:58] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:52:58] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:52:58] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:52:58] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:52:59] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:52:59] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:52:59] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:52:59] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:52:59] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:53:00] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:53:02] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:53:02] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:53:02] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:53:02] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-05-23 16:53:03] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:53:07] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-23 16:53:08] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/434 variables, and 89 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/172 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 73/89 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:53:15] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:53:16] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:53:16] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:53:16] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:53:16] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:53:16] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:53:17] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:53:17] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:53:18] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:53:18] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:53:18] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:53:19] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:53:19] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:53:21] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:53:22] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:53:22] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:53:22] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:53:22] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:53:22] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:53:24] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:53:26] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:53:26] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:53:26] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:53:26] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:53:26] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:53:26] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:53:27] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-23 16:53:27] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:53:27] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:53:27] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:53:27] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:53:27] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:53:27] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:53:28] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:53:28] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:53:28] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:53:28] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:53:28] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 4 ms to minimize.
[2024-05-23 16:53:29] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:53:29] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-23 16:53:31] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:53:32] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:53:32] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:53:32] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:53:32] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:53:32] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:53:33] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:53:33] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:53:33] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:53:33] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:53:34] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:53:35] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:53:35] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:53:35] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:53:37] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:53:37] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:53:37] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:53:38] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:53:40] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:53:40] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/434 variables, and 160 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/172 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/592 constraints, Known Traps: 144/144 constraints]
After SMT, in 60318ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61160 ms. Remains : 172/172 places, 597/597 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 467 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 5 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 152 transition count 173
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 123 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 122 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 61 place count 122 transition count 161
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 88 place count 106 transition count 161
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 158 place count 71 transition count 126
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 171 place count 71 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 185 place count 64 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 187 place count 64 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 193 place count 64 transition count 176
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 197 place count 64 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 201 place count 60 transition count 172
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 225 place count 60 transition count 172
Applied a total of 225 rules in 54 ms. Remains 60 /172 variables (removed 112) and now considering 172/597 (removed 425) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 172 rows 60 cols
[2024-05-23 16:53:42] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 16:53:42] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-23 16:53:42] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 16:53:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-23 16:53:42] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 16:53:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-23 16:53:42] [INFO ] After 70ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 16:53:42] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 16:53:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 16:53:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2024-05-23 16:53:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 16:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
TRAPS : Iteration 1
[2024-05-23 16:53:43] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 16:53:43] [INFO ] After 587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 822 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(X(p0)||X(F(p1)))) U p2)))'
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 276 transition count 705
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 276 transition count 705
Applied a total of 8 rules in 14 ms. Remains 276 /280 variables (removed 4) and now considering 705/725 (removed 20) transitions.
[2024-05-23 16:53:43] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-05-23 16:53:43] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 16:53:43] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-23 16:53:43] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-23 16:53:43] [INFO ] Invariant cache hit.
[2024-05-23 16:53:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-23 16:53:44] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-23 16:53:44] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-23 16:53:44] [INFO ] Invariant cache hit.
[2024-05-23 16:53:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:53:49] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:53:49] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 2 ms to minimize.
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 3 ms to minimize.
[2024-05-23 16:53:51] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:53:51] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:53:51] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:53:51] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 2 ms to minimize.
[2024-05-23 16:53:52] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:53:52] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:53:52] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:53:52] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:53:52] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:53:52] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 2 ms to minimize.
[2024-05-23 16:53:53] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:53:53] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:53:53] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:53:54] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:53:54] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 3 ms to minimize.
[2024-05-23 16:53:54] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:53:54] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:53:54] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:53:54] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:53:54] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:53:55] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:53:55] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:53:55] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-05-23 16:53:55] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:53:55] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:53:55] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:53:55] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:53:56] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:53:56] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:53:56] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 3 ms to minimize.
[2024-05-23 16:53:56] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:54:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 16:54:02] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:54:02] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 2 ms to minimize.
[2024-05-23 16:54:02] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-05-23 16:54:02] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:54:02] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:54:03] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
[2024-05-23 16:54:03] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-05-23 16:54:03] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:54:03] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 3 ms to minimize.
[2024-05-23 16:54:03] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-05-23 16:54:04] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:54:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-23 16:54:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 16:54:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 16:54:04] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:54:04] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:54:05] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:54:05] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 2 ms to minimize.
[2024-05-23 16:54:05] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:54:05] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 3 ms to minimize.
[2024-05-23 16:54:06] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2024-05-23 16:54:06] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:54:06] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:54:07] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:54:07] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:54:07] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 3 ms to minimize.
[2024-05-23 16:54:07] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:54:08] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:54:08] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:54:08] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:54:08] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:54:09] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2024-05-23 16:54:10] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:54:10] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:54:11] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:54:11] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:54:11] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:54:12] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:54:12] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:54:13] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/646 variables, and 97 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/276 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:54:17] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-05-23 16:54:17] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:54:17] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:54:18] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:54:18] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:54:18] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:54:18] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:54:18] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:54:18] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:54:19] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:54:19] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:54:19] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:54:19] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:54:19] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 2 ms to minimize.
[2024-05-23 16:54:20] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:54:20] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:54:20] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-05-23 16:54:20] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:54:21] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 3 ms to minimize.
[2024-05-23 16:54:21] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:54:22] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 2 ms to minimize.
[2024-05-23 16:54:22] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:54:23] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:54:23] [INFO ] Deduced a trap composed of 85 places in 353 ms of which 36 ms to minimize.
[2024-05-23 16:54:23] [INFO ] Deduced a trap composed of 74 places in 287 ms of which 3 ms to minimize.
[2024-05-23 16:54:23] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:54:24] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:54:24] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:54:24] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:54:24] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 3 ms to minimize.
[2024-05-23 16:54:24] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:54:25] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-05-23 16:54:25] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:54:25] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:54:25] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 3 ms to minimize.
[2024-05-23 16:54:25] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:54:26] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:54:26] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:54:28] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:54:28] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:54:29] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:54:30] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:54:30] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:54:30] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:54:30] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:54:30] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-05-23 16:54:31] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:54:31] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:54:31] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:54:31] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:54:33] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 2 ms to minimize.
[2024-05-23 16:54:33] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:54:34] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:54:34] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:54:34] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:54:34] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:54:34] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:54:34] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-23 16:54:35] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-23 16:54:35] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-23 16:54:36] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:54:37] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-05-23 16:54:38] [INFO ] Deduced a trap composed of 72 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:54:39] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-05-23 16:54:40] [INFO ] Deduced a trap composed of 82 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:54:40] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 2 ms to minimize.
[2024-05-23 16:54:40] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:54:40] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:54:40] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:54:41] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 3 ms to minimize.
[2024-05-23 16:54:41] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:54:41] [INFO ] Deduced a trap composed of 77 places in 191 ms of which 3 ms to minimize.
[2024-05-23 16:54:41] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:54:42] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:54:42] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 3 ms to minimize.
[2024-05-23 16:54:42] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:54:42] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:54:42] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:54:43] [INFO ] Deduced a trap composed of 94 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:54:43] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/646 variables, and 177 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/276 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 161/161 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Starting structural reductions in LTL mode, iteration 1 : 276/280 places, 705/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61549 ms. Remains : 276/280 places, 705/725 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1 p0), (OR p1 p0), p1]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 375 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-00 finished in 62429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 63 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-23 16:54:45] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-23 16:54:45] [INFO ] Computed 16 invariants in 4 ms
[2024-05-23 16:54:46] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-23 16:54:46] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 16:54:46] [INFO ] Invariant cache hit.
[2024-05-23 16:54:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 16:54:46] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2024-05-23 16:54:46] [INFO ] Redundant transitions in 8 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-23 16:54:46] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 16:54:46] [INFO ] Invariant cache hit.
[2024-05-23 16:54:46] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:54:50] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:54:50] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:54:50] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-23 16:54:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:54:50] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:54:50] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:54:50] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:54:50] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:54:51] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:54:51] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-23 16:54:51] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:54:51] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:54:51] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:54:51] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:54:52] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:54:52] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:54:52] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:54:52] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:54:52] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:54:52] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:54:53] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:54:53] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:54:54] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:54:54] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:54:54] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:54:54] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:54:54] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:54:56] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
[2024-05-23 16:54:56] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:54:56] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:54:56] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:55:00] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-23 16:55:00] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:55:02] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:55:02] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:55:02] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:55:02] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:55:02] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:55:02] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:55:03] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:55:03] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:55:03] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:55:05] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:55:05] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:55:06] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:55:06] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2024-05-23 16:55:06] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:55:07] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:55:07] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:55:07] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:55:07] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:55:07] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:55:08] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:55:08] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:55:09] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:55:10] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:55:10] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:55:11] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:55:12] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:55:12] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:55:13] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-05-23 16:55:13] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:55:13] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:55:14] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 96 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:55:19] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:55:19] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2024-05-23 16:55:19] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:55:19] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:55:22] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:55:22] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:55:23] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:55:23] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:55:24] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:55:25] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:55:25] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:55:25] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:55:26] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:55:26] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:55:26] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:55:26] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:55:26] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:55:26] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:55:26] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:55:27] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:55:27] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:55:27] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:55:28] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:55:28] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 16/125 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:55:31] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:55:31] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:55:31] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:55:31] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:55:31] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2024-05-23 16:55:32] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:55:32] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2024-05-23 16:55:32] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:55:32] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:55:33] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 3 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:55:35] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:55:37] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:55:37] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:55:37] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:55:37] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:55:37] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:55:38] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 1 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2024-05-23 16:55:40] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-05-23 16:55:40] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:55:41] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:55:41] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 16/161 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:55:44] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-05-23 16:55:44] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:55:45] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:55:45] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:55:45] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:55:45] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 167 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 151/151 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61170 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 215 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-01 finished in 61513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 12 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-23 16:55:47] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-23 16:55:47] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 16:55:47] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-23 16:55:47] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 16:55:47] [INFO ] Invariant cache hit.
[2024-05-23 16:55:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 16:55:48] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-23 16:55:48] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 16:55:48] [INFO ] Invariant cache hit.
[2024-05-23 16:55:48] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:55:53] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:55:53] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 3 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 3 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:55:55] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:55:55] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:55:55] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:55:55] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:55:56] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 2 ms to minimize.
[2024-05-23 16:55:56] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:55:56] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:55:56] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:55:56] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 2 ms to minimize.
[2024-05-23 16:55:56] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:55:57] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:55:57] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:55:57] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:55:58] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:55:58] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 4 ms to minimize.
[2024-05-23 16:55:58] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:55:58] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:55:58] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:55:58] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:55:59] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:55:59] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 2 ms to minimize.
[2024-05-23 16:55:59] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:55:59] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:55:59] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:56:00] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:56:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 16:56:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 16:56:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 16:56:00] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 3 ms to minimize.
[2024-05-23 16:56:00] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:56:05] [INFO ] Deduced a trap composed of 77 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:56:07] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:56:07] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:56:07] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:56:07] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:56:07] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:56:08] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:56:08] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:56:09] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 4 ms to minimize.
[2024-05-23 16:56:09] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 3 ms to minimize.
[2024-05-23 16:56:11] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 2 ms to minimize.
[2024-05-23 16:56:11] [INFO ] Deduced a trap composed of 71 places in 232 ms of which 4 ms to minimize.
[2024-05-23 16:56:12] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 2 ms to minimize.
[2024-05-23 16:56:12] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:56:12] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:56:13] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 4 ms to minimize.
[2024-05-23 16:56:14] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-23 16:56:15] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-23 16:56:18] [INFO ] Deduced a trap composed of 69 places in 240 ms of which 4 ms to minimize.
[2024-05-23 16:56:18] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 4 ms to minimize.
[2024-05-23 16:56:18] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 5 ms to minimize.
SMT process timed out in 30244ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30254ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31410 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-04 finished in 31673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||G(p2)))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 16 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-23 16:56:19] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 16:56:19] [INFO ] Invariant cache hit.
[2024-05-23 16:56:19] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-23 16:56:19] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 16:56:19] [INFO ] Invariant cache hit.
[2024-05-23 16:56:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 16:56:20] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-23 16:56:20] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 16:56:20] [INFO ] Invariant cache hit.
[2024-05-23 16:56:20] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:56:27] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:56:27] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:56:28] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 4 ms to minimize.
[2024-05-23 16:56:28] [INFO ] Deduced a trap composed of 49 places in 245 ms of which 4 ms to minimize.
[2024-05-23 16:56:28] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 4 ms to minimize.
[2024-05-23 16:56:28] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 3 ms to minimize.
[2024-05-23 16:56:29] [INFO ] Deduced a trap composed of 72 places in 220 ms of which 4 ms to minimize.
[2024-05-23 16:56:29] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 4 ms to minimize.
[2024-05-23 16:56:29] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 3 ms to minimize.
[2024-05-23 16:56:29] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 4 ms to minimize.
[2024-05-23 16:56:30] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 4 ms to minimize.
[2024-05-23 16:56:30] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:56:31] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 5 ms to minimize.
[2024-05-23 16:56:31] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 5 ms to minimize.
[2024-05-23 16:56:31] [INFO ] Deduced a trap composed of 72 places in 252 ms of which 4 ms to minimize.
[2024-05-23 16:56:31] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:56:32] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 4 ms to minimize.
[2024-05-23 16:56:32] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:56:32] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 5 ms to minimize.
[2024-05-23 16:56:32] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:56:33] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:56:33] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:56:34] [INFO ] Deduced a trap composed of 57 places in 268 ms of which 4 ms to minimize.
[2024-05-23 16:56:34] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 5 ms to minimize.
[2024-05-23 16:56:34] [INFO ] Deduced a trap composed of 51 places in 258 ms of which 4 ms to minimize.
[2024-05-23 16:56:35] [INFO ] Deduced a trap composed of 43 places in 274 ms of which 5 ms to minimize.
[2024-05-23 16:56:35] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:56:35] [INFO ] Deduced a trap composed of 80 places in 257 ms of which 4 ms to minimize.
[2024-05-23 16:56:35] [INFO ] Deduced a trap composed of 72 places in 225 ms of which 4 ms to minimize.
[2024-05-23 16:56:36] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 4 ms to minimize.
[2024-05-23 16:56:36] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 4 ms to minimize.
[2024-05-23 16:56:36] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 4 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 2 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 3 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-23 16:56:38] [INFO ] Deduced a trap composed of 64 places in 297 ms of which 5 ms to minimize.
[2024-05-23 16:56:38] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:56:46] [INFO ] Deduced a trap composed of 77 places in 274 ms of which 4 ms to minimize.
[2024-05-23 16:56:47] [INFO ] Deduced a trap composed of 86 places in 237 ms of which 4 ms to minimize.
[2024-05-23 16:56:47] [INFO ] Deduced a trap composed of 71 places in 213 ms of which 3 ms to minimize.
[2024-05-23 16:56:47] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
[2024-05-23 16:56:47] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 3 ms to minimize.
[2024-05-23 16:56:48] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 4 ms to minimize.
[2024-05-23 16:56:48] [INFO ] Deduced a trap composed of 61 places in 230 ms of which 3 ms to minimize.
[2024-05-23 16:56:48] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 4 ms to minimize.
[2024-05-23 16:56:48] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 4 ms to minimize.
[2024-05-23 16:56:49] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 4 ms to minimize.
[2024-05-23 16:56:49] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 4 ms to minimize.
[2024-05-23 16:56:49] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 3 ms to minimize.
[2024-05-23 16:56:50] [INFO ] Deduced a trap composed of 59 places in 254 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 69 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:56:53] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:56:53] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:56:53] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 4 ms to minimize.
[2024-05-23 16:56:54] [INFO ] Deduced a trap composed of 79 places in 238 ms of which 4 ms to minimize.
[2024-05-23 16:56:54] [INFO ] Deduced a trap composed of 73 places in 250 ms of which 3 ms to minimize.
[2024-05-23 16:56:54] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:56:55] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 3 ms to minimize.
[2024-05-23 16:56:55] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 4 ms to minimize.
[2024-05-23 16:56:56] [INFO ] Deduced a trap composed of 61 places in 272 ms of which 5 ms to minimize.
[2024-05-23 16:56:56] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 5 ms to minimize.
[2024-05-23 16:56:56] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 4 ms to minimize.
[2024-05-23 16:56:56] [INFO ] Deduced a trap composed of 72 places in 236 ms of which 3 ms to minimize.
[2024-05-23 16:56:57] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:56:57] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 5 ms to minimize.
[2024-05-23 16:56:57] [INFO ] Deduced a trap composed of 48 places in 290 ms of which 4 ms to minimize.
[2024-05-23 16:56:58] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:56:58] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 4 ms to minimize.
[2024-05-23 16:57:06] [INFO ] Deduced a trap composed of 84 places in 339 ms of which 4 ms to minimize.
[2024-05-23 16:57:06] [INFO ] Deduced a trap composed of 63 places in 281 ms of which 4 ms to minimize.
[2024-05-23 16:57:07] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 16:57:09] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 3 ms to minimize.
[2024-05-23 16:57:09] [INFO ] Deduced a trap composed of 93 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:57:09] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 3 ms to minimize.
[2024-05-23 16:57:09] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 3 ms to minimize.
[2024-05-23 16:57:09] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 4 ms to minimize.
[2024-05-23 16:57:10] [INFO ] Deduced a trap composed of 62 places in 263 ms of which 4 ms to minimize.
[2024-05-23 16:57:10] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 3 ms to minimize.
[2024-05-23 16:57:10] [INFO ] Deduced a trap composed of 83 places in 226 ms of which 4 ms to minimize.
[2024-05-23 16:57:11] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:57:11] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:57:11] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 3 ms to minimize.
[2024-05-23 16:57:12] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 4 ms to minimize.
[2024-05-23 16:57:14] [INFO ] Deduced a trap composed of 75 places in 307 ms of which 4 ms to minimize.
[2024-05-23 16:57:15] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 4 ms to minimize.
[2024-05-23 16:57:15] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 4 ms to minimize.
[2024-05-23 16:57:19] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 4 ms to minimize.
[2024-05-23 16:57:19] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/640 variables, and 106 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/695 constraints, Known Traps: 90/90 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61723 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 260 ms.
Product exploration explored 100000 steps with 0 reset in 347 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 (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 225 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 722388 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 1
Probabilistic random walk after 722388 steps, saw 249530 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2024-05-23 16:57:24] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 16:57:24] [INFO ] Invariant cache hit.
[2024-05-23 16:57:24] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/113 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 170/283 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 24/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/331 variables, 21/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 10/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 135/466 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/472 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/640 variables, 141/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 82/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/640 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/640 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 275/275 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:57:25] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/113 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:57:25] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 170/283 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 24/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/331 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 135/466 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/472 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:57:25] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
[2024-05-23 16:57:26] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 168/640 variables, 141/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/640 variables, 82/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/640 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/640 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 275/275 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1394ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 270 transition count 615
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 190 transition count 615
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 170 transition count 595
Applied a total of 210 rules in 55 ms. Remains 170 /275 variables (removed 105) and now considering 595/700 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 170/275 places, 595/700 transitions.
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 778728 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 778728 steps, saw 150299 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-05-23 16:57:29] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-23 16:57:29] [INFO ] Computed 16 invariants in 5 ms
[2024-05-23 16:57:29] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:57:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:57:30] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:57:30] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:57:30] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:57:30] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:57:30] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-23 16:57:30] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1517ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 16:57:31] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 16:57:31] [INFO ] Invariant cache hit.
[2024-05-23 16:57:31] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-23 16:57:31] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 16:57:31] [INFO ] Invariant cache hit.
[2024-05-23 16:57:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 16:57:31] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2024-05-23 16:57:31] [INFO ] Redundant transitions in 5 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 16:57:31] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 16:57:31] [INFO ] Invariant cache hit.
[2024-05-23 16:57:31] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:57:36] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:57:36] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:57:36] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:57:36] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 16:57:36] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:57:37] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:57:37] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:57:37] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:57:37] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:57:37] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:57:38] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 3 ms to minimize.
[2024-05-23 16:57:38] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:57:38] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:57:38] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:57:39] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:57:39] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 2 ms to minimize.
[2024-05-23 16:57:39] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:57:39] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-05-23 16:57:39] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:57:39] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:57:40] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:57:41] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:57:41] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:57:41] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:57:41] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:57:41] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:57:42] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:57:42] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:57:42] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:57:42] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:57:42] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:57:42] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:57:43] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:57:43] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:57:43] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 2 ms to minimize.
[2024-05-23 16:57:43] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:57:44] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:57:44] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:57:44] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:57:44] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:57:50] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:57:50] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
[2024-05-23 16:57:50] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-23 16:57:50] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:57:50] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:57:50] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:57:51] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:57:51] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:57:51] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 2 ms to minimize.
[2024-05-23 16:57:51] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:57:52] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:57:52] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 2 ms to minimize.
[2024-05-23 16:57:52] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:57:52] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 2 ms to minimize.
[2024-05-23 16:57:52] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:57:53] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 4 ms to minimize.
[2024-05-23 16:57:53] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:57:53] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:57:53] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 3 ms to minimize.
[2024-05-23 16:57:53] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:57:55] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
[2024-05-23 16:57:55] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:57:56] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:57:56] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:57:56] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-05-23 16:57:57] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:57:57] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 2 ms to minimize.
[2024-05-23 16:57:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:57:58] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:57:58] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:57:58] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:57:58] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:57:59] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:57:59] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:57:59] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-23 16:57:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:57:59] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:58:00] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-23 16:58:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-23 16:58:00] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 96 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:58:07] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 2 ms to minimize.
[2024-05-23 16:58:07] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
[2024-05-23 16:58:07] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 2 ms to minimize.
[2024-05-23 16:58:07] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:58:08] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 3 ms to minimize.
[2024-05-23 16:58:10] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 2 ms to minimize.
[2024-05-23 16:58:10] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:58:13] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:58:13] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 2 ms to minimize.
[2024-05-23 16:58:15] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:58:15] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:58:15] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 3 ms to minimize.
[2024-05-23 16:58:15] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-05-23 16:58:16] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
[2024-05-23 16:58:16] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2024-05-23 16:58:16] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 3 ms to minimize.
[2024-05-23 16:58:18] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:58:18] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:58:18] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:58:18] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 13/116 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:58:21] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:58:21] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:58:22] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-05-23 16:58:22] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:58:22] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-05-23 16:58:23] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 2 ms to minimize.
[2024-05-23 16:58:23] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 3 ms to minimize.
[2024-05-23 16:58:23] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 3 ms to minimize.
[2024-05-23 16:58:23] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 3 ms to minimize.
[2024-05-23 16:58:25] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 2 ms to minimize.
[2024-05-23 16:58:25] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:58:25] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 4 ms to minimize.
[2024-05-23 16:58:25] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:58:26] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 3 ms to minimize.
[2024-05-23 16:58:26] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 3 ms to minimize.
[2024-05-23 16:58:28] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:58:28] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2024-05-23 16:58:28] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 18/134 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 134 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 118/118 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61073 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 41 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-23 16:58:32] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 16:58:32] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:58:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 16:58:32] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:58:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-23 16:58:32] [INFO ] After 16ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:58:32] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 16:58:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-05-23 16:58:32] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:58:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 2
[2024-05-23 16:58:32] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:58:32] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 411 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p2)]
Support contains 3 out of 275 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 171 transition count 596
Applied a total of 208 rules in 31 ms. Remains 171 /275 variables (removed 104) and now considering 596/700 (removed 104) transitions.
[2024-05-23 16:58:32] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-23 16:58:32] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 16:58:33] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-23 16:58:33] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 16:58:33] [INFO ] Invariant cache hit.
[2024-05-23 16:58:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 16:58:33] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2024-05-23 16:58:33] [INFO ] Redundant transitions in 8 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-23 16:58:33] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 16:58:33] [INFO ] Invariant cache hit.
[2024-05-23 16:58:33] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:58:38] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:58:39] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:58:39] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:58:39] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-05-23 16:58:39] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:58:39] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-23 16:58:39] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:58:39] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:58:39] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:58:40] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:58:40] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:58:40] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:58:41] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:58:41] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:58:41] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:58:41] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:58:41] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-23 16:58:41] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:58:42] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:58:42] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:58:42] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:58:42] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:58:42] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:58:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-23 16:58:42] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:58:43] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:58:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-23 16:58:43] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:58:43] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-23 16:58:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:58:43] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:58:44] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:58:49] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:58:49] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:58:50] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:58:50] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:58:50] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:58:50] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:58:50] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:58:50] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2024-05-23 16:58:50] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2024-05-23 16:58:51] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:58:52] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:58:55] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:58:58] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:58:59] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 70 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:59:07] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:59:07] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:59:07] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:59:07] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:59:07] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:59:07] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:59:08] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:59:08] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:59:08] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:59:08] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:59:09] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:59:09] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:59:09] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 2 ms to minimize.
[2024-05-23 16:59:09] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:59:10] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:59:10] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:59:10] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:59:13] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:59:13] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:59:13] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:59:13] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:59:13] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2024-05-23 16:59:13] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-05-23 16:59:14] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:59:14] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-23 16:59:14] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:59:14] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:59:14] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:59:14] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:59:16] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:59:16] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:59:17] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:59:17] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:59:17] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:59:18] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:59:18] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-23 16:59:19] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:59:19] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2024-05-23 16:59:19] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:59:19] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:59:19] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:59:19] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:59:19] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:59:20] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:59:20] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:59:20] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:59:20] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:59:20] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-05-23 16:59:20] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:59:23] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:59:24] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-23 16:59:24] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:59:25] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:59:26] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:59:26] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:59:26] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-05-23 16:59:26] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:59:26] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 16:59:30] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2024-05-23 16:59:30] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:59:30] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:59:30] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:59:30] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:59:31] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:59:32] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:59:32] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:59:32] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-23 16:59:32] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 10/138 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 138 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 122/122 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60457ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61421 ms. Remains : 171/275 places, 596/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 880992 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 1
Probabilistic random walk after 880992 steps, saw 168670 distinct states, run finished after 3004 ms. (steps per millisecond=293 ) properties seen :0
[2024-05-23 16:59:37] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 16:59:37] [INFO ] Invariant cache hit.
[2024-05-23 16:59:37] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:59:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:59:38] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:59:38] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:59:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 16:59:38] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/432 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 919ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 23 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 879588 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 1
Probabilistic random walk after 879588 steps, saw 167879 distinct states, run finished after 3004 ms. (steps per millisecond=292 ) properties seen :0
[2024-05-23 16:59:41] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-23 16:59:41] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 16:59:41] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:59:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:59:41] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:59:42] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:59:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 16:59:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/430 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 756ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 16:59:42] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 16:59:42] [INFO ] Invariant cache hit.
[2024-05-23 16:59:42] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-23 16:59:42] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 16:59:42] [INFO ] Invariant cache hit.
[2024-05-23 16:59:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 16:59:43] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2024-05-23 16:59:43] [INFO ] Redundant transitions in 4 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 16:59:43] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 16:59:43] [INFO ] Invariant cache hit.
[2024-05-23 16:59:43] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:59:46] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:59:46] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:59:46] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:59:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 16:59:46] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:59:46] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:59:47] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:59:47] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 3 ms to minimize.
[2024-05-23 16:59:47] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 3 ms to minimize.
[2024-05-23 16:59:47] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:59:47] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-05-23 16:59:47] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:59:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 16:59:48] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:59:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:59:48] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:59:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 16:59:48] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:59:48] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:59:48] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:59:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-23 16:59:50] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:59:51] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:59:51] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:59:51] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:59:51] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:59:51] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:59:51] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2024-05-23 16:59:51] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 2 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:59:52] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:59:53] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:59:53] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 16:59:56] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:59:56] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:59:56] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:59:57] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-23 16:59:57] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:59:57] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:59:57] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:59:57] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:59:58] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:59:58] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:59:58] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-05-23 16:59:59] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:59:59] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
[2024-05-23 16:59:59] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:59:59] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:59:59] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:59:59] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:00:00] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:01] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-05-23 17:00:02] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:00:02] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:00:02] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:00:02] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:00:02] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:00:03] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:00:03] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-23 17:00:03] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-23 17:00:03] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:06] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-05-23 17:00:08] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-23 17:00:08] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:00:08] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:00:08] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:00:09] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:00:09] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 91 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 75/91 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:15] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:00:15] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-23 17:00:15] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-23 17:00:16] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-23 17:00:16] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2024-05-23 17:00:17] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:00:17] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:00:17] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:00:18] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:00:18] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:00:18] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:00:19] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2024-05-23 17:00:19] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:00:19] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:00:19] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:00:20] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:00:20] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:22] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:00:22] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:00:22] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:00:22] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:00:23] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:00:23] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:00:23] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:00:23] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:00:24] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:00:24] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:26] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-23 17:00:27] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:00:27] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:00:27] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:00:27] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:00:28] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:00:28] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2024-05-23 17:00:28] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-05-23 17:00:28] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:00:28] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:00:29] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:00:29] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:00:29] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-23 17:00:29] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-23 17:00:29] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 3 ms to minimize.
[2024-05-23 17:00:29] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:00:29] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:00:30] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:00:30] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:00:31] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:33] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:00:33] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:00:34] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:00:34] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 4 ms to minimize.
[2024-05-23 17:00:34] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 1 ms to minimize.
[2024-05-23 17:00:34] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:00:34] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 1 ms to minimize.
[2024-05-23 17:00:34] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2024-05-23 17:00:34] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:00:35] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:00:35] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:00:35] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:00:35] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:00:36] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:00:36] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:00:37] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 1 ms to minimize.
[2024-05-23 17:00:37] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:00:37] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:00:38] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:00:39] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:41] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:00:41] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-23 17:00:41] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-23 17:00:41] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:00:42] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:00:42] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:00:42] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:00:42] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 1 ms to minimize.
[2024-05-23 17:00:42] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 167 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 151/151 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61234 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 27 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-23 17:00:43] [INFO ] Computed 11 invariants in 1 ms
[2024-05-23 17:00:43] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:00:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 17:00:43] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:00:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-23 17:00:43] [INFO ] After 15ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 17:00:43] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 17:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
TRAPS : Iteration 1
[2024-05-23 17:00:43] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-23 17:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 2
[2024-05-23 17:00:43] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:00:43] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 322 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 407 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 23 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
[2024-05-23 17:00:44] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-23 17:00:44] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 17:00:45] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-23 17:00:45] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:00:45] [INFO ] Invariant cache hit.
[2024-05-23 17:00:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:00:45] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2024-05-23 17:00:45] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 17:00:45] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:00:45] [INFO ] Invariant cache hit.
[2024-05-23 17:00:45] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:49] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:00:49] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-23 17:00:49] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-23 17:00:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 17:00:49] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:00:50] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:00:50] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:00:50] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:00:50] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:00:51] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:00:51] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:00:51] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:00:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 17:00:51] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-23 17:00:51] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-23 17:00:51] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:00:51] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 17:00:52] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:00:52] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-23 17:00:52] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:53] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-23 17:00:54] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:00:54] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:00:54] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:00:54] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:00:54] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2024-05-23 17:00:54] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-23 17:00:55] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:00:56] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:00:56] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:00:56] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:00:59] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-23 17:00:59] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 1 ms to minimize.
[2024-05-23 17:01:00] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:01:00] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:01:00] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:01:00] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:01:00] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-23 17:01:00] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-23 17:01:01] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
[2024-05-23 17:01:01] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:01:01] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-05-23 17:01:02] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:01:02] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2024-05-23 17:01:02] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:01:02] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:01:02] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:01:02] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:01:02] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:01:04] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:01:04] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:01:04] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:01:05] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:01:05] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:01:05] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:01:05] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-23 17:01:06] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:01:06] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:01:06] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:01:09] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-23 17:01:10] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2024-05-23 17:01:10] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 1 ms to minimize.
[2024-05-23 17:01:11] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-23 17:01:11] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:01:11] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:01:11] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 91 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 75/91 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:01:18] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 2 ms to minimize.
[2024-05-23 17:01:18] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2024-05-23 17:01:18] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2024-05-23 17:01:18] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:01:19] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:01:20] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:01:20] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:01:20] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:01:20] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:01:21] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 2 ms to minimize.
[2024-05-23 17:01:21] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:01:21] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-05-23 17:01:21] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-05-23 17:01:22] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 2 ms to minimize.
[2024-05-23 17:01:22] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:01:22] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:01:23] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:01:24] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:01:25] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-23 17:01:25] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:01:25] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-05-23 17:01:26] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:01:26] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:01:26] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-05-23 17:01:26] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:01:27] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:01:27] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:01:29] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-05-23 17:01:29] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:01:29] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:01:30] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:01:30] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:01:30] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 2 ms to minimize.
[2024-05-23 17:01:31] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2024-05-23 17:01:31] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:01:31] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:01:31] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:01:31] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:01:31] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:01:31] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:01:32] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:01:32] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:01:32] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:01:32] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:01:32] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:01:33] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:01:34] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:01:35] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:01:35] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:01:36] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:01:37] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:01:37] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:01:38] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:01:38] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:01:38] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:01:38] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:01:38] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:01:39] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:01:40] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:01:41] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:01:42] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:01:42] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-23 17:01:42] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:01:42] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:01:43] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:01:43] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:01:43] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:01:43] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 1 ms to minimize.
[2024-05-23 17:01:44] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:01:44] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:01:44] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-23 17:01:44] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:01:45] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-23 17:01:45] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:01:45] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:01:45] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 175 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 159/159 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/171 places, 595/596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61306 ms. Remains : 170/171 places, 595/596 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-06 finished in 327281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!F(X(p1)) U p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 277 transition count 710
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 277 transition count 710
Applied a total of 6 rules in 7 ms. Remains 277 /280 variables (removed 3) and now considering 710/725 (removed 15) transitions.
[2024-05-23 17:01:46] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-05-23 17:01:46] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 17:01:46] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-23 17:01:46] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:01:46] [INFO ] Invariant cache hit.
[2024-05-23 17:01:46] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-23 17:01:47] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-05-23 17:01:47] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:01:47] [INFO ] Invariant cache hit.
[2024-05-23 17:01:47] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:01:53] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:01:54] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:01:54] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:01:54] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-23 17:01:54] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:01:54] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-23 17:01:54] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:01:55] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:01:55] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 3 ms to minimize.
[2024-05-23 17:01:55] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:01:55] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:01:55] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:01:56] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 3 ms to minimize.
[2024-05-23 17:01:56] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:01:56] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:01:56] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:01:56] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:01:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-23 17:01:57] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:01:57] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:01:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:01:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 17:01:57] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:01:58] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:01:58] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:01:58] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-05-23 17:01:59] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-23 17:01:59] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:01:59] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 3 ms to minimize.
[2024-05-23 17:01:59] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:02:00] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2024-05-23 17:02:00] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-23 17:02:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 17:02:00] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-23 17:02:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-23 17:02:00] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 17:02:01] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:02:01] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:02:01] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:02:01] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:02:07] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:02:08] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:02:08] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:02:09] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:02:09] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:02:09] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:02:09] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:02:09] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2024-05-23 17:02:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 17:02:12] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
[2024-05-23 17:02:12] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:02:13] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2024-05-23 17:02:13] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 2 ms to minimize.
[2024-05-23 17:02:13] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:02:13] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 3 ms to minimize.
[2024-05-23 17:02:13] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:02:14] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 2 ms to minimize.
[2024-05-23 17:02:14] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:02:14] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:02:15] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:02:15] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:02:17] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:02:17] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/652 variables, and 79 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:02:19] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:02:20] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:02:21] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 4 ms to minimize.
[2024-05-23 17:02:23] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 2 ms to minimize.
[2024-05-23 17:02:23] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 3 ms to minimize.
[2024-05-23 17:02:24] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:02:24] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:02:24] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:02:24] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:02:25] [INFO ] Deduced a trap composed of 69 places in 238 ms of which 4 ms to minimize.
[2024-05-23 17:02:25] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 2 ms to minimize.
[2024-05-23 17:02:25] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-23 17:02:26] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:02:26] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:02:27] [INFO ] Deduced a trap composed of 93 places in 268 ms of which 5 ms to minimize.
[2024-05-23 17:02:27] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:02:28] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 3 ms to minimize.
[2024-05-23 17:02:28] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:02:28] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
[2024-05-23 17:02:29] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:02:30] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:02:30] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:02:30] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:02:30] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2024-05-23 17:02:31] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:02:31] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:02:31] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:02:31] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:02:31] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 3 ms to minimize.
[2024-05-23 17:02:31] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:02:32] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 2 ms to minimize.
[2024-05-23 17:02:32] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
[2024-05-23 17:02:32] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:02:33] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:02:33] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:02:35] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 3 ms to minimize.
[2024-05-23 17:02:35] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:02:35] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:02:35] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:02:35] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:02:38] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 2 ms to minimize.
[2024-05-23 17:02:40] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 2 ms to minimize.
[2024-05-23 17:02:40] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:02:41] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:02:41] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:02:41] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:02:41] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:02:41] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 2 ms to minimize.
[2024-05-23 17:02:42] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:02:42] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:02:42] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:02:42] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:02:43] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:02:43] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:02:43] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:02:43] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:02:43] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:02:44] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:02:46] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 2 ms to minimize.
[2024-05-23 17:02:46] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:02:47] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:02:47] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 2 ms to minimize.
[2024-05-23 17:02:47] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:02:47] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 3 ms to minimize.
(s54 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/652 variables, and 143 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/705 constraints, Known Traps: 127/127 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 710/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61744 ms. Remains : 277/280 places, 710/725 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 33303 reset in 302 ms.
Product exploration explored 100000 steps with 33340 reset in 385 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 (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 179 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 407 ms. (98 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 583 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
[2024-05-23 17:02:49] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:02:49] [INFO ] Invariant cache hit.
[2024-05-23 17:02:49] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 90/536 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/540 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 112/652 variables, 94/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 63/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 90/536 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/540 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 112/652 variables, 94/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 63/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:02:50] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/652 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1274ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 476 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 173 transition count 606
Applied a total of 208 rules in 30 ms. Remains 173 /277 variables (removed 104) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 173/277 places, 606/710 transitions.
RANDOM walk for 40000 steps (8 resets) in 850 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 139660 steps, run visited all 2 properties in 852 ms. (steps per millisecond=163 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 867 ms. (steps per millisecond=161 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 537 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Applied a total of 0 rules in 3 ms. Remains 277 /277 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-05-23 17:02:53] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:02:53] [INFO ] Invariant cache hit.
[2024-05-23 17:02:54] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-23 17:02:54] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:02:54] [INFO ] Invariant cache hit.
[2024-05-23 17:02:54] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-23 17:02:55] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-05-23 17:02:55] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:02:55] [INFO ] Invariant cache hit.
[2024-05-23 17:02:55] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:03:01] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-05-23 17:03:01] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:03:01] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:03:01] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:03:01] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 4 ms to minimize.
[2024-05-23 17:03:02] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 3 ms to minimize.
[2024-05-23 17:03:02] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-23 17:03:03] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 5 ms to minimize.
[2024-05-23 17:03:03] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 4 ms to minimize.
[2024-05-23 17:03:03] [INFO ] Deduced a trap composed of 88 places in 242 ms of which 4 ms to minimize.
[2024-05-23 17:03:03] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 3 ms to minimize.
[2024-05-23 17:03:04] [INFO ] Deduced a trap composed of 53 places in 261 ms of which 4 ms to minimize.
[2024-05-23 17:03:04] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 4 ms to minimize.
[2024-05-23 17:03:04] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 4 ms to minimize.
[2024-05-23 17:03:05] [INFO ] Deduced a trap composed of 76 places in 273 ms of which 4 ms to minimize.
[2024-05-23 17:03:05] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 4 ms to minimize.
[2024-05-23 17:03:05] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 3 ms to minimize.
[2024-05-23 17:03:05] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:03:06] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 4 ms to minimize.
[2024-05-23 17:03:06] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:03:06] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-23 17:03:06] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 17:03:07] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 4 ms to minimize.
[2024-05-23 17:03:07] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:03:08] [INFO ] Deduced a trap composed of 76 places in 292 ms of which 4 ms to minimize.
[2024-05-23 17:03:08] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 4 ms to minimize.
[2024-05-23 17:03:08] [INFO ] Deduced a trap composed of 83 places in 220 ms of which 4 ms to minimize.
[2024-05-23 17:03:09] [INFO ] Deduced a trap composed of 52 places in 231 ms of which 4 ms to minimize.
[2024-05-23 17:03:09] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 4 ms to minimize.
[2024-05-23 17:03:09] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 3 ms to minimize.
[2024-05-23 17:03:10] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 4 ms to minimize.
[2024-05-23 17:03:10] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 4 ms to minimize.
[2024-05-23 17:03:10] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 17:03:10] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:03:11] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-23 17:03:11] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-23 17:03:11] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 5 ms to minimize.
[2024-05-23 17:03:12] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 5 ms to minimize.
[2024-05-23 17:03:12] [INFO ] Deduced a trap composed of 76 places in 252 ms of which 4 ms to minimize.
[2024-05-23 17:03:12] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:03:20] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 5 ms to minimize.
[2024-05-23 17:03:20] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-05-23 17:03:21] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 4 ms to minimize.
[2024-05-23 17:03:21] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 4 ms to minimize.
[2024-05-23 17:03:22] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 4 ms to minimize.
[2024-05-23 17:03:22] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 4 ms to minimize.
[2024-05-23 17:03:22] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 3 ms to minimize.
[2024-05-23 17:03:23] [INFO ] Deduced a trap composed of 60 places in 258 ms of which 4 ms to minimize.
[2024-05-23 17:03:23] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/652 variables, and 65 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:03:27] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:03:27] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:03:28] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 4 ms to minimize.
[2024-05-23 17:03:28] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:03:29] [INFO ] Deduced a trap composed of 82 places in 264 ms of which 7 ms to minimize.
[2024-05-23 17:03:29] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 3 ms to minimize.
[2024-05-23 17:03:29] [INFO ] Deduced a trap composed of 50 places in 255 ms of which 4 ms to minimize.
[2024-05-23 17:03:29] [INFO ] Deduced a trap composed of 50 places in 241 ms of which 4 ms to minimize.
[2024-05-23 17:03:30] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 3 ms to minimize.
[2024-05-23 17:03:30] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:03:30] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:03:30] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 4 ms to minimize.
[2024-05-23 17:03:31] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 3 ms to minimize.
[2024-05-23 17:03:31] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 4 ms to minimize.
[2024-05-23 17:03:31] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 3 ms to minimize.
[2024-05-23 17:03:32] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 4 ms to minimize.
[2024-05-23 17:03:33] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 4 ms to minimize.
[2024-05-23 17:03:33] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 4 ms to minimize.
[2024-05-23 17:03:33] [INFO ] Deduced a trap composed of 57 places in 259 ms of which 4 ms to minimize.
[2024-05-23 17:03:33] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:03:36] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 4 ms to minimize.
[2024-05-23 17:03:36] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:03:36] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:03:39] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 4 ms to minimize.
[2024-05-23 17:03:39] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 5 ms to minimize.
[2024-05-23 17:03:39] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 4 ms to minimize.
[2024-05-23 17:03:40] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 4 ms to minimize.
[2024-05-23 17:03:40] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 4 ms to minimize.
[2024-05-23 17:03:40] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 4 ms to minimize.
[2024-05-23 17:03:40] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 4 ms to minimize.
[2024-05-23 17:03:41] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 4 ms to minimize.
[2024-05-23 17:03:41] [INFO ] Deduced a trap composed of 53 places in 239 ms of which 5 ms to minimize.
[2024-05-23 17:03:41] [INFO ] Deduced a trap composed of 75 places in 302 ms of which 6 ms to minimize.
[2024-05-23 17:03:42] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 4 ms to minimize.
[2024-05-23 17:03:42] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 4 ms to minimize.
[2024-05-23 17:03:42] [INFO ] Deduced a trap composed of 70 places in 244 ms of which 4 ms to minimize.
[2024-05-23 17:03:43] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 4 ms to minimize.
[2024-05-23 17:03:43] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 4 ms to minimize.
[2024-05-23 17:03:43] [INFO ] Deduced a trap composed of 94 places in 291 ms of which 4 ms to minimize.
[2024-05-23 17:03:44] [INFO ] Deduced a trap composed of 97 places in 279 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:03:47] [INFO ] Deduced a trap composed of 61 places in 295 ms of which 5 ms to minimize.
[2024-05-23 17:03:47] [INFO ] Deduced a trap composed of 76 places in 297 ms of which 4 ms to minimize.
[2024-05-23 17:03:49] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 4 ms to minimize.
[2024-05-23 17:03:53] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-23 17:03:54] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 3 ms to minimize.
[2024-05-23 17:03:54] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 4 ms to minimize.
[2024-05-23 17:03:55] [INFO ] Deduced a trap composed of 57 places in 293 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/652 variables, and 112 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/705 constraints, Known Traps: 96/96 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Finished structural reductions in LTL mode , in 1 iterations and 61740 ms. Remains : 277/277 places, 710/710 transitions.
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 (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 213 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 1861 ms. (21 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
[2024-05-23 17:03:56] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:03:56] [INFO ] Invariant cache hit.
[2024-05-23 17:03:56] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 90/536 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/540 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 112/652 variables, 94/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 63/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 90/536 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/540 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 112/652 variables, 94/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 63/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:03:57] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/652 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1284ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 816 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 173 transition count 606
Applied a total of 208 rules in 40 ms. Remains 173 /277 variables (removed 104) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 173/277 places, 606/710 transitions.
RANDOM walk for 40000 steps (8 resets) in 892 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 139660 steps, run visited all 2 properties in 694 ms. (steps per millisecond=201 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 694 ms. (steps per millisecond=201 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 505 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 33382 reset in 359 ms.
Product exploration explored 100000 steps with 33352 reset in 453 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 710
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 5 place count 277 transition count 818
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 79 place count 277 transition count 818
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 104 place count 277 transition count 818
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 272 transition count 813
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 272 transition count 813
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 114 rules in 57 ms. Remains 272 /277 variables (removed 5) and now considering 813/710 (removed -103) transitions.
[2024-05-23 17:04:02] [INFO ] Redundant transitions in 9 ms returned []
Running 808 sub problems to find dead transitions.
[2024-05-23 17:04:02] [INFO ] Flow matrix only has 424 transitions (discarded 389 similar events)
// Phase 1: matrix 424 rows 272 cols
[2024-05-23 17:04:02] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 17:04:02] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-23 17:04:10] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:04:10] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:04:11] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:04:11] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-23 17:04:11] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-23 17:04:11] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-23 17:04:11] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-23 17:04:11] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-23 17:04:12] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 4 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-05-23 17:04:12] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
[2024-05-23 17:04:12] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
[2024-05-23 17:04:12] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-05-23 17:04:12] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
[2024-05-23 17:04:12] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
[2024-05-23 17:04:13] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 4 ms to minimize.
[2024-05-23 17:04:13] [INFO ] Deduced a trap composed of 56 places in 297 ms of which 5 ms to minimize.
[2024-05-23 17:04:13] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 5 ms to minimize.
[2024-05-23 17:04:14] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 4 ms to minimize.
[2024-05-23 17:04:14] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 5 ms to minimize.
[2024-05-23 17:04:14] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/36 constraints. Problems are: Problem set: 207 solved, 601 unsolved
[2024-05-23 17:04:15] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 4 ms to minimize.
[2024-05-23 17:04:16] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:04:16] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:04:16] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 3 ms to minimize.
[2024-05-23 17:04:17] [INFO ] Deduced a trap composed of 46 places in 271 ms of which 4 ms to minimize.
[2024-05-23 17:04:17] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 4 ms to minimize.
[2024-05-23 17:04:17] [INFO ] Deduced a trap composed of 46 places in 336 ms of which 5 ms to minimize.
[2024-05-23 17:04:18] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 4 ms to minimize.
[2024-05-23 17:04:18] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 4 ms to minimize.
[2024-05-23 17:04:18] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 4 ms to minimize.
[2024-05-23 17:04:19] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 5 ms to minimize.
[2024-05-23 17:04:19] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 5 ms to minimize.
[2024-05-23 17:04:19] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 4 ms to minimize.
[2024-05-23 17:04:20] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 4 ms to minimize.
[2024-05-23 17:04:20] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 4 ms to minimize.
[2024-05-23 17:04:21] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 4 ms to minimize.
[2024-05-23 17:04:21] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 4 ms to minimize.
[2024-05-23 17:04:21] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 3 ms to minimize.
[2024-05-23 17:04:21] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 4 ms to minimize.
[2024-05-23 17:04:22] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 20/56 constraints. Problems are: Problem set: 207 solved, 601 unsolved
[2024-05-23 17:04:30] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 8 ms to minimize.
[2024-05-23 17:04:30] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 4 ms to minimize.
[2024-05-23 17:04:30] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 4 ms to minimize.
[2024-05-23 17:04:31] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 4 ms to minimize.
[2024-05-23 17:04:31] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 4 ms to minimize.
[2024-05-23 17:04:31] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 4 ms to minimize.
[2024-05-23 17:04:32] [INFO ] Deduced a trap composed of 41 places in 330 ms of which 4 ms to minimize.
[2024-05-23 17:04:32] [INFO ] Deduced a trap composed of 55 places in 297 ms of which 4 ms to minimize.
[2024-05-23 17:04:33] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 5 ms to minimize.
[2024-05-23 17:04:33] [INFO ] Deduced a trap composed of 35 places in 335 ms of which 4 ms to minimize.
SMT process timed out in 30734ms, After SMT, problems are : Problem set: 207 solved, 601 unsolved
Search for dead transitions found 207 dead transitions in 30743ms
Found 207 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 207 transitions
Dead transitions reduction (with SMT) removed 207 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 272/277 places, 606/710 transitions.
Graph (complete) has 1446 edges and 272 vertex of which 173 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.4 ms
Discarding 99 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 173 /272 variables (removed 99) and now considering 606/606 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 173/277 places, 606/710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30847 ms. Remains : 173/277 places, 606/710 transitions.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Applied a total of 0 rules in 6 ms. Remains 277 /277 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-05-23 17:04:33] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-05-23 17:04:33] [INFO ] Computed 16 invariants in 7 ms
[2024-05-23 17:04:33] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-23 17:04:33] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:04:33] [INFO ] Invariant cache hit.
[2024-05-23 17:04:34] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-23 17:04:35] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-05-23 17:04:35] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-23 17:04:35] [INFO ] Invariant cache hit.
[2024-05-23 17:04:35] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:04:42] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-23 17:04:42] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:04:42] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:04:43] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-05-23 17:04:43] [INFO ] Deduced a trap composed of 28 places in 225 ms of which 4 ms to minimize.
[2024-05-23 17:04:43] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
[2024-05-23 17:04:43] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-23 17:04:44] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 4 ms to minimize.
[2024-05-23 17:04:44] [INFO ] Deduced a trap composed of 52 places in 278 ms of which 4 ms to minimize.
[2024-05-23 17:04:45] [INFO ] Deduced a trap composed of 88 places in 247 ms of which 4 ms to minimize.
[2024-05-23 17:04:45] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 3 ms to minimize.
[2024-05-23 17:04:45] [INFO ] Deduced a trap composed of 53 places in 265 ms of which 4 ms to minimize.
[2024-05-23 17:04:46] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 4 ms to minimize.
[2024-05-23 17:04:46] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 4 ms to minimize.
[2024-05-23 17:04:46] [INFO ] Deduced a trap composed of 76 places in 277 ms of which 4 ms to minimize.
[2024-05-23 17:04:46] [INFO ] Deduced a trap composed of 71 places in 228 ms of which 3 ms to minimize.
[2024-05-23 17:04:47] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:04:47] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-23 17:04:47] [INFO ] Deduced a trap composed of 71 places in 254 ms of which 4 ms to minimize.
[2024-05-23 17:04:48] [INFO ] Deduced a trap composed of 68 places in 247 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:04:48] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-23 17:04:48] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 17:04:48] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 3 ms to minimize.
[2024-05-23 17:04:49] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:04:50] [INFO ] Deduced a trap composed of 76 places in 277 ms of which 5 ms to minimize.
[2024-05-23 17:04:50] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 4 ms to minimize.
[2024-05-23 17:04:50] [INFO ] Deduced a trap composed of 83 places in 229 ms of which 4 ms to minimize.
[2024-05-23 17:04:50] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 4 ms to minimize.
[2024-05-23 17:04:51] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 4 ms to minimize.
[2024-05-23 17:04:51] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 3 ms to minimize.
[2024-05-23 17:04:52] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 4 ms to minimize.
[2024-05-23 17:04:52] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 4 ms to minimize.
[2024-05-23 17:04:52] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-23 17:04:52] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:04:52] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 17:04:52] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 17:04:53] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 4 ms to minimize.
[2024-05-23 17:04:53] [INFO ] Deduced a trap composed of 68 places in 300 ms of which 4 ms to minimize.
[2024-05-23 17:04:54] [INFO ] Deduced a trap composed of 76 places in 240 ms of which 3 ms to minimize.
[2024-05-23 17:04:54] [INFO ] Deduced a trap composed of 76 places in 258 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-23 17:05:01] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 3 ms to minimize.
[2024-05-23 17:05:01] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:05:02] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-23 17:05:02] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:05:02] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 6 ms to minimize.
[2024-05-23 17:05:02] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:05:03] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:05:03] [INFO ] Deduced a trap composed of 60 places in 259 ms of which 4 ms to minimize.
[2024-05-23 17:05:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 17:05:05] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 2 ms to minimize.
SMT process timed out in 30419ms, After SMT, problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 30431ms
Finished structural reductions in LTL mode , in 1 iterations and 32134 ms. Remains : 277/277 places, 710/710 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-07 finished in 199342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 37 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-23 17:05:05] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-23 17:05:05] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 17:05:05] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 17:05:05] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:05:05] [INFO ] Invariant cache hit.
[2024-05-23 17:05:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:05:06] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2024-05-23 17:05:06] [INFO ] Redundant transitions in 5 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-23 17:05:06] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:05:06] [INFO ] Invariant cache hit.
[2024-05-23 17:05:06] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:05:11] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 3 ms to minimize.
[2024-05-23 17:05:11] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-23 17:05:11] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-23 17:05:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 17:05:11] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:05:12] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-23 17:05:12] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:05:12] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 3 ms to minimize.
[2024-05-23 17:05:13] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2024-05-23 17:05:13] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:05:13] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:05:13] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:05:13] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:05:14] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 2 ms to minimize.
[2024-05-23 17:05:14] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:05:14] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-23 17:05:14] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:05:14] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:05:15] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:05:15] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:05:16] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:05:17] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
[2024-05-23 17:05:17] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:05:18] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-23 17:05:18] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:05:19] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:05:19] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:05:19] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:05:19] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:05:20] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 2 ms to minimize.
[2024-05-23 17:05:20] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-23 17:05:20] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-23 17:05:20] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2024-05-23 17:05:21] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-23 17:05:21] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:05:21] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 2 ms to minimize.
[2024-05-23 17:05:21] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 2 ms to minimize.
[2024-05-23 17:05:21] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2024-05-23 17:05:22] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2024-05-23 17:05:22] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:05:28] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:05:29] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2024-05-23 17:05:30] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:05:30] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:05:30] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:05:30] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:05:30] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 3 ms to minimize.
[2024-05-23 17:05:31] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:05:31] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:05:31] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 2 ms to minimize.
[2024-05-23 17:05:31] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:05:35] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:05:36] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:05:36] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 2 ms to minimize.
[2024-05-23 17:05:36] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
SMT process timed out in 30344ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30350ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31301 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 251 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 6 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-09 finished in 31646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 275 transition count 640
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 195 transition count 640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 191 transition count 620
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 600
Applied a total of 218 rules in 55 ms. Remains 171 /280 variables (removed 109) and now considering 600/725 (removed 125) transitions.
[2024-05-23 17:05:37] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2024-05-23 17:05:37] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 17:05:37] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-23 17:05:37] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-23 17:05:37] [INFO ] Invariant cache hit.
[2024-05-23 17:05:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-23 17:05:38] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2024-05-23 17:05:38] [INFO ] Redundant transitions in 7 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-23 17:05:38] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-23 17:05:38] [INFO ] Invariant cache hit.
[2024-05-23 17:05:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:05:43] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:05:43] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-23 17:05:43] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 17:05:43] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:05:44] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:05:44] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-05-23 17:05:44] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:05:44] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 3 ms to minimize.
[2024-05-23 17:05:45] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 3 ms to minimize.
[2024-05-23 17:05:45] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 3 ms to minimize.
[2024-05-23 17:05:45] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-05-23 17:05:45] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:05:45] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-23 17:05:45] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-23 17:05:46] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:05:46] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:05:46] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:05:46] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:05:46] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 2 ms to minimize.
[2024-05-23 17:05:47] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:05:47] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 17:05:48] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 3 ms to minimize.
[2024-05-23 17:05:48] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2024-05-23 17:05:48] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:05:48] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-23 17:05:49] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:05:49] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:05:49] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:05:49] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-05-23 17:05:50] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:05:50] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:05:50] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:05:50] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:05:51] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:05:51] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-05-23 17:05:51] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:05:51] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-05-23 17:05:52] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 2 ms to minimize.
[2024-05-23 17:05:52] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-05-23 17:05:52] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:05:57] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:05:57] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:05:57] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:05:58] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 2 ms to minimize.
[2024-05-23 17:05:58] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:05:59] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:05:59] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:05:59] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:05:59] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:06:00] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:06:00] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-23 17:06:00] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:06:00] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:06:00] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:06:01] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:06:01] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 3 ms to minimize.
[2024-05-23 17:06:01] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 3 ms to minimize.
[2024-05-23 17:06:01] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
[2024-05-23 17:06:02] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-23 17:06:02] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:06:06] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-05-23 17:06:06] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-05-23 17:06:06] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-05-23 17:06:06] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-05-23 17:06:07] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:06:07] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-05-23 17:06:07] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:06:07] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 3 ms to minimize.
[2024-05-23 17:06:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-23 17:06:08] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:06:08] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 3 ms to minimize.
[2024-05-23 17:06:08] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 3 ms to minimize.
[2024-05-23 17:06:08] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 2 ms to minimize.
[2024-05-23 17:06:09] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
SMT process timed out in 30449ms, After SMT, problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 30459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 600/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31802 ms. Remains : 171/280 places, 600/725 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 267 ms.
Product exploration explored 100000 steps with 0 reset in 289 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2024-05-23 17:06:10] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-23 17:06:10] [INFO ] Invariant cache hit.
[2024-05-23 17:06:10] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/68 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/98 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/105 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 177/282 variables, 105/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 47/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 32/314 variables, 14/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 12/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/362 variables, 4/192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/366 variables, 2/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/436 variables, 52/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/436 variables, 61/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/436 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 307 constraints, problems are : Problem set: 1 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 17:06:10] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 22/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 15/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/320 variables, 6/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/326 variables, 3/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/326 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 17:06:10] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:06:10] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2024-05-23 17:06:11] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-23 17:06:11] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:06:11] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-23 17:06:11] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/326 variables, 6/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/436 variables, 79/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 83/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/436 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 315 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1424ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 41 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 11 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-10 finished in 34286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 275 transition count 640
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 195 transition count 640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 191 transition count 620
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 600
Applied a total of 218 rules in 42 ms. Remains 171 /280 variables (removed 109) and now considering 600/725 (removed 125) transitions.
[2024-05-23 17:06:11] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2024-05-23 17:06:11] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 17:06:12] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-23 17:06:12] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-23 17:06:12] [INFO ] Invariant cache hit.
[2024-05-23 17:06:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-23 17:06:12] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2024-05-23 17:06:12] [INFO ] Redundant transitions in 8 ms returned []
Running 595 sub problems to find dead transitions.
[2024-05-23 17:06:12] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-05-23 17:06:12] [INFO ] Invariant cache hit.
[2024-05-23 17:06:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:06:17] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 3 ms to minimize.
[2024-05-23 17:06:17] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-23 17:06:17] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-23 17:06:17] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 17:06:17] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-23 17:06:17] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:06:18] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-05-23 17:06:18] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:06:18] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:06:18] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:06:19] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-05-23 17:06:19] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:06:19] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-05-23 17:06:19] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-23 17:06:20] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-05-23 17:06:20] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 2 ms to minimize.
[2024-05-23 17:06:20] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:06:20] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:06:20] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 17:06:20] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:06:21] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 2 ms to minimize.
[2024-05-23 17:06:22] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:06:23] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
[2024-05-23 17:06:23] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:06:24] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:06:24] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2024-05-23 17:06:25] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:06:25] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:06:25] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-23 17:06:25] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-23 17:06:25] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 4 ms to minimize.
[2024-05-23 17:06:26] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 3 ms to minimize.
[2024-05-23 17:06:26] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-05-23 17:06:26] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2024-05-23 17:06:26] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-05-23 17:06:27] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-05-23 17:06:27] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 2 ms to minimize.
[2024-05-23 17:06:27] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:06:28] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-05-23 17:06:28] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:06:33] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-05-23 17:06:34] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-05-23 17:06:34] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-05-23 17:06:34] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:06:35] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 3 ms to minimize.
[2024-05-23 17:06:35] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2024-05-23 17:06:35] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:06:36] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:06:36] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:06:36] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2024-05-23 17:06:37] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 2 ms to minimize.
[2024-05-23 17:06:37] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2024-05-23 17:06:37] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:06:38] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 3 ms to minimize.
[2024-05-23 17:06:38] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 3 ms to minimize.
[2024-05-23 17:06:38] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:06:38] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-05-23 17:06:39] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 3 ms to minimize.
[2024-05-23 17:06:39] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:06:39] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:06:40] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:06:40] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:06:41] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2024-05-23 17:06:41] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 2 ms to minimize.
[2024-05-23 17:06:42] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 3 ms to minimize.
[2024-05-23 17:06:42] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-23 17:06:42] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 2 ms to minimize.
[2024-05-23 17:06:43] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/436 variables, and 84 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:06:45] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2024-05-23 17:06:46] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:06:46] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:06:46] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:06:47] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 8 ms to minimize.
[2024-05-23 17:06:48] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 2 ms to minimize.
[2024-05-23 17:06:50] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 4 ms to minimize.
[2024-05-23 17:06:51] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
[2024-05-23 17:06:51] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:06:54] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:06:54] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 3 ms to minimize.
[2024-05-23 17:06:54] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:06:54] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:06:55] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:06:55] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:06:55] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:06:55] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-05-23 17:06:55] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:06:56] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 3 ms to minimize.
[2024-05-23 17:06:56] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:06:56] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-05-23 17:06:57] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:06:57] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:06:57] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2024-05-23 17:06:57] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:06:58] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:06:59] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:06:59] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:07:00] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:07:03] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 3 ms to minimize.
[2024-05-23 17:07:03] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 3 ms to minimize.
[2024-05-23 17:07:04] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 3 ms to minimize.
[2024-05-23 17:07:04] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 3 ms to minimize.
[2024-05-23 17:07:04] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:07:04] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:07:05] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 4 ms to minimize.
[2024-05-23 17:07:05] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-05-23 17:07:06] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:07:06] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 3 ms to minimize.
[2024-05-23 17:07:06] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 3 ms to minimize.
[2024-05-23 17:07:07] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 3 ms to minimize.
[2024-05-23 17:07:07] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 4 ms to minimize.
[2024-05-23 17:07:08] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-05-23 17:07:11] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-23 17:07:12] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 2 ms to minimize.
[2024-05-23 17:07:12] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:07:12] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/436 variables, and 131 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/595 constraints, Known Traps: 115/115 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 600/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61651 ms. Remains : 171/280 places, 600/725 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-11
Product exploration explored 100000 steps with 9 reset in 240 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-11 finished in 61969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 45 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-23 17:07:13] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-23 17:07:13] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 17:07:13] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-23 17:07:13] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:07:13] [INFO ] Invariant cache hit.
[2024-05-23 17:07:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:07:14] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
[2024-05-23 17:07:14] [INFO ] Redundant transitions in 8 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-23 17:07:14] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:07:14] [INFO ] Invariant cache hit.
[2024-05-23 17:07:14] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:07:19] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:07:19] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-23 17:07:20] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-23 17:07:20] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 17:07:20] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:07:20] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:07:20] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:07:20] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:07:21] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-05-23 17:07:21] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:07:21] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 3 ms to minimize.
[2024-05-23 17:07:21] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:07:21] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-23 17:07:21] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:07:22] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
[2024-05-23 17:07:22] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:07:22] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:07:22] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2024-05-23 17:07:22] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-23 17:07:22] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:07:23] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 3 ms to minimize.
[2024-05-23 17:07:24] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:07:24] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:07:24] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:07:24] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-23 17:07:25] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-05-23 17:07:25] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:07:25] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 3 ms to minimize.
[2024-05-23 17:07:25] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-23 17:07:26] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:07:26] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:07:26] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:07:26] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-05-23 17:07:26] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:07:27] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:07:27] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:07:28] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:07:28] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 3 ms to minimize.
[2024-05-23 17:07:28] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2024-05-23 17:07:29] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:07:35] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:07:36] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-23 17:07:36] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-23 17:07:36] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 3 ms to minimize.
[2024-05-23 17:07:36] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-05-23 17:07:37] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-05-23 17:07:37] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:07:37] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:07:37] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:07:37] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:07:38] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:07:38] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 2 ms to minimize.
[2024-05-23 17:07:38] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-23 17:07:38] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:07:39] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 2 ms to minimize.
[2024-05-23 17:07:40] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:07:42] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:07:43] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:07:44] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 3 ms to minimize.
[2024-05-23 17:07:44] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 (/ 1.0 2.0))
(s9 0.0)
(s10 (/ 1.0 2.0))
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 (/ 1.0 2.0))
(s15 0.0)
(s16 (/ 1.0 2.0))
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 (/ 1.0 2.0))
(s22 0.0)
(s23 (/ 1.0 2.0))
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 76 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:07:47] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 2 ms to minimize.
[2024-05-23 17:07:47] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:07:48] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:07:48] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:07:49] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
[2024-05-23 17:07:49] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:07:50] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:07:50] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:07:50] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:07:51] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:07:52] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:07:52] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:07:52] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 2 ms to minimize.
[2024-05-23 17:07:53] [INFO ] Deduced a trap composed of 60 places in 225 ms of which 3 ms to minimize.
[2024-05-23 17:07:53] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:07:56] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2024-05-23 17:07:56] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 2 ms to minimize.
[2024-05-23 17:07:57] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:07:57] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:07:57] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-05-23 17:07:57] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:07:58] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2024-05-23 17:07:58] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-23 17:07:58] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:07:58] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2024-05-23 17:07:59] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:07:59] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:07:59] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-23 17:07:59] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2024-05-23 17:07:59] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 2 ms to minimize.
[2024-05-23 17:08:00] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:08:00] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-05-23 17:08:00] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:08:00] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-05-23 17:08:01] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:08:02] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-05-23 17:08:02] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
[2024-05-23 17:08:02] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:08:03] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:08:04] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:08:04] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:08:04] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:08:05] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 2 ms to minimize.
[2024-05-23 17:08:05] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 3 ms to minimize.
[2024-05-23 17:08:05] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:08:06] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 3 ms to minimize.
[2024-05-23 17:08:06] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 2 ms to minimize.
[2024-05-23 17:08:07] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:08:07] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:08:07] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:08:07] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:08:07] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:08:08] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:08:08] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 2 ms to minimize.
[2024-05-23 17:08:08] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:08:10] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:08:10] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:08:10] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 2 ms to minimize.
[2024-05-23 17:08:10] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:08:11] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:08:12] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:08:12] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:08:12] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 3 ms to minimize.
[2024-05-23 17:08:13] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:08:13] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:08:13] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:08:14] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 143 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 127/127 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61746 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 302 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-12 finished in 62132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (G(p1)||!p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 10 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-23 17:08:15] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-23 17:08:15] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 17:08:16] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-23 17:08:16] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:08:16] [INFO ] Invariant cache hit.
[2024-05-23 17:08:16] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:08:16] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-23 17:08:16] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:08:16] [INFO ] Invariant cache hit.
[2024-05-23 17:08:16] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:08:24] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:08:24] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:08:24] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 4 ms to minimize.
[2024-05-23 17:08:25] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 4 ms to minimize.
[2024-05-23 17:08:25] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 4 ms to minimize.
[2024-05-23 17:08:25] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 4 ms to minimize.
[2024-05-23 17:08:25] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 3 ms to minimize.
[2024-05-23 17:08:26] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 4 ms to minimize.
[2024-05-23 17:08:26] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 3 ms to minimize.
[2024-05-23 17:08:26] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:08:26] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 2 ms to minimize.
[2024-05-23 17:08:26] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-23 17:08:27] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
[2024-05-23 17:08:27] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:08:27] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 2 ms to minimize.
[2024-05-23 17:08:27] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
[2024-05-23 17:08:28] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:08:28] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:08:28] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:08:28] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:08:29] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-23 17:08:29] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
[2024-05-23 17:08:29] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 3 ms to minimize.
[2024-05-23 17:08:30] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 3 ms to minimize.
[2024-05-23 17:08:30] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:08:30] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:08:30] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-23 17:08:30] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:08:30] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:08:31] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:08:31] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:08:31] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2024-05-23 17:08:31] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:08:31] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:08:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 17:08:32] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 17:08:32] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 17:08:32] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 17:08:32] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:08:32] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:08:38] [INFO ] Deduced a trap composed of 77 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:08:38] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:08:38] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:08:38] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:08:39] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:08:39] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:08:39] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:08:39] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:08:39] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:08:40] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:08:40] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:08:40] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:08:40] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:08:41] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:08:41] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
[2024-05-23 17:08:43] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 2 ms to minimize.
[2024-05-23 17:08:43] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:08:43] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
[2024-05-23 17:08:43] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:08:43] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:08:45] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:08:45] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:08:46] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 79 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:08:49] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-23 17:08:49] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:08:49] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:08:50] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2024-05-23 17:08:51] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:08:52] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:08:52] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:08:52] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 3 ms to minimize.
[2024-05-23 17:08:52] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:08:52] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:08:53] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:08:54] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:08:54] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:08:54] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:08:55] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:08:56] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-23 17:08:57] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-23 17:08:58] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:08:58] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 2 ms to minimize.
[2024-05-23 17:08:58] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:08:59] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:08:59] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:09:00] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-05-23 17:09:05] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:09:05] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:09:06] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 3 ms to minimize.
[2024-05-23 17:09:06] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:09:06] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 2 ms to minimize.
[2024-05-23 17:09:06] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:09:07] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:09:07] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:09:08] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:09:09] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:09:09] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:09:10] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:09:10] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:09:10] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 2 ms to minimize.
[2024-05-23 17:09:11] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:09:12] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:09:13] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 2 ms to minimize.
[2024-05-23 17:09:13] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:09:13] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:09:13] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:09:14] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:09:14] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:09:14] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:09:15] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:09:16] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:09:16] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:09:16] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 2 ms to minimize.
[2024-05-23 17:09:17] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/640 variables, and 130 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/695 constraints, Known Traps: 114/114 constraints]
After SMT, in 60349ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61668 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-13 finished in 61828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 7 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-05-23 17:09:17] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:09:17] [INFO ] Invariant cache hit.
[2024-05-23 17:09:17] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-23 17:09:17] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:09:17] [INFO ] Invariant cache hit.
[2024-05-23 17:09:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:09:18] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-23 17:09:18] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:09:18] [INFO ] Invariant cache hit.
[2024-05-23 17:09:18] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:09:23] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:09:23] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:09:23] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:09:23] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:09:24] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-05-23 17:09:24] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:09:24] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:09:24] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:09:24] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:09:24] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:09:24] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:09:25] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-23 17:09:25] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:09:25] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:09:25] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:09:26] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:09:26] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:09:26] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 3 ms to minimize.
[2024-05-23 17:09:26] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 2 ms to minimize.
[2024-05-23 17:09:26] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:09:27] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:09:27] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-23 17:09:28] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:09:28] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:09:28] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:09:28] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:09:28] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-23 17:09:28] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:09:29] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:09:29] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:09:29] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:09:29] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:09:29] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 3 ms to minimize.
[2024-05-23 17:09:30] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:09:30] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 17:09:30] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 17:09:30] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 17:09:30] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 17:09:30] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:09:30] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:09:36] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:09:36] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 2 ms to minimize.
[2024-05-23 17:09:36] [INFO ] Deduced a trap composed of 71 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:09:36] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-05-23 17:09:36] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 2 ms to minimize.
[2024-05-23 17:09:36] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:09:37] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:09:37] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:09:37] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:09:37] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:09:38] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:09:38] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:09:38] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:09:39] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:09:39] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:09:40] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:09:41] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:09:41] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 4 ms to minimize.
[2024-05-23 17:09:41] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:09:41] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:09:42] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 3 ms to minimize.
[2024-05-23 17:09:43] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:09:43] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:09:45] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:09:45] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:09:45] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 2 ms to minimize.
[2024-05-23 17:09:45] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:09:46] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:09:46] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:09:46] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:09:46] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:09:46] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 2 ms to minimize.
[2024-05-23 17:09:46] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:09:47] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:09:48] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 91 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 75/91 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:09:51] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 3 ms to minimize.
[2024-05-23 17:09:51] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:09:51] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-05-23 17:09:52] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:09:52] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:09:53] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 2 ms to minimize.
[2024-05-23 17:09:54] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:09:54] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:09:55] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 2 ms to minimize.
[2024-05-23 17:09:55] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:09:55] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 2 ms to minimize.
[2024-05-23 17:09:56] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:09:56] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 2 ms to minimize.
[2024-05-23 17:09:56] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:09:57] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:09:57] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
[2024-05-23 17:09:57] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:09:57] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:09:58] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:09:58] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:10:00] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:10:00] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-05-23 17:10:00] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:10:00] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:10:00] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:10:01] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 2 ms to minimize.
[2024-05-23 17:10:06] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2024-05-23 17:10:06] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:10:07] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2024-05-23 17:10:07] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:10:07] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:10:07] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:10:08] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:10:08] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:10:08] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:10:08] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 3 ms to minimize.
[2024-05-23 17:10:08] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:10:09] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 18/129 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:10:11] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 3 ms to minimize.
[2024-05-23 17:10:11] [INFO ] Deduced a trap composed of 86 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:10:11] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:10:18] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:10:18] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 2 ms to minimize.
SMT process timed out in 60280ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61373 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 194 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 5 ms. (steps per millisecond=43 )
Probabilistic random walk after 218 steps, saw 184 distinct states, run finished after 5 ms. (steps per millisecond=43 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Applied a total of 0 rules in 4 ms. Remains 275 /275 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-23 17:10:19] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:10:19] [INFO ] Invariant cache hit.
[2024-05-23 17:10:20] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-23 17:10:20] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:10:20] [INFO ] Invariant cache hit.
[2024-05-23 17:10:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:10:21] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-23 17:10:21] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:10:21] [INFO ] Invariant cache hit.
[2024-05-23 17:10:21] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:10:26] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:10:26] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:10:26] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2024-05-23 17:10:26] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-05-23 17:10:26] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:10:26] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:10:27] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:10:27] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-23 17:10:27] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:10:27] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:10:27] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2024-05-23 17:10:27] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-23 17:10:28] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:10:28] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 3 ms to minimize.
[2024-05-23 17:10:28] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:10:28] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 2 ms to minimize.
[2024-05-23 17:10:29] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:10:29] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:10:29] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 2 ms to minimize.
[2024-05-23 17:10:29] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:10:30] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-23 17:10:30] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-23 17:10:30] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 2 ms to minimize.
[2024-05-23 17:10:31] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:10:31] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:10:31] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:10:31] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-23 17:10:31] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 2 ms to minimize.
[2024-05-23 17:10:31] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2024-05-23 17:10:32] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:10:32] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:10:32] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:10:32] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:10:32] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:10:32] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 17:10:33] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-23 17:10:33] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 17:10:33] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 17:10:33] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:10:33] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:10:39] [INFO ] Deduced a trap composed of 77 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:10:39] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:10:39] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 2 ms to minimize.
[2024-05-23 17:10:39] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 3 ms to minimize.
[2024-05-23 17:10:39] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 3 ms to minimize.
[2024-05-23 17:10:39] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:10:40] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:10:40] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:10:40] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-05-23 17:10:40] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:10:40] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:10:41] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:10:41] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:10:42] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:10:42] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 3 ms to minimize.
[2024-05-23 17:10:43] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:10:44] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:10:44] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:10:44] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:10:44] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:10:45] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 3 ms to minimize.
[2024-05-23 17:10:46] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:10:46] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:10:48] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 3 ms to minimize.
[2024-05-23 17:10:48] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:10:48] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:10:49] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:10:49] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:10:49] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:10:49] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:10:49] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:10:49] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 2 ms to minimize.
[2024-05-23 17:10:50] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:10:50] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 90 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:10:53] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:10:54] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:10:54] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:10:54] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:10:54] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:10:55] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:10:55] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:10:55] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 2 ms to minimize.
[2024-05-23 17:10:57] [INFO ] Deduced a trap composed of 110 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:10:57] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:10:57] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:10:57] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:10:58] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:10:58] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:10:58] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-23 17:10:59] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 2 ms to minimize.
[2024-05-23 17:10:59] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-23 17:11:00] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 2 ms to minimize.
[2024-05-23 17:11:00] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 2 ms to minimize.
[2024-05-23 17:11:01] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:11:01] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:11:01] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 3 ms to minimize.
[2024-05-23 17:11:01] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:11:03] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:11:03] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:11:05] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:11:05] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:11:06] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:11:06] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:11:06] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2024-05-23 17:11:06] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:11:06] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-23 17:11:07] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:11:07] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:11:07] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 3 ms to minimize.
[2024-05-23 17:11:07] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:11:08] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 2 ms to minimize.
[2024-05-23 17:11:08] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:11:08] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 3 ms to minimize.
[2024-05-23 17:11:08] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:11:09] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:11:10] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 3 ms to minimize.
[2024-05-23 17:11:10] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:11:10] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-05-23 17:11:10] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:11:10] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:11:11] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-23 17:11:11] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:11:11] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 2 ms to minimize.
[2024-05-23 17:11:11] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:11:12] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:11:16] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 4 ms to minimize.
[2024-05-23 17:11:16] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 4 ms to minimize.
[2024-05-23 17:11:16] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 4 ms to minimize.
[2024-05-23 17:11:17] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 5 ms to minimize.
[2024-05-23 17:11:17] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2024-05-23 17:11:18] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 4 ms to minimize.
[2024-05-23 17:11:18] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 4 ms to minimize.
[2024-05-23 17:11:18] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 4 ms to minimize.
[2024-05-23 17:11:19] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/640 variables, and 150 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/695 constraints, Known Traps: 134/134 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in LTL mode , in 1 iterations and 61436 ms. Remains : 275/275 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 8 ms. (steps per millisecond=27 )
Probabilistic random walk after 218 steps, saw 184 distinct states, run finished after 9 ms. (steps per millisecond=24 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 308 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 700
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 5 place count 275 transition count 808
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 79 place count 275 transition count 808
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 104 place count 275 transition count 808
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 270 transition count 803
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 270 transition count 803
Deduced a syphon composed of 99 places in 0 ms
Applied a total of 114 rules in 55 ms. Remains 270 /275 variables (removed 5) and now considering 803/700 (removed -103) transitions.
[2024-05-23 17:11:23] [INFO ] Redundant transitions in 14 ms returned []
Running 798 sub problems to find dead transitions.
[2024-05-23 17:11:23] [INFO ] Flow matrix only has 414 transitions (discarded 389 similar events)
// Phase 1: matrix 414 rows 270 cols
[2024-05-23 17:11:23] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 17:11:23] [INFO ] State equation strengthened by 184 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-23 17:11:32] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:11:32] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:11:32] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-23 17:11:32] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-23 17:11:32] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-23 17:11:32] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-23 17:11:32] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
[2024-05-23 17:11:33] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-23 17:11:34] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:11:34] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:11:34] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:11:34] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD801 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/36 constraints. Problems are: Problem set: 207 solved, 591 unsolved
[2024-05-23 17:11:36] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 4 ms to minimize.
[2024-05-23 17:11:36] [INFO ] Deduced a trap composed of 36 places in 285 ms of which 4 ms to minimize.
[2024-05-23 17:11:36] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 4 ms to minimize.
[2024-05-23 17:11:37] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 5 ms to minimize.
[2024-05-23 17:11:37] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 4 ms to minimize.
[2024-05-23 17:11:37] [INFO ] Deduced a trap composed of 16 places in 290 ms of which 4 ms to minimize.
[2024-05-23 17:11:38] [INFO ] Deduced a trap composed of 51 places in 294 ms of which 5 ms to minimize.
[2024-05-23 17:11:38] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 3 ms to minimize.
[2024-05-23 17:11:38] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 4 ms to minimize.
[2024-05-23 17:11:39] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 3 ms to minimize.
[2024-05-23 17:11:39] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 4 ms to minimize.
[2024-05-23 17:11:39] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 4 ms to minimize.
[2024-05-23 17:11:40] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 4 ms to minimize.
[2024-05-23 17:11:40] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 4 ms to minimize.
[2024-05-23 17:11:40] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 4 ms to minimize.
[2024-05-23 17:11:41] [INFO ] Deduced a trap composed of 44 places in 308 ms of which 4 ms to minimize.
[2024-05-23 17:11:41] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 4 ms to minimize.
[2024-05-23 17:11:41] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 4 ms to minimize.
[2024-05-23 17:11:42] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 4 ms to minimize.
[2024-05-23 17:11:42] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 20/56 constraints. Problems are: Problem set: 207 solved, 591 unsolved
[2024-05-23 17:11:49] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 4 ms to minimize.
[2024-05-23 17:11:49] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:11:50] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 4 ms to minimize.
[2024-05-23 17:11:53] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 4 ms to minimize.
SMT process timed out in 30536ms, After SMT, problems are : Problem set: 207 solved, 591 unsolved
Search for dead transitions found 207 dead transitions in 30553ms
Found 207 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 207 transitions
Dead transitions reduction (with SMT) removed 207 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 270/275 places, 596/700 transitions.
Graph (complete) has 1426 edges and 270 vertex of which 171 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.2 ms
Discarding 99 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 171 /270 variables (removed 99) and now considering 596/596 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30654 ms. Remains : 171/275 places, 596/700 transitions.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Applied a total of 0 rules in 5 ms. Remains 275 /275 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-23 17:11:53] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-23 17:11:53] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 17:11:54] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-23 17:11:54] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:11:54] [INFO ] Invariant cache hit.
[2024-05-23 17:11:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:11:55] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-23 17:11:55] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-23 17:11:55] [INFO ] Invariant cache hit.
[2024-05-23 17:11:55] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:12:02] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:12:03] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:12:03] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2024-05-23 17:12:03] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:12:03] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-05-23 17:12:03] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 4 ms to minimize.
[2024-05-23 17:12:04] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 4 ms to minimize.
[2024-05-23 17:12:04] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 4 ms to minimize.
[2024-05-23 17:12:04] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:12:04] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:12:04] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 4 ms to minimize.
[2024-05-23 17:12:05] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:12:05] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 5 ms to minimize.
[2024-05-23 17:12:06] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 5 ms to minimize.
[2024-05-23 17:12:06] [INFO ] Deduced a trap composed of 72 places in 251 ms of which 4 ms to minimize.
[2024-05-23 17:12:06] [INFO ] Deduced a trap composed of 60 places in 245 ms of which 4 ms to minimize.
[2024-05-23 17:12:06] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 3 ms to minimize.
[2024-05-23 17:12:07] [INFO ] Deduced a trap composed of 54 places in 252 ms of which 4 ms to minimize.
[2024-05-23 17:12:07] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:12:07] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:12:08] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:12:08] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-23 17:12:09] [INFO ] Deduced a trap composed of 57 places in 270 ms of which 4 ms to minimize.
[2024-05-23 17:12:09] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 3 ms to minimize.
[2024-05-23 17:12:09] [INFO ] Deduced a trap composed of 51 places in 264 ms of which 5 ms to minimize.
[2024-05-23 17:12:09] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:12:10] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-23 17:12:10] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:12:10] [INFO ] Deduced a trap composed of 72 places in 219 ms of which 3 ms to minimize.
[2024-05-23 17:12:10] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 4 ms to minimize.
[2024-05-23 17:12:11] [INFO ] Deduced a trap composed of 66 places in 218 ms of which 4 ms to minimize.
[2024-05-23 17:12:11] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 4 ms to minimize.
[2024-05-23 17:12:11] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:12:11] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2024-05-23 17:12:12] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-05-23 17:12:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:12:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 17:12:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-05-23 17:12:12] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 4 ms to minimize.
[2024-05-23 17:12:13] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:12:20] [INFO ] Deduced a trap composed of 77 places in 241 ms of which 4 ms to minimize.
[2024-05-23 17:12:20] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 4 ms to minimize.
[2024-05-23 17:12:20] [INFO ] Deduced a trap composed of 71 places in 230 ms of which 3 ms to minimize.
[2024-05-23 17:12:20] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:12:21] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 4 ms to minimize.
[2024-05-23 17:12:21] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 3 ms to minimize.
[2024-05-23 17:12:21] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 4 ms to minimize.
[2024-05-23 17:12:21] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 4 ms to minimize.
[2024-05-23 17:12:22] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 4 ms to minimize.
[2024-05-23 17:12:22] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 3 ms to minimize.
[2024-05-23 17:12:22] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 4 ms to minimize.
[2024-05-23 17:12:23] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 4 ms to minimize.
[2024-05-23 17:12:23] [INFO ] Deduced a trap composed of 59 places in 259 ms of which 4 ms to minimize.
[2024-05-23 17:12:24] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 5 ms to minimize.
[2024-05-23 17:12:25] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 71 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:12:28] [INFO ] Deduced a trap composed of 51 places in 216 ms of which 4 ms to minimize.
[2024-05-23 17:12:28] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 4 ms to minimize.
[2024-05-23 17:12:28] [INFO ] Deduced a trap composed of 77 places in 231 ms of which 3 ms to minimize.
[2024-05-23 17:12:28] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 3 ms to minimize.
[2024-05-23 17:12:29] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 3 ms to minimize.
[2024-05-23 17:12:29] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 4 ms to minimize.
[2024-05-23 17:12:29] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 3 ms to minimize.
[2024-05-23 17:12:29] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 3 ms to minimize.
[2024-05-23 17:12:30] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:12:30] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 4 ms to minimize.
[2024-05-23 17:12:30] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:12:30] [INFO ] Deduced a trap composed of 57 places in 241 ms of which 4 ms to minimize.
[2024-05-23 17:12:31] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:12:31] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:12:31] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-05-23 17:12:31] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:12:31] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:12:31] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:12:32] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:12:34] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:12:35] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:12:36] [INFO ] Deduced a trap composed of 81 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:12:36] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:12:36] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:12:37] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 3 ms to minimize.
[2024-05-23 17:12:37] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 3 ms to minimize.
[2024-05-23 17:12:37] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-23 17:12:37] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 3 ms to minimize.
[2024-05-23 17:12:37] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
[2024-05-23 17:12:38] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 2 ms to minimize.
[2024-05-23 17:12:38] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 4 ms to minimize.
[2024-05-23 17:12:39] [INFO ] Deduced a trap composed of 59 places in 307 ms of which 3 ms to minimize.
[2024-05-23 17:12:39] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:12:39] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2024-05-23 17:12:39] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 4 ms to minimize.
[2024-05-23 17:12:42] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
[2024-05-23 17:12:42] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:12:42] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 4 ms to minimize.
[2024-05-23 17:12:43] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 4 ms to minimize.
[2024-05-23 17:12:43] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:12:44] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:12:45] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 3 ms to minimize.
[2024-05-23 17:12:45] [INFO ] Deduced a trap composed of 70 places in 240 ms of which 4 ms to minimize.
[2024-05-23 17:12:46] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 4 ms to minimize.
[2024-05-23 17:12:46] [INFO ] Deduced a trap composed of 57 places in 260 ms of which 5 ms to minimize.
[2024-05-23 17:12:46] [INFO ] Deduced a trap composed of 93 places in 259 ms of which 4 ms to minimize.
[2024-05-23 17:12:47] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 4 ms to minimize.
[2024-05-23 17:12:49] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 4 ms to minimize.
[2024-05-23 17:12:49] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 4 ms to minimize.
[2024-05-23 17:12:50] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 11 ms to minimize.
[2024-05-23 17:12:50] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 4 ms to minimize.
[2024-05-23 17:12:50] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 4 ms to minimize.
[2024-05-23 17:12:51] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:12:51] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 4 ms to minimize.
[2024-05-23 17:12:51] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:12:52] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 4 ms to minimize.
[2024-05-23 17:12:52] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 4 ms to minimize.
[2024-05-23 17:12:52] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 4 ms to minimize.
[2024-05-23 17:12:53] [INFO ] Deduced a trap composed of 72 places in 270 ms of which 3 ms to minimize.
[2024-05-23 17:12:53] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-23 17:12:55] [INFO ] Deduced a trap composed of 72 places in 257 ms of which 4 ms to minimize.
[2024-05-23 17:12:55] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 4 ms to minimize.
[2024-05-23 17:12:55] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 3 ms to minimize.
[2024-05-23 17:12:55] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 60519ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Finished structural reductions in LTL mode , in 1 iterations and 62080 ms. Remains : 275/275 places, 700/700 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 218560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||G(p2)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-06
Stuttering acceptance computed with spot in 226 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 38 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-23 17:12:56] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-23 17:12:56] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 17:12:56] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-23 17:12:56] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:12:56] [INFO ] Invariant cache hit.
[2024-05-23 17:12:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:12:57] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-23 17:12:57] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:12:57] [INFO ] Invariant cache hit.
[2024-05-23 17:12:57] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:13:02] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:13:02] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-23 17:13:02] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-23 17:13:02] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 17:13:02] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-05-23 17:13:02] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:13:02] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:13:03] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-23 17:13:03] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:13:03] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:13:04] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:13:04] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-05-23 17:13:04] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 3 ms to minimize.
[2024-05-23 17:13:04] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 17:13:04] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:13:05] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:13:05] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2024-05-23 17:13:05] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:13:06] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:13:06] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:13:07] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:13:08] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:13:08] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:13:08] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-23 17:13:09] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:13:09] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:13:09] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-23 17:13:10] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-23 17:13:10] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 3 ms to minimize.
[2024-05-23 17:13:10] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:13:10] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
[2024-05-23 17:13:10] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:13:11] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2024-05-23 17:13:11] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:13:11] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:13:11] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-05-23 17:13:11] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:13:12] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:13:12] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:13:12] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:13:19] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:13:19] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-23 17:13:20] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 2 ms to minimize.
[2024-05-23 17:13:20] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:13:20] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 3 ms to minimize.
[2024-05-23 17:13:20] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:13:21] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:13:21] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:13:21] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:13:21] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:13:21] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-05-23 17:13:21] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2024-05-23 17:13:22] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:13:22] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:13:22] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:13:23] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-05-23 17:13:23] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:13:26] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 3 ms to minimize.
[2024-05-23 17:13:26] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:13:26] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:13:27] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:13:27] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 78 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 62/78 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:13:29] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 2 ms to minimize.
[2024-05-23 17:13:30] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:13:31] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:13:31] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-05-23 17:13:32] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-05-23 17:13:32] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:13:32] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 1 ms to minimize.
[2024-05-23 17:13:32] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:13:32] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:13:32] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-23 17:13:33] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-05-23 17:13:33] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2024-05-23 17:13:33] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:13:33] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:13:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:13:34] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 3 ms to minimize.
[2024-05-23 17:13:34] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-05-23 17:13:34] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:13:35] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:13:35] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:13:38] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:13:39] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:13:39] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:13:39] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2024-05-23 17:13:40] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:13:40] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2024-05-23 17:13:40] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:13:40] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 2 ms to minimize.
[2024-05-23 17:13:40] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:13:42] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 2 ms to minimize.
[2024-05-23 17:13:43] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 2 ms to minimize.
[2024-05-23 17:13:43] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:13:48] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-05-23 17:13:48] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 2 ms to minimize.
[2024-05-23 17:13:48] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:13:55] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:13:56] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:13:56] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:13:56] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:13:56] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 121 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 105/105 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61452 ms. Remains : 171/280 places, 596/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 227 ms.
Product exploration explored 100000 steps with 0 reset in 203 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 (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 148 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 840990 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 1
Probabilistic random walk after 840990 steps, saw 161303 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2024-05-23 17:14:01] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:14:01] [INFO ] Invariant cache hit.
[2024-05-23 17:14:01] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:14:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:14:02] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-23 17:14:02] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-05-23 17:14:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 17:14:02] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:14:02] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
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 170 transition count 595
Applied a total of 2 rules in 26 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 758526 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 758526 steps, saw 146701 distinct states, run finished after 3006 ms. (steps per millisecond=252 ) properties seen :0
[2024-05-23 17:14:05] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-23 17:14:05] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 17:14:05] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1351ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 19 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 17:14:07] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:14:07] [INFO ] Invariant cache hit.
[2024-05-23 17:14:07] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-23 17:14:07] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:14:07] [INFO ] Invariant cache hit.
[2024-05-23 17:14:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:14:08] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
[2024-05-23 17:14:08] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 17:14:08] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:14:08] [INFO ] Invariant cache hit.
[2024-05-23 17:14:08] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:12] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:14:13] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:14:13] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:14:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:14:13] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:14:13] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:14:13] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:14:13] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-05-23 17:14:13] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-05-23 17:14:14] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:14:14] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:14:14] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:14:14] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-05-23 17:14:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-23 17:14:15] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:14:15] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-05-23 17:14:15] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:14:15] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 17:14:15] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 2 ms to minimize.
[2024-05-23 17:14:16] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:17] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 17:14:17] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-23 17:14:18] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:14:19] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:14:19] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:14:20] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-05-23 17:14:20] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2024-05-23 17:14:20] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:14:20] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-23 17:14:21] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:14:21] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-05-23 17:14:21] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-23 17:14:21] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-05-23 17:14:22] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 3 ms to minimize.
[2024-05-23 17:14:22] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
[2024-05-23 17:14:22] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-23 17:14:22] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-05-23 17:14:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-23 17:14:23] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 3 ms to minimize.
[2024-05-23 17:14:23] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:27] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:14:30] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:14:31] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 3 ms to minimize.
[2024-05-23 17:14:31] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:14:31] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
[2024-05-23 17:14:32] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:14:32] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 3 ms to minimize.
[2024-05-23 17:14:33] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:38] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:14:38] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:14:38] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 67 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:43] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 3 ms to minimize.
[2024-05-23 17:14:43] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:14:43] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 3 ms to minimize.
[2024-05-23 17:14:43] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:14:43] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:14:44] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:14:44] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:14:44] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:14:44] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 3 ms to minimize.
[2024-05-23 17:14:44] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:14:45] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:14:45] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:14:45] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 3 ms to minimize.
[2024-05-23 17:14:46] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 2 ms to minimize.
[2024-05-23 17:14:48] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:49] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-05-23 17:14:50] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:14:50] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:14:51] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:14:52] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:14:52] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:14:52] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:14:53] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:14:54] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:14:54] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:56] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:14:56] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:14:56] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:14:56] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:14:56] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:14:56] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:14:56] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:14:57] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:14:57] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2024-05-23 17:14:57] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 3 ms to minimize.
[2024-05-23 17:14:57] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:14:57] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:14:57] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:14:57] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-05-23 17:14:58] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2024-05-23 17:14:58] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:14:58] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:14:58] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:14:58] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:14:59] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:15:01] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 1 ms to minimize.
[2024-05-23 17:15:02] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:15:02] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:15:02] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:15:02] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:15:03] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:15:03] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2024-05-23 17:15:03] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2024-05-23 17:15:03] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:15:04] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:15:04] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:15:04] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:15:04] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:15:08] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:15:08] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
SMT process timed out in 60359ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61590 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 22 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-23 17:15:08] [INFO ] Computed 11 invariants in 1 ms
[2024-05-23 17:15:08] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:15:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 17:15:08] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:15:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-23 17:15:08] [INFO ] After 15ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 17:15:08] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-23 17:15:08] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-23 17:15:08] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 17:15:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 97 ms
TRAPS : Iteration 1
[2024-05-23 17:15:08] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:15:09] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 330 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p2)]
Support contains 3 out of 171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 11 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-23 17:15:09] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-23 17:15:09] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 17:15:09] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-23 17:15:09] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:15:09] [INFO ] Invariant cache hit.
[2024-05-23 17:15:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:15:10] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2024-05-23 17:15:10] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-23 17:15:10] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:15:10] [INFO ] Invariant cache hit.
[2024-05-23 17:15:10] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:13] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:15:13] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:15:13] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 17:15:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 17:15:13] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:15:13] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:15:13] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:15:14] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-23 17:15:14] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2024-05-23 17:15:14] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:15:14] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:15:14] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:15:14] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:15:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-23 17:15:14] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:15:15] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:15:15] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2024-05-23 17:15:15] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:15:15] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:15:15] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:16] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-23 17:15:17] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-23 17:15:17] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:15:17] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-23 17:15:18] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:15:18] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:15:18] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-23 17:15:18] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-23 17:15:18] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:15:18] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:15:19] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:15:19] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-05-23 17:15:19] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:15:19] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:15:19] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:15:19] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 3 ms to minimize.
[2024-05-23 17:15:19] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:15:19] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:15:20] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2024-05-23 17:15:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:24] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:15:24] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-23 17:15:25] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:15:25] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2024-05-23 17:15:25] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:15:25] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:15:25] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:15:25] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:15:25] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:15:25] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 1 ms to minimize.
[2024-05-23 17:15:26] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:15:26] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:15:26] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:15:26] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:15:26] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:15:27] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:15:27] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:29] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:15:29] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:15:29] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:15:29] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:15:29] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-05-23 17:15:31] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:15:31] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:15:31] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:15:31] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:15:31] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:15:31] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:15:32] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-05-23 17:15:32] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:15:32] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:15:32] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:15:32] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:15:32] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:15:32] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 3 ms to minimize.
[2024-05-23 17:15:32] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:15:33] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:35] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:15:36] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-23 17:15:36] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:15:36] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:15:36] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 98 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:42] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:15:42] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:15:43] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:15:43] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:15:43] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:15:44] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:15:44] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:15:44] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:15:44] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:15:44] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:15:44] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:15:45] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:49] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:15:49] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2024-05-23 17:15:49] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2024-05-23 17:15:49] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:15:50] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
[2024-05-23 17:15:50] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:15:50] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:15:50] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:55] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:15:55] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:15:56] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:15:58] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:15:59] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:15:59] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:16:00] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:16:00] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:16:04] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-23 17:16:04] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:16:04] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:16:04] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:16:05] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:16:05] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:16:05] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:16:08] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:16:09] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:16:09] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:16:09] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 137 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 121/121 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61031 ms. Remains : 171/171 places, 596/596 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 832356 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :0 out of 1
Probabilistic random walk after 832356 steps, saw 159869 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :0
[2024-05-23 17:16:13] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:16:13] [INFO ] Invariant cache hit.
[2024-05-23 17:16:13] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:16:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:16:13] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-23 17:16:14] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-23 17:16:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 17:16:14] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:16:14] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 858ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
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 170 transition count 595
Applied a total of 2 rules in 12 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 840834 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 1
Probabilistic random walk after 840834 steps, saw 161230 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2024-05-23 17:16:17] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-23 17:16:17] [INFO ] Computed 16 invariants in 0 ms
[2024-05-23 17:16:17] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:16:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:16:17] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 17:16:17] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-23 17:16:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-23 17:16:18] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-23 17:16:18] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-23 17:16:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 17:16:18] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:16:18] [INFO ] Invariant cache hit.
[2024-05-23 17:16:18] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-23 17:16:18] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:16:18] [INFO ] Invariant cache hit.
[2024-05-23 17:16:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:16:19] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2024-05-23 17:16:19] [INFO ] Redundant transitions in 5 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 17:16:19] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:16:19] [INFO ] Invariant cache hit.
[2024-05-23 17:16:19] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:16:22] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:16:22] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:16:23] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-23 17:16:24] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:16:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-23 17:16:24] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:16:24] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:16:24] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:16:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 17:16:24] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-23 17:16:25] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:16:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 17:16:25] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:16:26] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:16:26] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-23 17:16:27] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-23 17:16:27] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:16:27] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:16:27] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-23 17:16:28] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-23 17:16:28] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:16:28] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:16:28] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:16:28] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:16:28] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:16:28] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:16:29] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:16:29] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:16:29] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-23 17:16:29] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:16:29] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:16:32] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-23 17:16:34] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:16:34] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:16:34] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:16:35] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:16:35] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:16:35] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:16:35] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:16:39] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:16:39] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:16:39] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:16:39] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:16:40] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:16:40] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:16:40] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:16:40] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:16:40] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:16:40] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:16:41] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:16:41] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:16:42] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:16:42] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:16:42] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:16:42] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:16:42] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:16:42] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:16:42] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:16:42] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:16:43] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:16:43] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:16:43] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:16:44] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:16:44] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:16:44] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:16:44] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:16:44] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:16:45] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:16:45] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:16:45] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:16:45] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:16:46] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2024-05-23 17:16:46] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:16:46] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-23 17:16:47] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:16:48] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:16:48] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:16:48] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
(s70 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 19/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 103 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:16:51] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:16:51] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:16:52] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:16:52] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:16:52] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2024-05-23 17:16:52] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2024-05-23 17:16:52] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:16:52] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 1 ms to minimize.
[2024-05-23 17:16:52] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:16:53] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:16:53] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:16:53] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:16:53] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:16:53] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:16:53] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:16:53] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:16:54] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 1 ms to minimize.
[2024-05-23 17:16:54] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:16:54] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:16:54] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:16:57] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:16:57] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:16:57] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2024-05-23 17:16:57] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 1 ms to minimize.
[2024-05-23 17:16:58] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:16:58] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-05-23 17:16:58] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:16:58] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:16:58] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:16:58] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:16:59] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:16:59] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:17:00] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-23 17:17:00] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:17:03] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:17:03] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:17:03] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:17:04] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:17:05] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:17:05] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:17:05] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:17:05] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:17:08] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:17:08] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:17:08] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:17:09] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:17:09] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:17:10] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:17:10] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:17:10] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-23 17:17:10] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:17:10] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:17:11] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:17:14] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:17:15] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:17:15] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:17:15] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-23 17:17:15] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:17:15] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:17:15] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:17:15] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-23 17:17:16] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:17:16] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-23 17:17:16] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 11/167 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 167 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 151/151 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61133 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 16 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-23 17:17:19] [INFO ] Computed 11 invariants in 1 ms
[2024-05-23 17:17:19] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:17:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-23 17:17:19] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:17:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-23 17:17:19] [INFO ] After 13ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 17:17:19] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-23 17:17:19] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-23 17:17:19] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 17:17:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 78 ms
TRAPS : Iteration 1
[2024-05-23 17:17:19] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:17:19] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 274 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 183 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 12 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
[2024-05-23 17:17:20] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-23 17:17:20] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 17:17:20] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-23 17:17:20] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:17:20] [INFO ] Invariant cache hit.
[2024-05-23 17:17:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:17:21] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2024-05-23 17:17:21] [INFO ] Redundant transitions in 5 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 17:17:21] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:17:21] [INFO ] Invariant cache hit.
[2024-05-23 17:17:21] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:17:25] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:17:25] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:17:25] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:17:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-23 17:17:25] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-05-23 17:17:26] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:17:26] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:17:26] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:17:26] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
[2024-05-23 17:17:26] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:17:26] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-23 17:17:27] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:17:27] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-05-23 17:17:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 17:17:27] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:17:27] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-23 17:17:28] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:17:28] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:17:28] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:17:29] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:17:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 17:17:29] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-05-23 17:17:31] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:17:31] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-23 17:17:31] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:17:32] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:17:32] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:17:33] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-23 17:17:33] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-23 17:17:33] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:17:33] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:17:34] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:17:34] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-05-23 17:17:34] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:17:34] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:17:34] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 3 ms to minimize.
[2024-05-23 17:17:35] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:17:35] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-23 17:17:35] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:17:35] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:17:40] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-23 17:17:43] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:17:43] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 2 ms to minimize.
[2024-05-23 17:17:43] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2024-05-23 17:17:44] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 2 ms to minimize.
[2024-05-23 17:17:44] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:17:44] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 3 ms to minimize.
[2024-05-23 17:17:45] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:17:49] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:17:49] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:17:49] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
[2024-05-23 17:17:50] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:17:50] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:17:50] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-05-23 17:17:50] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 2 ms to minimize.
[2024-05-23 17:17:50] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:17:51] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 2 ms to minimize.
[2024-05-23 17:17:51] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
SMT process timed out in 30326ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 30332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/171 places, 595/596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31199 ms. Remains : 170/171 places, 595/596 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-06 finished in 295518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!F(X(p1)) U p2))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-07
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 171 place count 193 transition count 626
Iterating global reduction 2 with 3 rules applied. Total rules applied 174 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 214 place count 173 transition count 606
Applied a total of 214 rules in 33 ms. Remains 173 /280 variables (removed 107) and now considering 606/725 (removed 119) transitions.
[2024-05-23 17:17:51] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
// Phase 1: matrix 271 rows 173 cols
[2024-05-23 17:17:51] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 17:17:52] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 17:17:52] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:17:52] [INFO ] Invariant cache hit.
[2024-05-23 17:17:52] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-23 17:17:52] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-23 17:17:52] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:17:52] [INFO ] Invariant cache hit.
[2024-05-23 17:17:52] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:17:56] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
[2024-05-23 17:17:57] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-23 17:17:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-23 17:17:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 17:17:57] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:17:57] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 3 ms to minimize.
[2024-05-23 17:17:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 17:17:57] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:17:58] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-23 17:17:58] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-23 17:17:58] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 3 ms to minimize.
[2024-05-23 17:17:58] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:17:58] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:17:59] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2024-05-23 17:17:59] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:17:59] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:17:59] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
[2024-05-23 17:17:59] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-23 17:17:59] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:17:59] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:18:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-23 17:18:01] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:18:01] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:18:01] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-05-23 17:18:02] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:18:02] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-23 17:18:03] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:18:03] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-23 17:18:03] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2024-05-23 17:18:03] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-23 17:18:04] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:18:04] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2024-05-23 17:18:04] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 2 ms to minimize.
[2024-05-23 17:18:04] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 3 ms to minimize.
[2024-05-23 17:18:05] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:18:05] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 2 ms to minimize.
[2024-05-23 17:18:05] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-23 17:18:05] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:18:05] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:18:06] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:18:13] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 3 ms to minimize.
[2024-05-23 17:18:14] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:18:14] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 2 ms to minimize.
[2024-05-23 17:18:14] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 3 ms to minimize.
[2024-05-23 17:18:15] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-05-23 17:18:16] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 2 ms to minimize.
[2024-05-23 17:18:16] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:18:20] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:18:21] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 2 ms to minimize.
[2024-05-23 17:18:21] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 4 ms to minimize.
[2024-05-23 17:18:21] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-05-23 17:18:21] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 2 ms to minimize.
[2024-05-23 17:18:22] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:18:22] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:18:22] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-05-23 17:18:22] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/444 variables, and 72 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:18:27] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 3 ms to minimize.
[2024-05-23 17:18:27] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:18:28] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
[2024-05-23 17:18:28] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:18:28] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 2 ms to minimize.
[2024-05-23 17:18:28] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:18:29] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2024-05-23 17:18:29] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:18:31] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:18:31] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:18:35] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:18:36] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 4 ms to minimize.
[2024-05-23 17:18:36] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2024-05-23 17:18:36] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 3 ms to minimize.
[2024-05-23 17:18:37] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 2 ms to minimize.
[2024-05-23 17:18:37] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-05-23 17:18:38] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:18:38] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-05-23 17:18:39] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-05-23 17:18:39] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
[2024-05-23 17:18:39] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:18:39] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:18:40] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-05-23 17:18:40] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:18:41] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-05-23 17:18:42] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:18:42] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-23 17:18:42] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:18:42] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:18:42] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:18:42] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 3 ms to minimize.
[2024-05-23 17:18:43] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:18:43] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:18:44] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-05-23 17:18:44] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:18:44] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2024-05-23 17:18:45] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-05-23 17:18:45] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:18:45] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 3 ms to minimize.
[2024-05-23 17:18:45] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:18:46] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-05-23 17:18:46] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-23 17:18:46] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:18:46] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:18:49] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:18:49] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:18:49] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:18:50] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 3 ms to minimize.
[2024-05-23 17:18:50] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:18:50] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:18:51] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:18:51] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:18:52] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-05-23 17:18:52] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:18:52] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:18:52] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:18:52] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/444 variables, and 129 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 113/113 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LI_LTL mode, iteration 1 : 173/280 places, 606/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61324 ms. Remains : 173/280 places, 606/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 33291 reset in 360 ms.
Product exploration explored 100000 steps with 33371 reset in 367 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 (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 189 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 360 ms. (110 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
[2024-05-23 17:18:54] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:18:54] [INFO ] Invariant cache hit.
[2024-05-23 17:18:54] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 183/290 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 51/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/322 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 48/370 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/374 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 70/444 variables, 52/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 61/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/444 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:18:55] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/290 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 51/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 32/322 variables, 14/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/370 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/374 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:18:55] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/374 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/374 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 70/444 variables, 52/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/444 variables, 61/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:18:55] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/444 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:18:56] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/444 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/444 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/444 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 319 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1529ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1161 ms.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 16 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 173/173 places, 606/606 transitions.
RANDOM walk for 40000 steps (8 resets) in 1519 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 139660 steps, run visited all 2 properties in 765 ms. (steps per millisecond=182 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 765 ms. (steps per millisecond=182 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 487 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-05-23 17:18:59] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:18:59] [INFO ] Invariant cache hit.
[2024-05-23 17:19:00] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-23 17:19:00] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:19:00] [INFO ] Invariant cache hit.
[2024-05-23 17:19:00] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-23 17:19:00] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-23 17:19:00] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:19:00] [INFO ] Invariant cache hit.
[2024-05-23 17:19:00] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:19:05] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:19:05] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-23 17:19:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 17:19:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 17:19:05] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:19:05] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:19:06] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-23 17:19:06] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:19:06] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:19:06] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:19:07] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:19:07] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2024-05-23 17:19:07] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:19:07] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:19:07] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:19:07] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:19:08] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:19:08] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-23 17:19:08] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:19:08] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:19:09] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 17:19:09] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:19:10] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:19:10] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:19:11] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-05-23 17:19:11] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-23 17:19:12] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 2 ms to minimize.
[2024-05-23 17:19:12] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:19:12] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:19:13] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-23 17:19:13] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-23 17:19:13] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:19:13] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:19:13] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 3 ms to minimize.
[2024-05-23 17:19:13] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:19:14] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-05-23 17:19:14] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-23 17:19:14] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:19:14] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:19:14] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:19:21] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-05-23 17:19:22] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:19:22] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:19:23] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:19:23] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2024-05-23 17:19:24] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-05-23 17:19:24] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:19:27] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2024-05-23 17:19:28] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:19:28] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:19:28] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-05-23 17:19:29] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:19:29] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:19:29] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 2 ms to minimize.
[2024-05-23 17:19:29] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:19:30] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 2 ms to minimize.
[2024-05-23 17:19:30] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 3 ms to minimize.
[2024-05-23 17:19:31] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
SMT process timed out in 30512ms, After SMT, problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 30523ms
Finished structural reductions in LTL mode , in 1 iterations and 31448 ms. Remains : 173/173 places, 606/606 transitions.
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 (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 207 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 2649 ms. (15 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
[2024-05-23 17:19:32] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:19:32] [INFO ] Invariant cache hit.
[2024-05-23 17:19:32] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 183/290 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 51/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/322 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 48/370 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/374 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 70/444 variables, 52/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 61/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/444 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:19:33] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/290 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 51/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 32/322 variables, 14/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/370 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/374 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:19:33] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/374 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/374 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 70/444 variables, 52/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/444 variables, 61/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:19:33] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/444 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:19:34] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/444 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/444 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/444 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 319 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1416ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 427 ms.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 13 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 173/173 places, 606/606 transitions.
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8416 steps, run visited all 1 properties in 55 ms. (steps per millisecond=153 )
Probabilistic random walk after 8416 steps, saw 4945 distinct states, run finished after 56 ms. (steps per millisecond=150 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 642 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 33446 reset in 325 ms.
Product exploration explored 100000 steps with 33399 reset in 235 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 16 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-05-23 17:19:37] [INFO ] Redundant transitions in 7 ms returned []
Running 601 sub problems to find dead transitions.
[2024-05-23 17:19:37] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:19:37] [INFO ] Invariant cache hit.
[2024-05-23 17:19:37] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:19:41] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:19:41] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-23 17:19:41] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 17:19:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 17:19:42] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2024-05-23 17:19:42] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 3 ms to minimize.
[2024-05-23 17:19:42] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 17:19:42] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:19:43] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:19:43] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-23 17:19:43] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:19:43] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 3 ms to minimize.
[2024-05-23 17:19:43] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:19:43] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:19:44] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:19:44] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 2 ms to minimize.
[2024-05-23 17:19:44] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:19:44] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-23 17:19:44] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:19:44] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:19:45] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 17:19:46] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:19:46] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:19:46] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:19:47] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:19:47] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-23 17:19:48] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:19:48] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:19:48] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:19:48] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-23 17:19:48] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:19:49] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 2 ms to minimize.
[2024-05-23 17:19:49] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:19:49] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-23 17:19:49] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:19:49] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:19:49] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-23 17:19:50] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
[2024-05-23 17:19:50] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-05-23 17:19:50] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:19:56] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:19:57] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 3 ms to minimize.
[2024-05-23 17:19:57] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 2 ms to minimize.
[2024-05-23 17:19:58] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:19:58] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:19:59] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 2 ms to minimize.
[2024-05-23 17:19:59] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:03] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:20:03] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:20:03] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:20:03] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:20:04] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:20:04] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
[2024-05-23 17:20:04] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-05-23 17:20:04] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-05-23 17:20:04] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:20:05] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-23 17:20:05] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:20:06] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:07] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/444 variables, and 76 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:11] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:20:12] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 3 ms to minimize.
[2024-05-23 17:20:12] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-05-23 17:20:12] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:20:12] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:20:12] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:20:13] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-05-23 17:20:13] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-05-23 17:20:14] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:18] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 2 ms to minimize.
[2024-05-23 17:20:18] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
[2024-05-23 17:20:18] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
[2024-05-23 17:20:19] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:20:20] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:20:20] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2024-05-23 17:20:20] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 1 ms to minimize.
[2024-05-23 17:20:20] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-05-23 17:20:21] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:20:22] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:20:22] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-05-23 17:20:22] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:20:23] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:27] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:20:27] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 3 ms to minimize.
[2024-05-23 17:20:28] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:31] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:20:32] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:20:32] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:20:32] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:20:32] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:20:32] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:20:33] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:20:33] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:20:33] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:20:33] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:20:34] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-05-23 17:20:34] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 2 ms to minimize.
[2024-05-23 17:20:34] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2024-05-23 17:20:34] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 2 ms to minimize.
[2024-05-23 17:20:35] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:20:35] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 2 ms to minimize.
[2024-05-23 17:20:35] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:20:35] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:20:36] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 3 ms to minimize.
[2024-05-23 17:20:36] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/444 variables, and 121 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 105/105 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60460 ms. Remains : 173/173 places, 606/606 transitions.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-05-23 17:20:37] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:20:37] [INFO ] Invariant cache hit.
[2024-05-23 17:20:37] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-23 17:20:37] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:20:37] [INFO ] Invariant cache hit.
[2024-05-23 17:20:38] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-23 17:20:38] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-23 17:20:38] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-05-23 17:20:38] [INFO ] Invariant cache hit.
[2024-05-23 17:20:38] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:42] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:20:42] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-23 17:20:42] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 17:20:42] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 17:20:42] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
[2024-05-23 17:20:42] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:20:43] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 17:20:43] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-05-23 17:20:43] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 3 ms to minimize.
[2024-05-23 17:20:44] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 3 ms to minimize.
[2024-05-23 17:20:44] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 3 ms to minimize.
[2024-05-23 17:20:44] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-05-23 17:20:44] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:20:44] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-05-23 17:20:44] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:20:45] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 2 ms to minimize.
[2024-05-23 17:20:45] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:20:45] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-23 17:20:45] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2024-05-23 17:20:45] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 17:20:47] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-05-23 17:20:47] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:20:48] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-23 17:20:48] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:20:48] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-23 17:20:49] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:20:49] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:20:49] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2024-05-23 17:20:50] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-23 17:20:50] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:20:50] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:20:50] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:20:50] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-05-23 17:20:51] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:20:51] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:20:51] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-23 17:20:51] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
[2024-05-23 17:20:51] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-23 17:20:51] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:20:59] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:21:00] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 3 ms to minimize.
[2024-05-23 17:21:00] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 3 ms to minimize.
[2024-05-23 17:21:00] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2024-05-23 17:21:01] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:21:02] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:21:02] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:21:05] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-23 17:21:05] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-05-23 17:21:06] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 3 ms to minimize.
[2024-05-23 17:21:06] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:21:06] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:21:06] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:21:07] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2024-05-23 17:21:07] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2024-05-23 17:21:07] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:21:08] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 4 ms to minimize.
[2024-05-23 17:21:08] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/444 variables, and 74 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:21:12] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-23 17:21:12] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-23 17:21:13] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:21:18] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 3 ms to minimize.
[2024-05-23 17:21:18] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:21:19] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 2 ms to minimize.
[2024-05-23 17:21:19] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 3 ms to minimize.
[2024-05-23 17:21:19] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:21:20] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 2 ms to minimize.
[2024-05-23 17:21:20] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 2 ms to minimize.
[2024-05-23 17:21:21] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
[2024-05-23 17:21:22] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-23 17:21:22] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:21:22] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-05-23 17:21:23] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
[2024-05-23 17:21:23] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:21:23] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-23 17:21:23] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:21:27] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 3 ms to minimize.
[2024-05-23 17:21:28] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-23 17:21:28] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-05-23 17:21:28] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-05-23 17:21:28] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:21:29] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:21:29] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 2 ms to minimize.
[2024-05-23 17:21:29] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 2 ms to minimize.
[2024-05-23 17:21:29] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:21:30] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 17:21:36] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:21:37] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/444 variables, and 104 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 88/88 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Finished structural reductions in LTL mode , in 1 iterations and 61421 ms. Remains : 173/173 places, 606/606 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-07 finished in 227358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-15
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 20 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-05-23 17:21:39] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-23 17:21:39] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 17:21:39] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-23 17:21:39] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:21:39] [INFO ] Invariant cache hit.
[2024-05-23 17:21:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:21:39] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-23 17:21:39] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:21:39] [INFO ] Invariant cache hit.
[2024-05-23 17:21:39] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:21:42] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:21:42] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-23 17:21:43] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:21:44] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:21:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 17:21:46] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:21:46] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:21:46] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2024-05-23 17:21:46] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-23 17:21:46] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-23 17:21:47] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:21:47] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:21:47] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:21:48] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:21:48] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:21:48] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:21:48] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:21:48] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:21:48] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:21:48] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:21:49] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:21:49] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:21:49] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:21:50] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:21:55] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:21:55] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:21:55] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:21:55] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:21:55] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:21:56] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:21:58] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:21:58] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:21:59] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:22:00] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:22:00] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:22:00] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:22:00] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:22:00] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:22:00] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:22:01] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:22:01] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:22:01] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:03] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:22:03] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:22:04] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:22:04] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:22:04] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:22:04] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:22:04] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:22:05] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:22:05] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:22:05] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:22:05] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2024-05-23 17:22:05] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:22:05] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:22:06] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:22:06] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:22:06] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:22:07] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:22:07] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:22:07] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2024-05-23 17:22:08] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 94 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 78/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:12] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:22:12] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:22:12] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:22:12] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2024-05-23 17:22:13] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:22:13] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:22:13] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:22:13] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:22:13] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:22:13] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:22:14] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2024-05-23 17:22:14] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:22:15] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:22:15] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:22:15] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-23 17:22:15] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:22:15] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2024-05-23 17:22:15] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:22:15] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:22:15] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:18] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:22:18] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:22] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:22:23] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-23 17:22:23] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:22:23] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:22:24] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2024-05-23 17:22:25] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:26] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:22:26] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-23 17:22:26] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:22:27] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:22:27] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:22:27] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:22:27] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:22:27] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2024-05-23 17:22:28] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2024-05-23 17:22:28] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:22:28] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-05-23 17:22:29] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:22:30] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:22:30] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:22:31] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:22:31] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:22:31] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 17/139 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:34] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:22:34] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:22:34] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:22:34] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:22:34] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:22:35] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:22:36] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:22:36] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:22:36] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:22:36] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:22:37] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:39] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-23 17:22:40] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 60318ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Starting structural reductions in LI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61124 ms. Remains : 171/280 places, 596/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 184 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 4 ms. (steps per millisecond=27 )
Probabilistic random walk after 110 steps, saw 94 distinct states, run finished after 5 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-23 17:22:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:22:41] [INFO ] Invariant cache hit.
[2024-05-23 17:22:41] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-23 17:22:41] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:22:41] [INFO ] Invariant cache hit.
[2024-05-23 17:22:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:22:42] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-23 17:22:42] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:22:42] [INFO ] Invariant cache hit.
[2024-05-23 17:22:42] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:45] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 3 ms to minimize.
[2024-05-23 17:22:45] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-23 17:22:45] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-23 17:22:45] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-23 17:22:46] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:22:46] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:22:46] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:22:46] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:22:46] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:22:46] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-23 17:22:46] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:22:47] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:22:47] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:22:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-23 17:22:47] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2024-05-23 17:22:47] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:22:47] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:22:47] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-23 17:22:47] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:22:48] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 17:22:49] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:22:49] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:22:49] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:22:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-23 17:22:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-23 17:22:50] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:22:50] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:22:50] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:22:51] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:22:51] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:22:51] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-23 17:22:51] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:22:51] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2024-05-23 17:22:51] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:22:51] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:22:52] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:22:52] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:22:52] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:22:53] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:22:58] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:22:58] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:22:58] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:22:58] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:22:58] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:22:59] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:01] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-05-23 17:23:01] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:23:02] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-23 17:23:03] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:23:03] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:23:03] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:23:03] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:23:03] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:23:03] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:23:04] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:23:05] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:23:05] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:06] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:23:06] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:23:07] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:23:07] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2024-05-23 17:23:07] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:23:07] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:23:08] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:23:08] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:23:08] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-05-23 17:23:08] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:23:08] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2024-05-23 17:23:08] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:23:08] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:23:09] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2024-05-23 17:23:09] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:23:09] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:23:10] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:23:10] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:23:10] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:23:11] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 94 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 78/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:14] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:23:14] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:23:14] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:23:14] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:23:15] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:23:15] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-23 17:23:15] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:23:15] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:23:15] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:23:16] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:23:16] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2024-05-23 17:23:16] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:23:17] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:23:17] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:23:17] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:23:17] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:23:17] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:23:17] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:23:17] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:23:18] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:20] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-05-23 17:23:20] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:25] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:23:25] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 1 ms to minimize.
[2024-05-23 17:23:25] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:23:25] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:23:26] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-05-23 17:23:27] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:28] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-05-23 17:23:28] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-05-23 17:23:28] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:23:29] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:23:29] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:23:29] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2024-05-23 17:23:29] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:23:30] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:23:30] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:23:30] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:23:30] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:23:31] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:23:32] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:23:32] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:23:33] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:23:33] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:23:33] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 17/139 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:36] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:23:36] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:23:36] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:23:37] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:23:37] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:23:37] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:23:38] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:23:38] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:23:38] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:23:39] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:23:39] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:42] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:23:42] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 60324ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Finished structural reductions in LTL mode , in 1 iterations and 61203 ms. Remains : 171/171 places, 596/596 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 4 ms. (steps per millisecond=27 )
Probabilistic random walk after 110 steps, saw 94 distinct states, run finished after 4 ms. (steps per millisecond=27 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 159 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 10 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-23 17:23:43] [INFO ] Redundant transitions in 5 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-23 17:23:43] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:23:43] [INFO ] Invariant cache hit.
[2024-05-23 17:23:43] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:46] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:23:46] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-23 17:23:46] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 17:23:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-23 17:23:47] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-23 17:23:47] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:23:47] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:23:47] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:23:47] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:23:47] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-23 17:23:47] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-23 17:23:48] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 17:23:50] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:23:50] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:23:50] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:23:50] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:23:50] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-23 17:23:51] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:23:51] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2024-05-23 17:23:51] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:23:51] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:23:52] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:23:52] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:23:52] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:23:52] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2024-05-23 17:23:52] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:23:52] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2024-05-23 17:23:53] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:23:53] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:23:53] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:23:54] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:23:59] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2024-05-23 17:23:59] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:23:59] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:23:59] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:23:59] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:23:59] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:01] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-23 17:24:02] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:24:02] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:24:03] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:24:03] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:24:03] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:24:04] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:24:04] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:24:04] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2024-05-23 17:24:05] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:24:05] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:24:05] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:07] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2024-05-23 17:24:07] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:24:08] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:24:08] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2024-05-23 17:24:08] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 2 ms to minimize.
[2024-05-23 17:24:08] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:24:08] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:24:08] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:24:08] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:24:09] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:24:09] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:24:09] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:24:09] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:24:09] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:24:09] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:24:10] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-23 17:24:10] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:24:10] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-23 17:24:11] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:24:11] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 94 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 78/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:16] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:24:16] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:24:16] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:24:16] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:24:16] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:24:17] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-23 17:24:17] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:24:17] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:24:17] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:24:17] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:24:18] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:24:18] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-23 17:24:18] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:24:18] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:24:19] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:24:19] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:24:19] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:24:19] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:24:19] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:24:19] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:22] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:24:22] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:27] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:24:27] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:24:27] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-23 17:24:27] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:24:28] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:24:29] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:30] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-23 17:24:30] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-23 17:24:30] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:24:31] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:24:31] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-05-23 17:24:31] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:24:31] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:24:31] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:24:32] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:24:32] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:24:32] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-05-23 17:24:33] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:24:34] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:24:34] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:24:35] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:24:35] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-05-23 17:24:35] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 17/139 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:38] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-05-23 17:24:38] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:24:38] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:24:38] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:24:38] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:24:39] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:24:40] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:24:40] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:24:40] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:24:40] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-23 17:24:41] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:43] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 151 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 135/135 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60253 ms. Remains : 171/171 places, 596/596 transitions.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-23 17:24:43] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:24:43] [INFO ] Invariant cache hit.
[2024-05-23 17:24:44] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-23 17:24:44] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:24:44] [INFO ] Invariant cache hit.
[2024-05-23 17:24:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:24:44] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-05-23 17:24:44] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-23 17:24:44] [INFO ] Invariant cache hit.
[2024-05-23 17:24:44] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:48] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:24:48] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-23 17:24:48] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 17:24:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 17:24:48] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-05-23 17:24:48] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 17:24:49] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2024-05-23 17:24:50] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:24:50] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:24:50] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-23 17:24:50] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-23 17:24:50] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:24:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 17:24:51] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-23 17:24:51] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-23 17:24:51] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:24:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-23 17:24:52] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-23 17:24:52] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:24:52] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:24:53] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-23 17:24:53] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:24:53] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
[2024-05-23 17:24:53] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:24:54] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:24:54] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:24:54] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:24:54] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2024-05-23 17:24:54] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-23 17:24:54] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:24:55] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:24:56] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:00] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:25:01] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:25:01] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:25:01] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-05-23 17:25:01] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-23 17:25:01] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:03] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:25:03] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:25:04] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 1 ms to minimize.
[2024-05-23 17:25:05] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-05-23 17:25:05] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:25:05] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:25:05] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:25:05] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:25:06] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:25:06] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-23 17:25:07] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-23 17:25:07] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:08] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:25:09] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:25:09] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:25:10] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:25:10] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-23 17:25:10] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 1 ms to minimize.
[2024-05-23 17:25:10] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:25:10] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:25:10] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2024-05-23 17:25:10] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:25:10] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2024-05-23 17:25:11] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2024-05-23 17:25:11] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:25:11] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:25:11] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:25:12] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-23 17:25:12] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-23 17:25:12] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:25:12] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2024-05-23 17:25:13] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 94 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 78/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:17] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:25:17] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:25:17] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:25:17] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:25:18] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-23 17:25:18] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-23 17:25:18] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-23 17:25:18] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:25:18] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:25:18] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-23 17:25:19] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-23 17:25:19] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-05-23 17:25:19] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:25:20] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:25:20] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2024-05-23 17:25:20] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:25:20] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-23 17:25:20] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-23 17:25:20] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-23 17:25:20] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:23] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-23 17:25:23] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:28] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-05-23 17:25:28] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:25:28] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-05-23 17:25:28] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:25:29] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2024-05-23 17:25:30] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:31] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:25:31] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-23 17:25:31] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:25:32] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-23 17:25:32] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-05-23 17:25:32] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2024-05-23 17:25:32] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
[2024-05-23 17:25:32] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-23 17:25:32] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:25:33] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-23 17:25:33] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-23 17:25:34] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:25:35] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-23 17:25:35] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:25:35] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-23 17:25:36] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2024-05-23 17:25:36] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 17/139 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:39] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-23 17:25:39] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-05-23 17:25:39] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-23 17:25:39] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:25:39] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-23 17:25:39] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:25:41] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-23 17:25:41] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-23 17:25:41] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:25:41] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-23 17:25:41] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-23 17:25:44] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-23 17:25:44] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2024-05-23 17:25:45] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
SMT process timed out in 60269ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Finished structural reductions in LTL mode , in 1 iterations and 61146 ms. Remains : 171/171 places, 596/596 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 246248 ms.
[2024-05-23 17:25:45] [INFO ] Flatten gal took : 57 ms
[2024-05-23 17:25:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-23 17:25:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 280 places, 725 transitions and 3300 arcs took 13 ms.
Total runtime 2055353 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running EisenbergMcGuire-PT-05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 280
TRANSITIONS: 725
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.006s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 14504
MODEL NAME: /home/mcc/execution/414/model
280 places, 725 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA EisenbergMcGuire-PT-05-LTLFireability-06 CANNOT_COMPUTE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-07 CANNOT_COMPUTE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716485948019
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is EisenbergMcGuire-PT-05, 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 r157-smll-171636265100164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 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 ;