About the Execution of ITS-Tools for ShieldPPPt-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 532816.00 | 0.00 | 0.00 | FFTFFFFFFTFTTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533500867.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ShieldPPPt-PT-010B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533500867
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 185K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-010B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749303491917
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 13:38:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 13:38:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 13:38:13] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-07 13:38:13] [INFO ] Transformed 783 places.
[2025-06-07 13:38:13] [INFO ] Transformed 713 transitions.
[2025-06-07 13:38:13] [INFO ] Found NUPN structural information;
[2025-06-07 13:38:13] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 108 place count 675 transition count 605
Iterating global reduction 0 with 108 rules applied. Total rules applied 216 place count 675 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 217 place count 674 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 673 transition count 603
Applied a total of 220 rules in 203 ms. Remains 673 /783 variables (removed 110) and now considering 603/713 (removed 110) transitions.
// Phase 1: matrix 603 rows 673 cols
[2025-06-07 13:38:13] [INFO ] Computed 111 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:38:14] [INFO ] Implicit Places using invariants in 466 ms returned []
[2025-06-07 13:38:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:38:14] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-07 13:38:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:31] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:31] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:32] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:32] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:32] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:32] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:32] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:33] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:33] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:33] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:33] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:34] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:34] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:34] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:34] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:34] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:36] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:37] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:37] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:37] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:37] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:37] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:38] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:38] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:38] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:38] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:38] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:38] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:39] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:39] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:39] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:39] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 673/1276 variables, and 151 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/673 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:53] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:53] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:54] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:54] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:54] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:54] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:54] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:56] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:56] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:38:56] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 602 unsolved
SMT process timed out in 60161ms, After SMT, problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 673/783 places, 603/713 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61347 ms. Remains : 673/783 places, 603/713 transitions.
Support contains 26 out of 673 places after structural reductions.
[2025-06-07 13:39:15] [INFO ] Flatten gal took : 61 ms
[2025-06-07 13:39:15] [INFO ] Flatten gal took : 31 ms
[2025-06-07 13:39:15] [INFO ] Input system was already deterministic with 603 transitions.
Support contains 25 out of 673 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1500 ms. (26 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
[2025-06-07 13:39:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 644/673 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 603/1276 variables, 673/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1276 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1276 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1276/1276 variables, and 784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 673/673 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 644/673 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:16] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 603/1276 variables, 673/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1276 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1276 variables, 6/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap along path composed of 7 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap along path composed of 7 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:17] [INFO ] Deduced a trap along path composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1276 variables, 3/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1276 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1276 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1276/1276 variables, and 807 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2156 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 673/673 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2485ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 133 ms.
Support contains 2 out of 673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 673/673 places, 603/603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 673 transition count 462
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 532 transition count 462
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 282 place count 532 transition count 384
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 438 place count 454 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 439 place count 453 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 440 place count 453 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 440 place count 453 transition count 382
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 442 place count 452 transition count 382
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 1 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 336 rules applied. Total rules applied 778 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 779 place count 284 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 781 place count 283 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 839 place count 254 transition count 212
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 868 place count 254 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 869 place count 253 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 870 place count 252 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 870 place count 252 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 874 place count 250 transition count 209
Applied a total of 874 rules in 118 ms. Remains 250 /673 variables (removed 423) and now considering 209/603 (removed 394) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 250/673 places, 209/603 transitions.
RANDOM walk for 9829 steps (1 resets) in 113 ms. (86 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-010B-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 159 stabilizing places and 159 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 672 transition count 462
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 532 transition count 462
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 280 place count 532 transition count 385
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 434 place count 455 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 435 place count 454 transition count 384
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 454 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 436 place count 454 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 453 transition count 383
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 1 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 2 with 332 rules applied. Total rules applied 770 place count 287 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 771 place count 287 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 773 place count 286 transition count 215
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 829 place count 258 transition count 215
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 831 place count 256 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 832 place count 255 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 832 place count 255 transition count 211
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 836 place count 253 transition count 211
Applied a total of 836 rules in 98 ms. Remains 253 /673 variables (removed 420) and now considering 211/603 (removed 392) transitions.
// Phase 1: matrix 211 rows 253 cols
[2025-06-07 13:39:18] [INFO ] Computed 110 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:39:18] [INFO ] Implicit Places using invariants in 144 ms returned [236, 240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/673 places, 211/603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 249 transition count 209
Applied a total of 4 rules in 18 ms. Remains 249 /251 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 249 cols
[2025-06-07 13:39:18] [INFO ] Computed 108 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:39:19] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-07 13:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:39:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-07 13:39:19] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 249/673 places, 209/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 631 ms. Remains : 249/673 places, 209/603 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-00
Product exploration explored 100000 steps with 1 reset in 431 ms.
Stack based approach found an accepted trace after 1438 steps with 0 reset with depth 1439 and stack size 1405 in 7 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-00 finished in 1374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(X(!p1)))||G(!p1))))'
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 53 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
// Phase 1: matrix 601 rows 671 cols
[2025-06-07 13:39:20] [INFO ] Computed 111 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:39:20] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-06-07 13:39:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:39:20] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 13:39:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:37] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:37] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:37] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:38] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:38] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:38] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:39] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:39] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:39] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:39] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:39] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:41] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:42] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:42] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:42] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:42] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:42] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:42] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:42] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:43] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:43] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:43] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:43] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:44] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:44] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:44] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:44] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 151 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:39:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:00] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:00] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:00] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:00] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:00] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:00] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:00] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:01] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:01] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:01] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:01] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:01] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:01] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:01] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:02] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:02] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:02] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 600 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 671/1272 variables, and 172 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60778 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, p1]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 360 ms.
Stack based approach found an accepted trace after 258 steps with 0 reset with depth 259 and stack size 259 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-01 finished in 61311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 672 transition count 461
Reduce places removed 141 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 283 place count 531 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 284 place count 530 transition count 460
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 284 place count 530 transition count 382
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 440 place count 452 transition count 382
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 441 place count 451 transition count 381
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 451 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 442 place count 451 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 444 place count 450 transition count 380
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 776 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 284 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 779 place count 283 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 837 place count 254 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 839 place count 252 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 840 place count 251 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 840 place count 251 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 844 place count 249 transition count 208
Applied a total of 844 rules in 81 ms. Remains 249 /673 variables (removed 424) and now considering 208/603 (removed 395) transitions.
// Phase 1: matrix 208 rows 249 cols
[2025-06-07 13:40:21] [INFO ] Computed 110 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:40:21] [INFO ] Implicit Places using invariants in 204 ms returned [232, 236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 228 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/673 places, 208/603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 206
Applied a total of 4 rules in 26 ms. Remains 245 /247 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 245 cols
[2025-06-07 13:40:21] [INFO ] Computed 108 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:40:21] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-07 13:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:40:22] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/673 places, 206/603 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 728 ms. Remains : 245/673 places, 206/603 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 313 ms.
Stack based approach found an accepted trace after 13316 steps with 0 reset with depth 13317 and stack size 2540 in 68 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-05 finished in 1162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||(X(!p0) U ((p1&&X(!p0))||X(G(!p0))))) U G(p2)))'
Support contains 5 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 37 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
// Phase 1: matrix 601 rows 671 cols
[2025-06-07 13:40:22] [INFO ] Computed 111 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:40:22] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-07 13:40:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:40:23] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 13:40:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:40] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:40] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:40] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:40] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:40] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:41] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:41] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:41] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:41] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:41] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:42] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:42] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:42] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:42] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:43] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:45] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:45] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:45] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:45] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:45] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:45] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:45] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:46] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:46] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:46] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:46] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:46] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:47] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:47] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:47] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:47] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:47] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 151 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:40:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:02] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:02] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:02] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:02] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:03] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:03] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:03] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:03] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:03] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:03] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:04] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:04] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:04] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:04] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:10] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 60078ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60803 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), p0, p0, (AND (NOT p2) p0), false, true, (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 71209 steps with 0 reset in 203 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-06 finished in 61299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 44 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
[2025-06-07 13:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:41:23] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-07 13:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:41:24] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 13:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:40] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:40] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:40] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:40] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:40] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:41] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:41] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:41] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:41] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:42] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:42] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:42] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:42] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:43] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:45] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:45] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:46] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:46] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:46] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:46] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:47] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:47] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:47] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:47] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:47] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:47] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:47] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:41:48] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 151 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:03] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:03] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:04] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:04] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:04] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:04] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:04] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:05] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:05] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:05] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:05] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:05] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:05] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:06] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:06] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:11] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/1272 variables, and 172 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-08
Product exploration explored 100000 steps with 915 reset in 282 ms.
Product exploration explored 100000 steps with 946 reset in 285 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 418 steps (0 resets) in 10 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-07 13:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 13:42:26] [INFO ] [Real]Absence check using 111 positive place invariants in 86 ms returned sat
[2025-06-07 13:42:27] [INFO ] [Real]Absence check using state equation in 1387 ms returned sat
[2025-06-07 13:42:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 13:42:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 85 ms returned sat
[2025-06-07 13:42:29] [INFO ] [Nat]Absence check using state equation in 1449 ms returned sat
[2025-06-07 13:42:29] [INFO ] Computed and/alt/rep : 600/891/600 causal constraints (skipped 0 transitions) in 26 ms.
[2025-06-07 13:42:36] [INFO ] Added : 597 causal constraints over 120 iterations in 7609 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 671 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 601/601 transitions.
Applied a total of 0 rules in 19 ms. Remains 671 /671 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2025-06-07 13:42:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:42:37] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-07 13:42:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:42:37] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 13:42:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:53] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:53] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:53] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:53] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:53] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:54] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:54] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:54] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:54] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:55] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:55] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:55] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:55] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:57] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:57] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:58] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:58] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:58] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:58] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:58] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:58] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:59] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:59] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:59] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:59] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:59] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:42:59] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:00] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:00] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:00] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 151 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:13] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:16] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:16] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:16] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:16] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:17] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:17] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:17] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:17] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:18] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:18] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:18] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:18] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:18] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:43:23] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/843 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1443 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in LTL mode , in 1 iterations and 60712 ms. Remains : 671/671 places, 601/601 transitions.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 622 steps (0 resets) in 10 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-07 13:43:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 13:43:38] [INFO ] [Real]Absence check using 111 positive place invariants in 88 ms returned sat
[2025-06-07 13:43:39] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2025-06-07 13:43:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 13:43:40] [INFO ] [Nat]Absence check using 111 positive place invariants in 82 ms returned sat
[2025-06-07 13:43:41] [INFO ] [Nat]Absence check using state equation in 1400 ms returned sat
[2025-06-07 13:43:41] [INFO ] Computed and/alt/rep : 600/891/600 causal constraints (skipped 0 transitions) in 27 ms.
[2025-06-07 13:43:48] [INFO ] Added : 597 causal constraints over 120 iterations in 7351 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 899 reset in 222 ms.
Product exploration explored 100000 steps with 926 reset in 232 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 671 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 671/671 places, 601/601 transitions.
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 671 transition count 601
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 136 place count 671 transition count 641
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 188 place count 671 transition count 641
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 375 places in 1 ms
Iterating global reduction 1 with 187 rules applied. Total rules applied 375 place count 671 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 376 place count 671 transition count 640
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 446 place count 601 transition count 570
Deduced a syphon composed of 305 places in 1 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 516 place count 601 transition count 570
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 306 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 517 place count 601 transition count 570
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 519 place count 599 transition count 568
Deduced a syphon composed of 304 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 521 place count 599 transition count 568
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -155
Deduced a syphon composed of 341 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 558 place count 599 transition count 723
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 595 place count 562 transition count 649
Deduced a syphon composed of 304 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 632 place count 562 transition count 649
Deduced a syphon composed of 304 places in 0 ms
Applied a total of 632 rules in 183 ms. Remains 562 /671 variables (removed 109) and now considering 649/601 (removed -48) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 13:43:50] [INFO ] Redundant transitions in 42 ms returned []
Running 648 sub problems to find dead transitions.
// Phase 1: matrix 649 rows 562 cols
[2025-06-07 13:43:50] [INFO ] Computed 111 invariants in 4 ms
[2025-06-07 13:43:50] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (OVERLAPS) 1/562 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/131 constraints. Problems are: Problem set: 116 solved, 532 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 4 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 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 TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 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 TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/151 constraints. Problems are: Problem set: 229 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:10] [INFO ] Deduced a trap composed of 4 places in 27 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 TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/171 constraints. Problems are: Problem set: 333 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD112 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD126 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD135 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD140 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
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 TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/191 constraints. Problems are: Problem set: 431 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD223 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:44:12] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 2/193 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/193 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 649/1211 variables, 562/755 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1211 variables, 66/821 constraints. Problems are: Problem set: 435 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/1211 variables, and 821 constraints, problems are : Problem set: 435 solved, 213 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 562/562 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 435 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 305/562 variables, 111/111 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 82/193 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 0/193 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 649/1211 variables, 562/755 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1211 variables, 66/821 constraints. Problems are: Problem set: 435 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1211 variables, 213/1034 constraints. Problems are: Problem set: 435 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/1211 variables, and 1034 constraints, problems are : Problem set: 435 solved, 213 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 562/562 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 213/648 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 435 solved, 213 unsolved
Search for dead transitions found 435 dead transitions in 60199ms
Found 435 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 435 transitions
Dead transitions reduction (with SMT) removed 435 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 562/671 places, 214/601 transitions.
Graph (complete) has 722 edges and 562 vertex of which 258 are kept as prefixes of interest. Removing 304 places using SCC suffix rule.1 ms
Discarding 304 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 258 /562 variables (removed 304) and now considering 214/214 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/671 places, 214/601 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60481 ms. Remains : 258/671 places, 214/601 transitions.
Built C files in :
/tmp/ltsmin11105681228988310282
[2025-06-07 13:44:50] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11105681228988310282
Running compilation step : cd /tmp/ltsmin11105681228988310282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1135 ms.
Running link step : cd /tmp/ltsmin11105681228988310282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11105681228988310282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased515007924057301816.hoa' '--buchi-type=spotba'
LTSmin run took 2527 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-08 finished in 210275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(G((p0 U p1)) U X(G(p0))))'
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 40 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
// Phase 1: matrix 601 rows 671 cols
[2025-06-07 13:44:54] [INFO ] Computed 111 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:44:54] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-06-07 13:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:44:54] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 13:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:10] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:10] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:10] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:10] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:11] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:11] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:11] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:11] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:11] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:12] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:12] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:12] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:12] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:12] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:13] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:15] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:16] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:16] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:16] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:16] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:17] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:17] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:17] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:17] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:17] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 151 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:33] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:33] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:33] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:34] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:35] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:35] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:35] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:35] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:35] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:40] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/843 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 600/1443 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1443 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60803 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 140 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-12
Product exploration explored 100000 steps with 34284 reset in 160 ms.
Product exploration explored 100000 steps with 34452 reset in 164 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (OR p0 p1)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), false]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
[2025-06-07 13:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 634/671 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:55] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:55] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 7/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:56] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1272 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1272 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1272 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 634/671 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/671 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 601/1272 variables, 671/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1272 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1272 variables, 3/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1272 variables, 1/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1272 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:57] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:45:58] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/1272 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1272 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1272 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 811 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 3 out of 671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 671/671 places, 601/601 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 671 transition count 464
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 534 transition count 464
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 274 place count 534 transition count 384
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 434 place count 454 transition count 384
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 772 place count 285 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 773 place count 285 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 775 place count 284 transition count 213
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 829 place count 257 transition count 213
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 858 place count 257 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 859 place count 256 transition count 212
Applied a total of 859 rules in 57 ms. Remains 256 /671 variables (removed 415) and now considering 212/601 (removed 389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 256/671 places, 212/601 transitions.
RANDOM walk for 40000 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 789541 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 789541 steps, saw 468007 distinct states, run finished after 3006 ms. (steps per millisecond=262 ) properties seen :0
// Phase 1: matrix 212 rows 256 cols
[2025-06-07 13:46:01] [INFO ] Computed 111 invariants in 1 ms
[2025-06-07 13:46:01] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/31 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/61 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/90 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/92 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/96 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/96 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 24/120 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/121 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/121 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/121 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/123 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/123 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 36/159 variables, 21/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/159 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/159 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/161 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/161 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/161 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/165 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/165 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 20/185 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/185 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/185 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 20/205 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/205 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/205 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 2/207 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/207 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/207 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 4/211 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/211 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 20/231 variables, 13/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/231 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/231 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 20/251 variables, 10/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/251 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/251 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 2/253 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/253 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/253 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 4/257 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/257 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 20/277 variables, 13/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/277 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/277 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 20/297 variables, 10/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/297 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/297 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 2/299 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/299 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/299 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 4/303 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/303 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 20/323 variables, 13/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/323 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/323 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 20/343 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/343 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/343 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 2/345 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/345 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/345 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 4/349 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/349 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 20/369 variables, 13/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/369 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/369 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 20/389 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/389 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/389 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/391 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/391 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/391 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 4/395 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/395 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 20/415 variables, 13/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/415 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/415 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 20/435 variables, 10/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/435 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/435 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 2/437 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/437 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/437 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 4/441 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/441 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 19/460 variables, 13/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/460 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/460 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 8/468 variables, 6/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/468 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/468 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 0/468 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 256/256 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/31 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:01] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/61 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 29/90 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/92 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/92 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/92 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/96 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/96 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 24/120 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/120 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/120 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/121 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/121 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/121 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/123 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/123 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 36/159 variables, 21/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/159 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/159 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/161 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/161 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/161 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/165 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/165 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 20/185 variables, 13/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/185 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/185 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 20/205 variables, 10/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/205 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/205 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 2/207 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/207 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:02] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/207 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/207 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 4/211 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/211 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 20/231 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/231 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/231 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 20/251 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/251 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:02] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:02] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/251 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/251 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 2/253 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/253 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/253 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 4/257 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/257 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 20/277 variables, 13/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/277 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/277 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 20/297 variables, 10/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/297 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/297 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 2/299 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/299 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/299 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 4/303 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/303 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 20/323 variables, 13/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/323 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/323 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 20/343 variables, 10/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/343 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/343 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 2/345 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/345 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/345 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 4/349 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/349 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 20/369 variables, 13/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/369 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/369 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 20/389 variables, 10/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/389 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/389 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 2/391 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/391 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/391 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 4/395 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/395 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 20/415 variables, 13/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/415 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/415 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 20/435 variables, 10/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/435 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/435 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 2/437 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/437 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/437 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 4/441 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/441 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 19/460 variables, 13/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/460 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/460 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 8/468 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/468 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/468 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 0/468 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 379 constraints, problems are : Problem set: 0 solved, 1 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 256/256 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1180ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2191 steps, including 324 resets, run visited all 1 properties in 9 ms. (steps per millisecond=243 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (OR p0 p1)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 9 factoid took 293 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), false]
Stuttering acceptance computed with spot in 128 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), false]
Support contains 3 out of 671 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 671/671 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 670 transition count 463
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 533 transition count 463
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 274 place count 533 transition count 383
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 434 place count 453 transition count 383
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 336 rules applied. Total rules applied 770 place count 285 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 771 place count 285 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 773 place count 284 transition count 213
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 827 place count 257 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 828 place count 256 transition count 212
Applied a total of 828 rules in 43 ms. Remains 256 /671 variables (removed 415) and now considering 212/601 (removed 389) transitions.
// Phase 1: matrix 212 rows 256 cols
[2025-06-07 13:46:03] [INFO ] Computed 111 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:46:03] [INFO ] Implicit Places using invariants in 127 ms returned [246]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/671 places, 212/601 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 255 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 253 transition count 210
Applied a total of 4 rules in 5 ms. Remains 253 /255 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 253 cols
[2025-06-07 13:46:03] [INFO ] Computed 110 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:46:03] [INFO ] Implicit Places using invariants in 124 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 125 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 251/671 places, 210/601 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 249 transition count 208
Applied a total of 4 rules in 5 ms. Remains 249 /251 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 249 cols
[2025-06-07 13:46:03] [INFO ] Computed 108 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:46:03] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-07 13:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:46:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-07 13:46:03] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 249/671 places, 208/601 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 636 ms. Remains : 249/671 places, 208/601 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 10 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-010B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-12 finished in 69844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 671 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 601
Applied a total of 4 rules in 24 ms. Remains 671 /673 variables (removed 2) and now considering 601/603 (removed 2) transitions.
// Phase 1: matrix 601 rows 671 cols
[2025-06-07 13:46:03] [INFO ] Computed 111 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:46:04] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-07 13:46:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:46:04] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-07 13:46:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:20] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:20] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:20] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:21] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:21] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:21] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:21] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:21] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:21] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:22] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:22] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:22] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:22] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:23] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:23] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:25] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:26] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:26] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:26] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:26] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:26] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:27] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:27] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:27] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:27] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:27] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:27] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:28] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:28] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:28] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 151 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:43] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:43] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:43] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:45] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:45] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:45] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:45] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 13:46:50] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/843 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 600/1443 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1443 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 601/603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 671/673 places, 601/603 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-15 finished in 60800 ms.
All properties solved by simple procedures.
Total runtime 531619 ms.
BK_STOP 1749304024733
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-010B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-010B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533500867"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;