About the Execution of ITS-Tools for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?T????T?T?????FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533700951.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-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533700951
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.9M 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-100B-ReachabilityFireability-2023-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749351414796
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 02:56:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 02:56:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 02:56:56] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2025-06-08 02:56:56] [INFO ] Transformed 7803 places.
[2025-06-08 02:56:56] [INFO ] Transformed 7103 transitions.
[2025-06-08 02:56:56] [INFO ] Found NUPN structural information;
[2025-06-08 02:56:56] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 750 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3463 ms. (11 steps per ms) remains 14/16 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 14/14 properties
[2025-06-08 02:56:58] [INFO ] Flatten gal took : 806 ms
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
[2025-06-08 02:56:58] [INFO ] Flatten gal took : 274 ms
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 479 ms. (83 steps per ms) remains 14/14 properties
[2025-06-08 02:56:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16007391888266096533.gal : 188 ms
[2025-06-08 02:56:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10318198998004532196.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16007391888266096533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10318198998004532196.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 14/14 properties
// Phase 1: matrix 7103 rows 7803 cols
[2025-06-08 02:56:59] [INFO ] Computed 1101 invariants in 69 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality10318198998004532196.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 5532/5744 variables, 784/996 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5744 variables, 5532/6528 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5744/14906 variables, and 6528 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5180 ms.
Refiners :[Domain max(s): 5744/7803 constraints, Positive P Invariants (semi-flows): 784/1101 constraints, State Equation: 0/7803 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 5532/5744 variables, 784/996 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5744 variables, 5532/6528 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:09] [INFO ] Deduced a trap composed of 20 places in 1398 ms of which 111 ms to minimize.
SMT process timed out in 10664ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 212 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1721 transitions
Trivial Post-agglo rules discarded 1721 transitions
Performed 1721 trivial Post agglomeration. Transition count delta: 1721
Iterating post reduction 0 with 1721 rules applied. Total rules applied 1721 place count 7803 transition count 5382
Reduce places removed 1721 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1723 rules applied. Total rules applied 3444 place count 6082 transition count 5380
Reduce places removed 1 places and 0 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Iterating post reduction 2 with 66 rules applied. Total rules applied 3510 place count 6081 transition count 5315
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 3575 place count 6016 transition count 5315
Performed 428 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 428 Pre rules applied. Total rules applied 3575 place count 6016 transition count 4887
Deduced a syphon composed of 428 places in 23 ms
Reduce places removed 428 places and 0 transitions.
Iterating global reduction 4 with 856 rules applied. Total rules applied 4431 place count 5588 transition count 4887
Discarding 663 places :
Symmetric choice reduction at 4 with 663 rule applications. Total rules 5094 place count 4925 transition count 4224
Iterating global reduction 4 with 663 rules applied. Total rules applied 5757 place count 4925 transition count 4224
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 258 Pre rules applied. Total rules applied 5757 place count 4925 transition count 3966
Deduced a syphon composed of 258 places in 27 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 4 with 516 rules applied. Total rules applied 6273 place count 4667 transition count 3966
Performed 1608 Post agglomeration using F-continuation condition.Transition count delta: 1608
Deduced a syphon composed of 1608 places in 31 ms
Reduce places removed 1608 places and 0 transitions.
Iterating global reduction 4 with 3216 rules applied. Total rules applied 9489 place count 3059 transition count 2358
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9691 place count 2958 transition count 2358
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9893 place count 2857 transition count 2358
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 7 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 10001 place count 2803 transition count 2358
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 10016 place count 2803 transition count 2343
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 10031 place count 2788 transition count 2343
Partial Free-agglomeration rule applied 281 times.
Drop transitions (Partial Free agglomeration) removed 281 transitions
Iterating global reduction 5 with 281 rules applied. Total rules applied 10312 place count 2788 transition count 2343
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10313 place count 2787 transition count 2342
Applied a total of 10313 rules in 3703 ms. Remains 2787 /7803 variables (removed 5016) and now considering 2342/7103 (removed 4761) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3710 ms. Remains : 2787/7803 places, 2342/7103 transitions.
RANDOM walk for 40000 steps (8 resets) in 1558 ms. (25 steps per ms) remains 13/14 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 811 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 12/13 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 580 ms. (68 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 558 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 567 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 594 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 657 ms. (60 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 611 ms. (65 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 580 ms. (68 steps per ms) remains 12/12 properties
// Phase 1: matrix 2342 rows 2787 cols
[2025-06-08 02:57:16] [INFO ] Computed 1101 invariants in 9 ms
[2025-06-08 02:57:16] [INFO ] State equation strengthened by 390 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/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1834/2008 variables, 764/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2008 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 62/2070 variables, 28/792 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2070 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1825/3895 variables, 2070/2862 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3895 variables, 374/3236 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3895 variables, 0/3236 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 358/4253 variables, 204/3440 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4253 variables, 70/3510 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4253 variables, 5/3515 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4253 variables, 0/3515 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 22/4275 variables, 22/3537 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4275 variables, 18/3555 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4275 variables, 0/3555 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 56/4331 variables, 27/3582 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4331 variables, 0/3582 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 299/4630 variables, 191/3773 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4630 variables, 46/3819 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4630 variables, 8/3827 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4630 variables, 0/3827 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 17/4647 variables, 17/3844 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4647 variables, 15/3859 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4647 variables, 0/3859 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 26/4673 variables, 13/3872 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4673 variables, 0/3872 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 254/4927 variables, 163/4035 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4927 variables, 49/4084 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4927 variables, 2/4086 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4927 variables, 0/4086 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 15/4942 variables, 15/4101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4942 variables, 11/4112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4942 variables, 0/4112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 22/4964 variables, 11/4123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4964 variables, 0/4123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (OVERLAPS) 90/5054 variables, 67/4190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5054 variables, 14/4204 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5054 variables, 1/4205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5054 variables, 0/4205 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 5/5059 variables, 6/4211 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :19 after 36
At refinement iteration 40 (INCLUDED_ONLY) 0/5059 variables, 5/4216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :69 after 118
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :118 after 5935
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :5935 after 9.17035e+07
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :9.17035e+07 after 4.01557e+14
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :4.01557e+14 after 4.83162e+30
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :4.83162e+30 after 6.79827e+72
At refinement iteration 41 (INCLUDED_ONLY) 0/5059 variables, 0/4216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (OVERLAPS) 4/5063 variables, 2/4218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Invariant property ShieldPPPt-PT-100B-ReachabilityFireability-2025-14 does not hold.
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :6.79827e+72 after 7.77253e+197
At refinement iteration 43 (INCLUDED_ONLY) 0/5063 variables, 0/4218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (OVERLAPS) 51/5114 variables, 31/4249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/5114 variables, 8/4257 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5114 variables, 0/4257 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (OVERLAPS) 4/5118 variables, 5/4262 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5118 variables, 2/4264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/5118 variables, 0/4264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (OVERLAPS) 11/5129 variables, 10/4274 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/5129 variables, 4/4278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/5129 variables, 0/4278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 0/5129 variables, 0/4278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5129/5129 variables, and 4278 constraints, problems are : Problem set: 0 solved, 12 unsolved in 33970 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2787/2787 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1834/2008 variables, 764/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:50] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:51] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:51] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:51] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:51] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:52] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:52] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:52] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:53] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:53] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:53] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:53] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:54] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:54] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:54] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:54] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:55] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:55] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:55] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:55] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2008 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:56] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:56] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:56] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:56] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:57] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:57] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:57] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:57] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:58] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:58] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:58] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:58] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:59] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:59] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:59] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:59] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:57:59] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:00] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:00] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:00] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2008 variables, 20/804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:00] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:01] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:01] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:01] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:01] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:02] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:02] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:02] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:02] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:02] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:03] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:03] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:03] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:03] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:04] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:04] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:04] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:04] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:05] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:05] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2008 variables, 20/824 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:05] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:05] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:06] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:06] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:06] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:06] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2008 variables, 6/830 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:07] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:07] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:08] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:08] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2008 variables, 4/834 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:08] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:08] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:09] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:09] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:09] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:09] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2008 variables, 6/840 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:10] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:10] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:11] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2008 variables, 3/843 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:12] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:12] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:12] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:12] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2008 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2008 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 62/2070 variables, 28/875 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:14] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:14] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:14] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:14] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:15] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:15] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:15] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:15] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2070 variables, 8/883 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:16] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2070 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:16] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:17] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:17] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:17] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2070 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:18] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:19] [INFO ] Deduced a trap composed of 10 places in 405 ms of which 18 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2070 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2070 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 1825/3895 variables, 2070/2960 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3895 variables, 374/3334 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3895 variables, 4/3338 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:29] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:29] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:30] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:30] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:31] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:31] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:31] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:32] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:32] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:33] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:33] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:34] [INFO ] Deduced a trap composed of 9 places in 318 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:34] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:58:35] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 18 ms to minimize.
SMT process timed out in 79295ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 16962 ms.
Support contains 174 out of 2787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2787/2787 places, 2342/2342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 2787 transition count 2332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 2777 transition count 2332
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 20 place count 2777 transition count 2324
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 36 place count 2769 transition count 2324
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 86 place count 2744 transition count 2299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 2741 transition count 2299
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 2741 transition count 2299
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 2736 transition count 2294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 2735 transition count 2294
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 102 place count 2735 transition count 2292
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 2733 transition count 2292
Applied a total of 106 rules in 588 ms. Remains 2733 /2787 variables (removed 54) and now considering 2292/2342 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 2733/2787 places, 2292/2342 transitions.
RANDOM walk for 40000 steps (8 resets) in 1196 ms. (33 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 360 ms. (110 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 592 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 587 ms. (68 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 570 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 562 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 585 ms. (68 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 593 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 678 ms. (58 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 553 ms. (72 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 125141 steps, run timeout after 6001 ms. (steps per millisecond=20 ) properties seen :0 out of 12
Probabilistic random walk after 125141 steps, saw 113486 distinct states, run finished after 6009 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 2292 rows 2733 cols
[2025-06-08 02:59:01] [INFO ] Computed 1100 invariants in 18 ms
[2025-06-08 02:59:01] [INFO ] State equation strengthened by 387 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1798/1972 variables, 764/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1972 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 62/2034 variables, 28/792 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2034 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1791/3825 variables, 2034/2826 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3825 variables, 381/3207 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3825 variables, 0/3207 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 355/4180 variables, 203/3410 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4180 variables, 73/3483 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4180 variables, 5/3488 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4180 variables, 0/3488 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 19/4199 variables, 19/3507 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4199 variables, 19/3526 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4199 variables, 0/3526 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 38/4237 variables, 19/3545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4237 variables, 0/3545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 295/4532 variables, 175/3720 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4532 variables, 50/3770 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4532 variables, 1/3771 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4532 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 15/4547 variables, 16/3787 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4547 variables, 15/3802 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4547 variables, 0/3802 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 27/4574 variables, 14/3816 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4574 variables, 1/3817 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4574 variables, 0/3817 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 261/4835 variables, 167/3984 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4835 variables, 53/4037 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4835 variables, 0/4037 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 12/4847 variables, 14/4051 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4847 variables, 12/4063 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4847 variables, 0/4063 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 20/4867 variables, 10/4073 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4867 variables, 0/4073 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (OVERLAPS) 86/4953 variables, 61/4134 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4953 variables, 16/4150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4953 variables, 0/4150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 3/4956 variables, 4/4154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/4956 variables, 3/4157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4956 variables, 0/4157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 4/4960 variables, 2/4159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4960 variables, 0/4159 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 53/5013 variables, 33/4192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5013 variables, 10/4202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/5013 variables, 0/4202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 2/5015 variables, 4/4206 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/5015 variables, 2/4208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5015 variables, 0/4208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 10/5025 variables, 8/4216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/5025 variables, 4/4220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/5025 variables, 0/4220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (OVERLAPS) 0/5025 variables, 0/4220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5025/5025 variables, and 4220 constraints, problems are : Problem set: 0 solved, 12 unsolved in 27066 ms.
Refiners :[Positive P Invariants (semi-flows): 1100/1100 constraints, State Equation: 2733/2733 constraints, ReadFeed: 387/387 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1798/1972 variables, 764/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:29] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:29] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:29] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:29] [INFO ] Deduced a trap composed of 8 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-08 02:59:29] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:29] [INFO ] Deduced a trap composed of 9 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-08 02:59:29] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:30] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:30] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:30] [INFO ] Deduced a trap composed of 11 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-08 02:59:30] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:30] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:30] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:30] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:30] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:31] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:31] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:31] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:31] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:31] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1972 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:31] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:31] [INFO ] Deduced a trap composed of 10 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-08 02:59:32] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:32] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:32] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:32] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:32] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:32] [INFO ] Deduced a trap composed of 14 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-08 02:59:32] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:32] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:33] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:33] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:33] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:33] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:33] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:34] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:34] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:34] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:34] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:34] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1972 variables, 20/804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:34] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:34] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:35] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:35] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1972 variables, 4/808 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:35] [INFO ] Deduced a trap composed of 12 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-08 02:59:35] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1972 variables, 2/810 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1972 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 62/2034 variables, 28/838 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:37] [INFO ] Deduced a trap composed of 6 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-08 02:59:37] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:37] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:37] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:37] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:38] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:38] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:38] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:38] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:38] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:38] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:38] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:39] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:39] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2034 variables, 14/852 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2034 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1791/3825 variables, 2034/2886 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3825 variables, 381/3267 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3825 variables, 4/3271 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:45] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:46] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:46] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:47] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:47] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:47] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:48] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:48] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:49] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:49] [INFO ] Deduced a trap composed of 11 places in 318 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:50] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:50] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:50] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:51] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:51] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:52] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:53] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:53] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:54] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:54] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 18 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3825 variables, 20/3291 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:56] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:59:57] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 13 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3825 variables, 2/3293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:01] [INFO ] Deduced a trap along path composed of 2 places in 376 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:01] [INFO ] Deduced a trap along path composed of 2 places in 93 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:02] [INFO ] Deduced a trap along path composed of 2 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:02] [INFO ] Deduced a trap along path composed of 2 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:02] [INFO ] Deduced a trap along path composed of 2 places in 53 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:02] [INFO ] Deduced a trap along path composed of 2 places in 70 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:02] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:03] [INFO ] Deduced a trap along path composed of 2 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:03] [INFO ] Deduced a trap along path composed of 2 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:03] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:03] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:03] [INFO ] Deduced a trap along path composed of 2 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:03] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:04] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:04] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:04] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:04] [INFO ] Deduced a trap along path composed of 2 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:04] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:05] [INFO ] Deduced a trap along path composed of 2 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:05] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3825 variables, 20/3313 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:07] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:08] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:09] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:09] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:10] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 13 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3825 variables, 5/3318 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:12] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:13] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3825 variables, 2/3320 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:17] [INFO ] Deduced a trap along path composed of 2 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:17] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:17] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:17] [INFO ] Deduced a trap along path composed of 2 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-08 03:00:17] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:18] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:18] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:18] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:18] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:18] [INFO ] Deduced a trap along path composed of 2 places in 55 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:18] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:19] [INFO ] Deduced a trap along path composed of 3 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-08 03:00:19] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:19] [INFO ] Deduced a trap along path composed of 2 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:19] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:19] [INFO ] Deduced a trap along path composed of 2 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-08 03:00:20] [INFO ] Deduced a trap along path composed of 3 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-08 03:00:20] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:20] [INFO ] Deduced a trap along path composed of 2 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-08 03:00:20] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3825 variables, 20/3340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:23] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 13 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3825 variables, 1/3341 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:28] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:28] [INFO ] Deduced a trap along path composed of 2 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-08 03:00:28] [INFO ] Deduced a trap along path composed of 2 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-08 03:00:29] [INFO ] Deduced a trap along path composed of 2 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-08 03:00:29] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:29] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:29] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:29] [INFO ] Deduced a trap along path composed of 2 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-08 03:00:29] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:29] [INFO ] Deduced a trap along path composed of 2 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-08 03:00:30] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:30] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:31] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3825 variables, 13/3354 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:00:36] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3825 variables, 1/3355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3825 variables, 0/3355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 102158ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 2733 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2733/2733 places, 2292/2292 transitions.
Applied a total of 0 rules in 116 ms. Remains 2733 /2733 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 2733/2733 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2733/2733 places, 2292/2292 transitions.
Applied a total of 0 rules in 111 ms. Remains 2733 /2733 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
[2025-06-08 03:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:00:45] [INFO ] Implicit Places using invariants in 1453 ms returned [2716, 2720]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1472 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2731/2733 places, 2292/2292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2729 transition count 2290
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2729 transition count 2290
Applied a total of 4 rules in 209 ms. Remains 2729 /2731 variables (removed 2) and now considering 2290/2292 (removed 2) transitions.
// Phase 1: matrix 2290 rows 2729 cols
[2025-06-08 03:00:45] [INFO ] Computed 1098 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:00:47] [INFO ] Implicit Places using invariants in 1645 ms returned []
[2025-06-08 03:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:00:48] [INFO ] State equation strengthened by 385 read => feed constraints.
[2025-06-08 03:01:05] [INFO ] Implicit Places using invariants and state equation in 18688 ms returned []
Implicit Place search using SMT with State Equation took 20338 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2729/2733 places, 2290/2292 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22131 ms. Remains : 2729/2733 places, 2290/2292 transitions.
RANDOM walk for 40000 steps (8 resets) in 939 ms. (42 steps per ms) remains 11/12 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 454 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 485 ms. (82 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 712 ms. (56 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 864 ms. (46 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 752 ms. (53 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 787 ms. (50 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 561 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 508 ms. (78 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 127379 steps, run timeout after 6001 ms. (steps per millisecond=21 ) properties seen :0 out of 11
Probabilistic random walk after 127379 steps, saw 108054 distinct states, run finished after 6003 ms. (steps per millisecond=21 ) properties seen :0
[2025-06-08 03:01:14] [INFO ] Invariant cache hit.
[2025-06-08 03:01:14] [INFO ] State equation strengthened by 385 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1805/1965 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1965 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 60/2025 variables, 27/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2025 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1779/3804 variables, 2025/2814 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3804 variables, 380/3194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3804 variables, 0/3194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 344/4148 variables, 195/3389 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4148 variables, 70/3459 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4148 variables, 5/3464 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4148 variables, 0/3464 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 18/4166 variables, 18/3482 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4166 variables, 18/3500 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4166 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 36/4202 variables, 18/3518 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4202 variables, 0/3518 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 302/4504 variables, 177/3695 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4504 variables, 52/3747 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4504 variables, 0/3747 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 16/4520 variables, 16/3763 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4520 variables, 16/3779 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4520 variables, 0/3779 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 28/4548 variables, 14/3793 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4548 variables, 0/3793 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 264/4812 variables, 169/3962 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4812 variables, 53/4015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4812 variables, 0/4015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 12/4824 variables, 14/4029 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4824 variables, 12/4041 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4824 variables, 0/4041 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 18/4842 variables, 9/4050 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4842 variables, 0/4050 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (OVERLAPS) 101/4943 variables, 67/4117 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4943 variables, 16/4133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4943 variables, 0/4133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (OVERLAPS) 5/4948 variables, 8/4141 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4948 variables, 5/4146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4948 variables, 0/4146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (OVERLAPS) 4/4952 variables, 2/4148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4952 variables, 0/4148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (OVERLAPS) 55/5007 variables, 35/4183 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5007 variables, 11/4194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5007 variables, 0/4194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (OVERLAPS) 2/5009 variables, 4/4198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/5009 variables, 2/4200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5009 variables, 0/4200 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 10/5019 variables, 8/4208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5019 variables, 4/4212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/5019 variables, 0/4212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (OVERLAPS) 0/5019 variables, 0/4212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5019/5019 variables, and 4212 constraints, problems are : Problem set: 0 solved, 11 unsolved in 26328 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2729/2729 constraints, ReadFeed: 385/385 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1805/1965 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:41] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:41] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:41] [INFO ] Deduced a trap composed of 7 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:42] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:42] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:42] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:43] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:43] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:43] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:44] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:44] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:44] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:44] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:45] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:45] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:45] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:46] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:46] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:46] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:47] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1965 variables, 20/782 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:47] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:47] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:47] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:48] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:48] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:48] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:49] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:49] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:49] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:50] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:50] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:50] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:50] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:51] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:51] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:51] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:52] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:52] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:52] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:52] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1965 variables, 20/802 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:53] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:53] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:53] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:54] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:54] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:54] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:54] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:55] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:55] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:55] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:55] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:56] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:56] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:56] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:57] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:57] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:57] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:57] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:58] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:58] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1965 variables, 20/822 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:58] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:58] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:59] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:59] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:59] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:59] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:00] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:00] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:00] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:00] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:01] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:01] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:01] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:01] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:01] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:02] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:02] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:02] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:03] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:03] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1965 variables, 20/842 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:03] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:03] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:04] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1965 variables, 3/845 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:04] [INFO ] Deduced a trap composed of 12 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-08 03:02:05] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1965 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:05] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:06] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:06] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:06] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:07] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1965 variables, 5/852 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:07] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:08] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1965 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1965 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 60/2025 variables, 27/881 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:09] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:09] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:09] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:10] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:10] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:10] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:10] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:11] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:11] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2025 variables, 9/890 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:12] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:12] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2025 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:13] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:13] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 9 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2025 variables, 2/894 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:14] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:14] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 10 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2025 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:15] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 9 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2025 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2025 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 1779/3804 variables, 2025/2922 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3804 variables, 380/3302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3804 variables, 4/3306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:23] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:24] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:24] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:25] [INFO ] Deduced a trap composed of 10 places in 316 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:25] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:26] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:26] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:27] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:29] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 15 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3804 variables, 9/3315 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:31] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 13 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3804 variables, 1/3316 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:35] [INFO ] Deduced a trap along path composed of 2 places in 62 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:35] [INFO ] Deduced a trap along path composed of 2 places in 68 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:35] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:35] [INFO ] Deduced a trap along path composed of 2 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:36] [INFO ] Deduced a trap along path composed of 2 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:36] [INFO ] Deduced a trap along path composed of 2 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:36] [INFO ] Deduced a trap along path composed of 2 places in 116 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:36] [INFO ] Deduced a trap along path composed of 2 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:36] [INFO ] Deduced a trap along path composed of 2 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:37] [INFO ] Deduced a trap along path composed of 2 places in 117 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:37] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:37] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:37] [INFO ] Deduced a trap along path composed of 2 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:37] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:37] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:38] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:38] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:38] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:38] [INFO ] Deduced a trap along path composed of 2 places in 73 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:38] [INFO ] Deduced a trap along path composed of 2 places in 85 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/3804 variables, 20/3336 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:41] [INFO ] Deduced a trap composed of 9 places in 594 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:42] [INFO ] Deduced a trap composed of 14 places in 600 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:43] [INFO ] Deduced a trap composed of 9 places in 571 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:44] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:44] [INFO ] Deduced a trap composed of 10 places in 545 ms of which 28 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/3804 variables, 5/3341 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:48] [INFO ] Deduced a trap along path composed of 2 places in 95 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:49] [INFO ] Deduced a trap along path composed of 2 places in 916 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:49] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:49] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:50] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:50] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:50] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:52] [INFO ] Deduced a trap along path composed of 2 places in 2288 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:53] [INFO ] Deduced a trap along path composed of 2 places in 470 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:53] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:53] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:53] [INFO ] Deduced a trap along path composed of 3 places in 64 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:54] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:54] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:54] [INFO ] Deduced a trap along path composed of 2 places in 58 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:54] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:54] [INFO ] Deduced a trap along path composed of 2 places in 51 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:55] [INFO ] Deduced a trap along path composed of 3 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:55] [INFO ] Deduced a trap along path composed of 2 places in 91 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:55] [INFO ] Deduced a trap along path composed of 2 places in 56 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/3804 variables, 20/3361 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:59] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 13 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3804 variables, 1/3362 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:08] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:08] [INFO ] Deduced a trap along path composed of 2 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-08 03:03:09] [INFO ] Deduced a trap along path composed of 2 places in 67 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:09] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:09] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:09] [INFO ] Deduced a trap along path composed of 2 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-08 03:03:10] [INFO ] Deduced a trap along path composed of 2 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-08 03:03:10] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:10] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3804/5019 variables, and 3371 constraints, problems are : Problem set: 0 solved, 11 unsolved in 90024 ms.
Refiners :[Positive P Invariants (semi-flows): 789/1098 constraints, State Equation: 2025/2729 constraints, ReadFeed: 380/385 constraints, PredecessorRefiner: 4/11 constraints, Known Traps: 124/124 constraints, Known Traps Along Path: 49/49 constraints]
After SMT, in 116395ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 160 out of 2729 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2729/2729 places, 2290/2290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2729 transition count 2289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2728 transition count 2289
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 2728 transition count 2285
Deduced a syphon composed of 4 places in 27 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 2724 transition count 2285
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 6 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 2710 transition count 2271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 2708 transition count 2271
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2708 transition count 2271
Applied a total of 43 rules in 663 ms. Remains 2708 /2729 variables (removed 21) and now considering 2271/2290 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. Remains : 2708/2729 places, 2271/2290 transitions.
RANDOM walk for 40000 steps (8 resets) in 1816 ms. (22 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1148 ms. (34 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 658 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1038 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 627 ms. (63 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1198 ms. (33 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 891 ms. (44 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 877 ms. (45 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 753 ms. (53 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 847 ms. (47 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 778 ms. (51 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 104142 steps, run timeout after 9005 ms. (steps per millisecond=11 ) properties seen :0 out of 11
Probabilistic random walk after 104142 steps, saw 78808 distinct states, run finished after 9006 ms. (steps per millisecond=11 ) properties seen :0
// Phase 1: matrix 2271 rows 2708 cols
[2025-06-08 03:03:23] [INFO ] Computed 1098 invariants in 12 ms
[2025-06-08 03:03:23] [INFO ] State equation strengthened by 393 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1786/1946 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1946 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 60/2006 variables, 27/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2006 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1761/3767 variables, 2006/2795 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3767 variables, 387/3182 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3767 variables, 0/3182 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 345/4112 variables, 195/3377 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4112 variables, 70/3447 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4112 variables, 6/3453 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4112 variables, 0/3453 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 18/4130 variables, 18/3471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4130 variables, 18/3489 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4130 variables, 0/3489 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 36/4166 variables, 18/3507 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4166 variables, 0/3507 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 301/4467 variables, 177/3684 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4467 variables, 52/3736 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4467 variables, 0/3736 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 15/4482 variables, 16/3752 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4482 variables, 15/3767 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4482 variables, 0/3767 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 28/4510 variables, 14/3781 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4510 variables, 0/3781 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 263/4773 variables, 169/3950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4773 variables, 54/4004 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4773 variables, 0/4004 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 11/4784 variables, 13/4017 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4784 variables, 11/4028 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4784 variables, 0/4028 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 18/4802 variables, 9/4037 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4802 variables, 0/4037 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (OVERLAPS) 101/4903 variables, 67/4104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4903 variables, 16/4120 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4903 variables, 0/4120 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (OVERLAPS) 5/4908 variables, 8/4128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4908 variables, 5/4133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4908 variables, 0/4133 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (OVERLAPS) 4/4912 variables, 2/4135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4912 variables, 0/4135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (OVERLAPS) 55/4967 variables, 35/4170 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4967 variables, 11/4181 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/4967 variables, 0/4181 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (OVERLAPS) 2/4969 variables, 4/4185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4969 variables, 2/4187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/4969 variables, 0/4187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 10/4979 variables, 8/4195 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4979 variables, 4/4199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4979 variables, 0/4199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (OVERLAPS) 0/4979 variables, 0/4199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4979/4979 variables, and 4199 constraints, problems are : Problem set: 0 solved, 11 unsolved in 36683 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2708/2708 constraints, ReadFeed: 393/393 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1786/1946 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:04] [INFO ] Deduced a trap composed of 5 places in 4124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:05] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:05] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:09] [INFO ] Deduced a trap composed of 6 places in 4188 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:09] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:09] [INFO ] Deduced a trap composed of 7 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-08 03:04:10] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:10] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:10] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:10] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:10] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:10] [INFO ] Deduced a trap composed of 9 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-08 03:04:10] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:11] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:11] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:11] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:11] [INFO ] Deduced a trap composed of 11 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-08 03:04:11] [INFO ] Deduced a trap composed of 11 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-08 03:04:11] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:11] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1946 variables, 20/782 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:11] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:12] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:12] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:12] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:12] [INFO ] Deduced a trap composed of 9 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-08 03:04:12] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:12] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1946 variables, 7/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:13] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:13] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:13] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1946 variables, 3/792 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1946 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 60/2006 variables, 27/819 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:15] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:15] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:15] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:15] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2006 variables, 4/823 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:16] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:16] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2006 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2006 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1761/3767 variables, 2006/2831 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3767 variables, 387/3218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3767 variables, 4/3222 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:22] [INFO ] Deduced a trap composed of 6 places in 470 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:23] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:23] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:23] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:24] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:24] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:24] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:25] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:25] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:25] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:26] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:26] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:26] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:27] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:27] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:29] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:29] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:30] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:30] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:30] [INFO ] Deduced a trap composed of 11 places in 306 ms of which 19 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3767 variables, 20/3242 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:32] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:32] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:33] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:33] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:34] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:34] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:35] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:35] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 14 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3767 variables, 8/3250 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:37] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:37] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:37] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:38] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:38] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:39] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:39] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:39] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:40] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 12 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3767 variables, 9/3259 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:42] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:43] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:43] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:43] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 14 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3767 variables, 4/3263 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:46] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3767 variables, 1/3264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:49] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 13 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3767 variables, 1/3265 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:51] [INFO ] Deduced a trap along path composed of 2 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:51] [INFO ] Deduced a trap along path composed of 2 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:51] [INFO ] Deduced a trap along path composed of 2 places in 85 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:51] [INFO ] Deduced a trap along path composed of 2 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:52] [INFO ] Deduced a trap along path composed of 2 places in 53 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:52] [INFO ] Deduced a trap along path composed of 2 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:52] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:52] [INFO ] Deduced a trap along path composed of 2 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:52] [INFO ] Deduced a trap along path composed of 2 places in 53 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:52] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:52] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:53] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:53] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:53] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:53] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:53] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:53] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:53] [INFO ] Deduced a trap along path composed of 2 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-08 03:04:54] [INFO ] Deduced a trap along path composed of 3 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-08 03:04:54] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3767 variables, 20/3285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:56] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:56] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 12 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3767 variables, 2/3287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:59] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:59] [INFO ] Deduced a trap along path composed of 2 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-08 03:04:59] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:59] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:00] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:00] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:00] [INFO ] Deduced a trap along path composed of 2 places in 67 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:00] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:00] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:00] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:01] [INFO ] Deduced a trap along path composed of 3 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-08 03:05:01] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:01] [INFO ] Deduced a trap along path composed of 3 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-08 03:05:01] [INFO ] Deduced a trap along path composed of 3 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-08 03:05:01] [INFO ] Deduced a trap along path composed of 3 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-08 03:05:01] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:01] [INFO ] Deduced a trap along path composed of 3 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-08 03:05:02] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:02] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:02] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3767 variables, 20/3307 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:05] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 10 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3767 variables, 1/3308 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:08] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:09] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 11 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/3767 variables, 2/3310 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:10] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:10] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:11] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:11] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:11] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:11] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:11] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:11] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:12] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/3767 variables, 9/3319 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:16] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:16] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:16] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:17] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:17] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:17] [INFO ] Deduced a trap along path composed of 2 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-08 03:05:17] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/3767 variables, 7/3326 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:19] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 12 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3767 variables, 1/3327 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:22] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/3767 variables, 1/3328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:25] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/3767 variables, 1/3329 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3767 variables, 0/3329 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 345/4112 variables, 195/3524 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4112 variables, 70/3594 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4112 variables, 6/3600 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4112 variables, 7/3607 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4112/4979 variables, and 3607 constraints, problems are : Problem set: 0 solved, 11 unsolved in 105033 ms.
Refiners :[Positive P Invariants (semi-flows): 859/1098 constraints, State Equation: 2201/2708 constraints, ReadFeed: 393/393 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 58/58 constraints]
After SMT, in 141780ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 160 out of 2708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2708/2708 places, 2271/2271 transitions.
Applied a total of 0 rules in 168 ms. Remains 2708 /2708 variables (removed 0) and now considering 2271/2271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 2708/2708 places, 2271/2271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2708/2708 places, 2271/2271 transitions.
Applied a total of 0 rules in 125 ms. Remains 2708 /2708 variables (removed 0) and now considering 2271/2271 (removed 0) transitions.
[2025-06-08 03:05:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:05:47] [INFO ] Implicit Places using invariants in 1465 ms returned []
[2025-06-08 03:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:05:48] [INFO ] State equation strengthened by 393 read => feed constraints.
[2025-06-08 03:06:02] [INFO ] Implicit Places using invariants and state equation in 15492 ms returned []
Implicit Place search using SMT with State Equation took 16961 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:06:02] [INFO ] Redundant transitions in 177 ms returned []
Running 2253 sub problems to find dead transitions.
[2025-06-08 03:06:02] [INFO ] Invariant cache hit.
[2025-06-08 03:06:02] [INFO ] State equation strengthened by 393 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2692 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2692/4979 variables, and 331 constraints, problems are : Problem set: 0 solved, 2253 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 331/1098 constraints, State Equation: 0/2708 constraints, ReadFeed: 0/393 constraints, PredecessorRefiner: 2253/2253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2692 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:01] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2692/4979 variables, and 332 constraints, problems are : Problem set: 0 solved, 2253 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 331/1098 constraints, State Equation: 0/2708 constraints, ReadFeed: 0/393 constraints, PredecessorRefiner: 0/2253 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60986ms problems are : Problem set: 0 solved, 2253 unsolved
Search for dead transitions found 0 dead transitions in 60996ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78283 ms. Remains : 2708/2708 places, 2271/2271 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 546 times.
Drop transitions (Partial Free agglomeration) removed 546 transitions
Iterating global reduction 0 with 546 rules applied. Total rules applied 546 place count 2708 transition count 2271
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 551 place count 2708 transition count 2266
Applied a total of 551 rules in 363 ms. Remains 2708 /2708 variables (removed 0) and now considering 2266/2271 (removed 5) transitions.
Running SMT prover for 11 properties.
Excessive predecessor constraint size, skipping predecessor.
// Phase 1: matrix 2266 rows 2708 cols
[2025-06-08 03:07:04] [INFO ] Computed 1098 invariants in 10 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 03:07:05] [INFO ] [Real]Absence check using 1098 positive place invariants in 192 ms returned sat
[2025-06-08 03:07:05] [INFO ] After 1018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 03:07:06] [INFO ] [Nat]Absence check using 1098 positive place invariants in 198 ms returned sat
[2025-06-08 03:07:09] [INFO ] After 2870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2025-06-08 03:07:09] [INFO ] State equation strengthened by 503 read => feed constraints.
[2025-06-08 03:07:21] [INFO ] After 12388ms SMT Verify possible using 503 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:23] [INFO ] Deduced a trap composed of 7 places in 680 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:24] [INFO ] Deduced a trap composed of 10 places in 688 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:25] [INFO ] Deduced a trap composed of 11 places in 1288 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:26] [INFO ] Deduced a trap composed of 11 places in 675 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:27] [INFO ] Deduced a trap composed of 11 places in 666 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:27] [INFO ] Deduced a trap composed of 11 places in 667 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:28] [INFO ] Deduced a trap composed of 11 places in 673 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:29] [INFO ] Deduced a trap composed of 11 places in 680 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:30] [INFO ] Deduced a trap composed of 12 places in 692 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:31] [INFO ] Deduced a trap composed of 12 places in 664 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:32] [INFO ] Deduced a trap composed of 13 places in 669 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:33] [INFO ] Deduced a trap composed of 12 places in 856 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:33] [INFO ] Deduced a trap composed of 13 places in 631 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:34] [INFO ] Deduced a trap composed of 11 places in 675 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:35] [INFO ] Deduced a trap composed of 11 places in 678 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:36] [INFO ] Deduced a trap composed of 11 places in 672 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:37] [INFO ] Deduced a trap composed of 13 places in 704 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:38] [INFO ] Deduced a trap composed of 11 places in 679 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:38] [INFO ] Deduced a trap composed of 13 places in 672 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:39] [INFO ] Deduced a trap composed of 14 places in 674 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:40] [INFO ] Deduced a trap composed of 12 places in 676 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:41] [INFO ] Deduced a trap composed of 6 places in 655 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:42] [INFO ] Deduced a trap composed of 15 places in 693 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:43] [INFO ] Deduced a trap composed of 19 places in 661 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:43] [INFO ] Deduced a trap composed of 14 places in 660 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:44] [INFO ] Deduced a trap composed of 27 places in 673 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:45] [INFO ] Deduced a trap composed of 15 places in 643 ms of which 29 ms to minimize.
[2025-06-08 03:07:45] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 23500 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:50] [INFO ] Deduced a trap composed of 4 places in 538 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:51] [INFO ] Deduced a trap composed of 5 places in 535 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:51] [INFO ] Deduced a trap composed of 3 places in 534 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:52] [INFO ] Deduced a trap composed of 8 places in 693 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:53] [INFO ] Deduced a trap composed of 9 places in 535 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:54] [INFO ] Deduced a trap composed of 10 places in 534 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:54] [INFO ] Deduced a trap composed of 5 places in 542 ms of which 18 ms to minimize.
[2025-06-08 03:07:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5431 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:59] [INFO ] Deduced a trap composed of 6 places in 888 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:02] [INFO ] Deduced a trap composed of 5 places in 1089 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:03] [INFO ] Deduced a trap composed of 5 places in 915 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:04] [INFO ] Deduced a trap composed of 8 places in 869 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:05] [INFO ] Deduced a trap composed of 5 places in 860 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:06] [INFO ] Deduced a trap composed of 8 places in 873 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:07] [INFO ] Deduced a trap composed of 9 places in 863 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:08] [INFO ] Deduced a trap composed of 9 places in 872 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:09] [INFO ] Deduced a trap composed of 9 places in 877 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:10] [INFO ] Deduced a trap composed of 10 places in 856 ms of which 33 ms to minimize.
[2025-06-08 03:08:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 12361 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:12] [INFO ] Deduced a trap composed of 5 places in 628 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:13] [INFO ] Deduced a trap composed of 5 places in 629 ms of which 20 ms to minimize.
[2025-06-08 03:08:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1667 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:14] [INFO ] Deduced a trap composed of 9 places in 643 ms of which 20 ms to minimize.
[2025-06-08 03:08:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 917 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:16] [INFO ] Deduced a trap composed of 5 places in 562 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:16] [INFO ] Deduced a trap composed of 7 places in 539 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:17] [INFO ] Deduced a trap composed of 7 places in 556 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:18] [INFO ] Deduced a trap composed of 7 places in 559 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:19] [INFO ] Deduced a trap composed of 7 places in 623 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:19] [INFO ] Deduced a trap composed of 8 places in 582 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:20] [INFO ] Deduced a trap composed of 7 places in 580 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:21] [INFO ] Deduced a trap composed of 8 places in 567 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:22] [INFO ] Deduced a trap composed of 9 places in 671 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:22] [INFO ] Deduced a trap composed of 9 places in 561 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:23] [INFO ] Deduced a trap composed of 9 places in 566 ms of which 27 ms to minimize.
[2025-06-08 03:08:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8060 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:24] [INFO ] Deduced a trap composed of 5 places in 560 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:25] [INFO ] Deduced a trap composed of 5 places in 573 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:26] [INFO ] Deduced a trap composed of 5 places in 552 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:26] [INFO ] Deduced a trap composed of 7 places in 548 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:27] [INFO ] Deduced a trap composed of 7 places in 537 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:28] [INFO ] Deduced a trap composed of 6 places in 539 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:29] [INFO ] Deduced a trap composed of 8 places in 552 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:29] [INFO ] Deduced a trap composed of 7 places in 539 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:30] [INFO ] Deduced a trap composed of 9 places in 537 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:31] [INFO ] Deduced a trap composed of 10 places in 534 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:32] [INFO ] Deduced a trap composed of 10 places in 519 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:32] [INFO ] Deduced a trap composed of 10 places in 510 ms of which 20 ms to minimize.
[2025-06-08 03:08:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 8688 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:33] [INFO ] Deduced a trap composed of 11 places in 496 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:34] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:35] [INFO ] Deduced a trap composed of 11 places in 470 ms of which 18 ms to minimize.
[2025-06-08 03:08:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2004 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:39] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:40] [INFO ] Deduced a trap composed of 6 places in 455 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:41] [INFO ] Deduced a trap composed of 9 places in 460 ms of which 19 ms to minimize.
[2025-06-08 03:08:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2094 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:42] [INFO ] Deduced a trap composed of 5 places in 442 ms of which 16 ms to minimize.
[2025-06-08 03:08:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 693 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:43] [INFO ] Deduced a trap composed of 5 places in 467 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:43] [INFO ] Deduced a trap composed of 5 places in 462 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:44] [INFO ] Deduced a trap composed of 6 places in 468 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:45] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:45] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:46] [INFO ] Deduced a trap composed of 6 places in 484 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:46] [INFO ] Deduced a trap composed of 7 places in 464 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:47] [INFO ] Deduced a trap composed of 8 places in 450 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:48] [INFO ] Deduced a trap composed of 8 places in 449 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:48] [INFO ] Deduced a trap composed of 6 places in 447 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:49] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:49] [INFO ] Deduced a trap composed of 12 places in 436 ms of which 17 ms to minimize.
[2025-06-08 03:08:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7396 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:54] [INFO ] Deduced a trap composed of 6 places in 603 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:55] [INFO ] Deduced a trap composed of 10 places in 402 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:55] [INFO ] Deduced a trap composed of 11 places in 422 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:56] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:56] [INFO ] Deduced a trap composed of 13 places in 426 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:57] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 20 ms to minimize.
[2025-06-08 03:08:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3622 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:00] [INFO ] Deduced a trap composed of 6 places in 966 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:02] [INFO ] Deduced a trap composed of 9 places in 670 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:03] [INFO ] Deduced a trap composed of 10 places in 698 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:04] [INFO ] Deduced a trap composed of 11 places in 702 ms of which 34 ms to minimize.
[2025-06-08 03:09:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4693 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:06] [INFO ] Deduced a trap composed of 8 places in 843 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:07] [INFO ] Deduced a trap composed of 9 places in 803 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:08] [INFO ] Deduced a trap composed of 10 places in 839 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:09] [INFO ] Deduced a trap composed of 11 places in 844 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:10] [INFO ] Deduced a trap composed of 11 places in 848 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:10] [INFO ] Deduced a trap composed of 11 places in 822 ms of which 37 ms to minimize.
[2025-06-08 03:09:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5974 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:12] [INFO ] Deduced a trap composed of 5 places in 597 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:12] [INFO ] Deduced a trap composed of 6 places in 633 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:13] [INFO ] Deduced a trap composed of 6 places in 641 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:14] [INFO ] Deduced a trap composed of 9 places in 642 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:15] [INFO ] Deduced a trap composed of 7 places in 625 ms of which 22 ms to minimize.
[2025-06-08 03:09:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3892 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:16] [INFO ] Deduced a trap composed of 3 places in 598 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:17] [INFO ] Deduced a trap composed of 9 places in 633 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:18] [INFO ] Deduced a trap composed of 6 places in 696 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:19] [INFO ] Deduced a trap composed of 7 places in 582 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:19] [INFO ] Deduced a trap composed of 13 places in 608 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:20] [INFO ] Deduced a trap composed of 11 places in 601 ms of which 20 ms to minimize.
[2025-06-08 03:09:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4666 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:21] [INFO ] Deduced a trap composed of 5 places in 548 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:22] [INFO ] Deduced a trap composed of 9 places in 583 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:23] [INFO ] Deduced a trap composed of 8 places in 548 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:23] [INFO ] Deduced a trap composed of 14 places in 514 ms of which 19 ms to minimize.
[2025-06-08 03:09:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2898 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:24] [INFO ] Deduced a trap composed of 6 places in 538 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:25] [INFO ] Deduced a trap composed of 6 places in 569 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:26] [INFO ] Deduced a trap composed of 8 places in 569 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:27] [INFO ] Deduced a trap composed of 8 places in 526 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:27] [INFO ] Deduced a trap composed of 7 places in 562 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:28] [INFO ] Deduced a trap composed of 11 places in 524 ms of which 22 ms to minimize.
[2025-06-08 03:09:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4224 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:31] [INFO ] Deduced a trap composed of 3 places in 517 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:32] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 19 ms to minimize.
[2025-06-08 03:09:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1724 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:33] [INFO ] Deduced a trap composed of 7 places in 463 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:34] [INFO ] Deduced a trap composed of 11 places in 462 ms of which 18 ms to minimize.
[2025-06-08 03:09:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1344 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:38] [INFO ] Deduced a trap composed of 9 places in 441 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:38] [INFO ] Deduced a trap composed of 9 places in 456 ms of which 17 ms to minimize.
[2025-06-08 03:09:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1245 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:44] [INFO ] Deduced a trap composed of 8 places in 894 ms of which 28 ms to minimize.
[2025-06-08 03:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1956 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:47] [INFO ] Deduced a trap composed of 8 places in 623 ms of which 21 ms to minimize.
[2025-06-08 03:09:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 861 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:49] [INFO ] Deduced a trap composed of 7 places in 634 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:49] [INFO ] Deduced a trap composed of 7 places in 642 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:50] [INFO ] Deduced a trap composed of 7 places in 638 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:51] [INFO ] Deduced a trap composed of 7 places in 626 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:52] [INFO ] Deduced a trap composed of 7 places in 618 ms of which 24 ms to minimize.
[2025-06-08 03:09:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3878 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:53] [INFO ] Deduced a trap composed of 11 places in 596 ms of which 24 ms to minimize.
[2025-06-08 03:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 808 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:57] [INFO ] Deduced a trap composed of 7 places in 583 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:58] [INFO ] Deduced a trap composed of 7 places in 574 ms of which 19 ms to minimize.
[2025-06-08 03:09:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1529 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:59] [INFO ] Deduced a trap composed of 6 places in 582 ms of which 23 ms to minimize.
[2025-06-08 03:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 791 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:03] [INFO ] Deduced a trap composed of 10 places in 477 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:04] [INFO ] Deduced a trap composed of 11 places in 502 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:04] [INFO ] Deduced a trap composed of 9 places in 483 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:05] [INFO ] Deduced a trap composed of 11 places in 478 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:06] [INFO ] Deduced a trap composed of 12 places in 467 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:06] [INFO ] Deduced a trap composed of 12 places in 457 ms of which 18 ms to minimize.
[2025-06-08 03:10:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3807 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:14] [INFO ] Deduced a trap composed of 7 places in 619 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:15] [INFO ] Deduced a trap composed of 7 places in 617 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:16] [INFO ] Deduced a trap composed of 9 places in 614 ms of which 27 ms to minimize.
[2025-06-08 03:10:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2640 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:19] [INFO ] Deduced a trap composed of 9 places in 569 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:20] [INFO ] Deduced a trap composed of 9 places in 558 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:20] [INFO ] Deduced a trap composed of 10 places in 581 ms of which 20 ms to minimize.
[2025-06-08 03:10:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2314 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:22] [INFO ] Deduced a trap composed of 7 places in 575 ms of which 20 ms to minimize.
[2025-06-08 03:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 816 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:23] [INFO ] Deduced a trap composed of 7 places in 579 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:24] [INFO ] Deduced a trap composed of 8 places in 556 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:24] [INFO ] Deduced a trap composed of 9 places in 563 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:25] [INFO ] Deduced a trap composed of 9 places in 587 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:26] [INFO ] Deduced a trap composed of 11 places in 555 ms of which 19 ms to minimize.
[2025-06-08 03:10:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3680 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:31] [INFO ] Deduced a trap composed of 7 places in 512 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:32] [INFO ] Deduced a trap composed of 9 places in 510 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:32] [INFO ] Deduced a trap composed of 9 places in 502 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:33] [INFO ] Deduced a trap composed of 10 places in 507 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:34] [INFO ] Deduced a trap composed of 11 places in 517 ms of which 21 ms to minimize.
[2025-06-08 03:10:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3872 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:35] [INFO ] Deduced a trap composed of 7 places in 471 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:36] [INFO ] Deduced a trap composed of 5 places in 472 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:37] [INFO ] Deduced a trap composed of 8 places in 509 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:37] [INFO ] Deduced a trap composed of 8 places in 485 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:38] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:38] [INFO ] Deduced a trap composed of 9 places in 494 ms of which 25 ms to minimize.
[2025-06-08 03:10:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3701 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:42] [INFO ] Deduced a trap composed of 6 places in 520 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:43] [INFO ] Deduced a trap composed of 7 places in 521 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:44] [INFO ] Deduced a trap composed of 9 places in 964 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:46] [INFO ] Deduced a trap composed of 9 places in 999 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:46] [INFO ] Deduced a trap composed of 10 places in 524 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:47] [INFO ] Deduced a trap composed of 10 places in 505 ms of which 18 ms to minimize.
[2025-06-08 03:10:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5599 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:52] [INFO ] Deduced a trap composed of 7 places in 792 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:53] [INFO ] Deduced a trap composed of 7 places in 813 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:54] [INFO ] Deduced a trap composed of 7 places in 793 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:55] [INFO ] Deduced a trap composed of 7 places in 854 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:56] [INFO ] Deduced a trap composed of 9 places in 790 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:57] [INFO ] Deduced a trap composed of 7 places in 797 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:58] [INFO ] Deduced a trap composed of 11 places in 798 ms of which 39 ms to minimize.
[2025-06-08 03:10:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 7101 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:01] [INFO ] Deduced a trap composed of 9 places in 541 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:02] [INFO ] Deduced a trap composed of 11 places in 576 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:03] [INFO ] Deduced a trap composed of 11 places in 597 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:03] [INFO ] Deduced a trap composed of 11 places in 571 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:04] [INFO ] Deduced a trap composed of 11 places in 559 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:05] [INFO ] Deduced a trap composed of 12 places in 579 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:06] [INFO ] Deduced a trap composed of 12 places in 565 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:07] [INFO ] Deduced a trap composed of 11 places in 566 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:08] [INFO ] Deduced a trap composed of 11 places in 537 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:08] [INFO ] Deduced a trap composed of 13 places in 546 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:09] [INFO ] Deduced a trap composed of 12 places in 533 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:10] [INFO ] Deduced a trap composed of 14 places in 545 ms of which 29 ms to minimize.
[2025-06-08 03:11:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9934 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:12] [INFO ] Deduced a trap composed of 5 places in 547 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:12] [INFO ] Deduced a trap composed of 5 places in 531 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:13] [INFO ] Deduced a trap composed of 6 places in 515 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:14] [INFO ] Deduced a trap composed of 7 places in 509 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:14] [INFO ] Deduced a trap composed of 7 places in 560 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:15] [INFO ] Deduced a trap composed of 9 places in 532 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:16] [INFO ] Deduced a trap composed of 9 places in 490 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:16] [INFO ] Deduced a trap composed of 11 places in 513 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:17] [INFO ] Deduced a trap composed of 11 places in 494 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:18] [INFO ] Deduced a trap composed of 14 places in 512 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:18] [INFO ] Deduced a trap composed of 14 places in 506 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:19] [INFO ] Deduced a trap composed of 9 places in 485 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:20] [INFO ] Deduced a trap composed of 11 places in 460 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:20] [INFO ] Deduced a trap composed of 11 places in 468 ms of which 17 ms to minimize.
[2025-06-08 03:11:21] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 9503 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:21] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:22] [INFO ] Deduced a trap composed of 7 places in 512 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:23] [INFO ] Deduced a trap composed of 9 places in 466 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:23] [INFO ] Deduced a trap composed of 9 places in 452 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 11 places in 422 ms of which 16 ms to minimize.
[2025-06-08 03:11:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3598 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:27] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:27] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:28] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 17 ms to minimize.
[2025-06-08 03:11:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1677 ms
TRAPS : Iteration 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:31] [INFO ] Deduced a trap composed of 7 places in 440 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:32] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:33] [INFO ] Deduced a trap composed of 6 places in 437 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:33] [INFO ] Deduced a trap composed of 12 places in 438 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:34] [INFO ] Deduced a trap composed of 12 places in 431 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:34] [INFO ] Deduced a trap composed of 15 places in 429 ms of which 24 ms to minimize.
[2025-06-08 03:11:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3603 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:42] [INFO ] Deduced a trap composed of 10 places in 637 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:43] [INFO ] Deduced a trap composed of 11 places in 634 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:43] [INFO ] Deduced a trap composed of 11 places in 619 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:44] [INFO ] Deduced a trap composed of 9 places in 612 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:45] [INFO ] Deduced a trap composed of 11 places in 625 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:46] [INFO ] Deduced a trap composed of 11 places in 599 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:47] [INFO ] Deduced a trap composed of 17 places in 601 ms of which 36 ms to minimize.
[2025-06-08 03:11:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5925 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:48] [INFO ] Deduced a trap composed of 13 places in 598 ms of which 29 ms to minimize.
[2025-06-08 03:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 829 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:50] [INFO ] Deduced a trap composed of 11 places in 554 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:50] [INFO ] Deduced a trap composed of 11 places in 559 ms of which 19 ms to minimize.
[2025-06-08 03:11:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1467 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:52] [INFO ] Deduced a trap composed of 5 places in 591 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:53] [INFO ] Deduced a trap composed of 9 places in 626 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:54] [INFO ] Deduced a trap composed of 11 places in 612 ms of which 20 ms to minimize.
[2025-06-08 03:11:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2534 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:59] [INFO ] Deduced a trap composed of 9 places in 621 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:00] [INFO ] Deduced a trap composed of 11 places in 576 ms of which 22 ms to minimize.
[2025-06-08 03:12:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2052 ms
TRAPS : Iteration 6
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:02] [INFO ] Deduced a trap composed of 11 places in 609 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:03] [INFO ] Deduced a trap composed of 12 places in 583 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:03] [INFO ] Deduced a trap composed of 13 places in 584 ms of which 26 ms to minimize.
[2025-06-08 03:12:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2390 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:07] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:07] [INFO ] Deduced a trap composed of 12 places in 482 ms of which 17 ms to minimize.
[2025-06-08 03:12:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1422 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:12] [INFO ] Deduced a trap composed of 10 places in 921 ms of which 32 ms to minimize.
[2025-06-08 03:12:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1173 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:14] [INFO ] Deduced a trap composed of 7 places in 875 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:15] [INFO ] Deduced a trap composed of 7 places in 885 ms of which 30 ms to minimize.
[2025-06-08 03:12:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2105 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:16] [INFO ] Deduced a trap composed of 4 places in 804 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:17] [INFO ] Deduced a trap composed of 5 places in 817 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:18] [INFO ] Deduced a trap composed of 5 places in 826 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:19] [INFO ] Deduced a trap composed of 5 places in 823 ms of which 25 ms to minimize.
[2025-06-08 03:12:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3839 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:24] [INFO ] Deduced a trap composed of 11 places in 541 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:25] [INFO ] Deduced a trap composed of 12 places in 528 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:25] [INFO ] Deduced a trap composed of 12 places in 526 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:26] [INFO ] Deduced a trap composed of 11 places in 570 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:27] [INFO ] Deduced a trap composed of 11 places in 564 ms of which 22 ms to minimize.
[2025-06-08 03:12:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3624 ms
TRAPS : Iteration 7
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:36] [INFO ] Deduced a trap composed of 10 places in 477 ms of which 21 ms to minimize.
[2025-06-08 03:12:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 783 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:38] [INFO ] Deduced a trap composed of 7 places in 528 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:39] [INFO ] Deduced a trap composed of 7 places in 530 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:39] [INFO ] Deduced a trap composed of 5 places in 528 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:40] [INFO ] Deduced a trap composed of 9 places in 512 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:41] [INFO ] Deduced a trap composed of 9 places in 514 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:41] [INFO ] Deduced a trap composed of 11 places in 478 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:42] [INFO ] Deduced a trap composed of 11 places in 512 ms of which 23 ms to minimize.
[2025-06-08 03:12:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4586 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:43] [INFO ] Deduced a trap composed of 5 places in 497 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:44] [INFO ] Deduced a trap composed of 5 places in 474 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:44] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:45] [INFO ] Deduced a trap composed of 5 places in 498 ms of which 17 ms to minimize.
[2025-06-08 03:12:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2509 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:50] [INFO ] Deduced a trap composed of 11 places in 734 ms of which 27 ms to minimize.
[2025-06-08 03:12:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 945 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:53] [INFO ] Deduced a trap composed of 11 places in 699 ms of which 26 ms to minimize.
[2025-06-08 03:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 960 ms
TRAPS : Iteration 8
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:54] [INFO ] Deduced a trap composed of 11 places in 631 ms of which 23 ms to minimize.
[2025-06-08 03:12:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 857 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:59] [INFO ] Deduced a trap composed of 11 places in 556 ms of which 18 ms to minimize.
[2025-06-08 03:12:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 773 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:04] [INFO ] Deduced a trap composed of 9 places in 552 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:05] [INFO ] Deduced a trap composed of 5 places in 583 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:06] [INFO ] Deduced a trap composed of 9 places in 553 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:06] [INFO ] Deduced a trap composed of 9 places in 549 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:07] [INFO ] Deduced a trap composed of 5 places in 539 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:08] [INFO ] Deduced a trap composed of 10 places in 543 ms of which 18 ms to minimize.
[2025-06-08 03:13:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4541 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:12] [INFO ] Deduced a trap composed of 11 places in 879 ms of which 26 ms to minimize.
[2025-06-08 03:13:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1270 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:15] [INFO ] Deduced a trap composed of 7 places in 656 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:16] [INFO ] Deduced a trap composed of 11 places in 625 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:16] [INFO ] Deduced a trap composed of 11 places in 631 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:17] [INFO ] Deduced a trap composed of 14 places in 647 ms of which 32 ms to minimize.
[2025-06-08 03:13:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3102 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:19] [INFO ] Deduced a trap composed of 10 places in 605 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:20] [INFO ] Deduced a trap composed of 11 places in 596 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:20] [INFO ] Deduced a trap composed of 10 places in 583 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:21] [INFO ] Deduced a trap composed of 12 places in 600 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:22] [INFO ] Deduced a trap composed of 11 places in 607 ms of which 22 ms to minimize.
[2025-06-08 03:13:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3863 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:26] [INFO ] Deduced a trap composed of 11 places in 596 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:27] [INFO ] Deduced a trap composed of 12 places in 563 ms of which 23 ms to minimize.
[2025-06-08 03:13:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1569 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:28] [INFO ] Deduced a trap composed of 7 places in 557 ms of which 20 ms to minimize.
[2025-06-08 03:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 749 ms
TRAPS : Iteration 9
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:33] [INFO ] Deduced a trap composed of 9 places in 484 ms of which 23 ms to minimize.
[2025-06-08 03:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 732 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:35] [INFO ] Deduced a trap composed of 11 places in 690 ms of which 22 ms to minimize.
[2025-06-08 03:13:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 897 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:37] [INFO ] Deduced a trap composed of 11 places in 521 ms of which 18 ms to minimize.
[2025-06-08 03:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 741 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:40] [INFO ] Deduced a trap composed of 12 places in 634 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:41] [INFO ] Deduced a trap composed of 13 places in 632 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:41] [INFO ] Deduced a trap composed of 13 places in 631 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 11 places in 679 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:43] [INFO ] Deduced a trap composed of 13 places in 656 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:44] [INFO ] Deduced a trap composed of 11 places in 625 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:44] [INFO ] Deduced a trap composed of 16 places in 672 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:45] [INFO ] Deduced a trap composed of 20 places in 673 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:46] [INFO ] Deduced a trap composed of 11 places in 662 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:48] [INFO ] Deduced a trap composed of 12 places in 1287 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:49] [INFO ] Deduced a trap composed of 12 places in 1286 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:50] [INFO ] Deduced a trap composed of 24 places in 716 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:51] [INFO ] Deduced a trap composed of 11 places in 652 ms of which 24 ms to minimize.
[2025-06-08 03:13:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 11832 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:55] [INFO ] Deduced a trap composed of 12 places in 760 ms of which 19 ms to minimize.
[2025-06-08 03:13:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 988 ms
TRAPS : Iteration 10
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:01] [INFO ] Deduced a trap composed of 5 places in 564 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:02] [INFO ] Deduced a trap composed of 5 places in 549 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:03] [INFO ] Deduced a trap composed of 5 places in 583 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:03] [INFO ] Deduced a trap composed of 5 places in 539 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:04] [INFO ] Deduced a trap composed of 14 places in 545 ms of which 18 ms to minimize.
[2025-06-08 03:14:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3876 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:07] [INFO ] Deduced a trap composed of 5 places in 823 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:08] [INFO ] Deduced a trap composed of 5 places in 842 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:09] [INFO ] Deduced a trap composed of 8 places in 872 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:10] [INFO ] Deduced a trap composed of 6 places in 861 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:11] [INFO ] Deduced a trap composed of 6 places in 805 ms of which 29 ms to minimize.
[2025-06-08 03:14:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5064 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:16] [INFO ] Deduced a trap composed of 5 places in 1300 ms of which 35 ms to minimize.
[2025-06-08 03:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1879 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:20] [INFO ] Deduced a trap composed of 8 places in 988 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:22] [INFO ] Deduced a trap composed of 9 places in 1008 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:23] [INFO ] Deduced a trap composed of 10 places in 951 ms of which 40 ms to minimize.
[2025-06-08 03:14:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3480 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:25] [INFO ] Deduced a trap composed of 8 places in 684 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:26] [INFO ] Deduced a trap composed of 9 places in 675 ms of which 24 ms to minimize.
[2025-06-08 03:14:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1964 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:28] [INFO ] Deduced a trap composed of 5 places in 653 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:29] [INFO ] Deduced a trap composed of 6 places in 654 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:30] [INFO ] Deduced a trap composed of 6 places in 647 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:31] [INFO ] Deduced a trap composed of 6 places in 645 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:31] [INFO ] Deduced a trap composed of 7 places in 652 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:33] [INFO ] Deduced a trap composed of 7 places in 1140 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:33] [INFO ] Deduced a trap composed of 9 places in 649 ms of which 26 ms to minimize.
[2025-06-08 03:14:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6075 ms
TRAPS : Iteration 11
SMT process timed out, exceeded limit of 225
[2025-06-08 03:14:35] [INFO ] After 445791ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :7
[2025-06-08 03:14:35] [INFO ] After 450031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 451485 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-08 03:14:35] [INFO ] Flatten gal took : 176 ms
[2025-06-08 03:14:35] [INFO ] Applying decomposition
[2025-06-08 03:14:35] [INFO ] Flatten gal took : 157 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17391795678129159557.txt' '-o' '/tmp/graph17391795678129159557.bin' '-w' '/tmp/graph17391795678129159557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17391795678129159557.bin' '-l' '-1' '-v' '-w' '/tmp/graph17391795678129159557.weights' '-q' '0' '-e' '0.001'
[2025-06-08 03:14:36] [INFO ] Decomposing Gal with order
[2025-06-08 03:14:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 03:14:40] [INFO ] Removed a total of 600 redundant transitions.
[2025-06-08 03:14:40] [INFO ] Flatten gal took : 409 ms
[2025-06-08 03:14:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2025-06-08 03:14:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5969745755427598522.gal : 56 ms
[2025-06-08 03:14:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7538309109273254961.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5969745755427598522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7538309109273254961.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7538309109273254961.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :1 after 19554
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :19554 after 5.41516e+08
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :1.20022e+16 after 3.15636e+163
Detected timeout of ITS tools.
[2025-06-08 03:44:43] [INFO ] Flatten gal took : 726 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14694492975231425042
[2025-06-08 03:44:43] [INFO ] Too many transitions (2271) to apply POR reductions. Disabling POR matrices.
[2025-06-08 03:44:44] [INFO ] Applying decomposition
[2025-06-08 03:44:44] [INFO ] Built C files in 264ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14694492975231425042
Running compilation step : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '65' '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'
[2025-06-08 03:44:44] [INFO ] Flatten gal took : 495 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16546234397610172056.txt' '-o' '/tmp/graph16546234397610172056.bin' '-w' '/tmp/graph16546234397610172056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16546234397610172056.bin' '-l' '-1' '-v' '-w' '/tmp/graph16546234397610172056.weights' '-q' '0' '-e' '0.001'
[2025-06-08 03:44:46] [INFO ] Decomposing Gal with order
[2025-06-08 03:44:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 03:44:46] [INFO ] Removed a total of 1324 redundant transitions.
[2025-06-08 03:44:46] [INFO ] Flatten gal took : 142 ms
[2025-06-08 03:44:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 536 labels/synchronizations in 74 ms.
[2025-06-08 03:44:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability400438452696033935.gal : 24 ms
[2025-06-08 03:44:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12490316232286575073.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability400438452696033935.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12490316232286575073.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability12490316232286575073.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :9 after 57
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :57 after 186717
Compilation finished in 19892 ms.
Running link step : cd /tmp/ltsmin14694492975231425042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202300==true'
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :186717 after 5.44196e+08
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :5.44196e+08 after 5.44196e+08
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :5.44196e+08 after 5.44196e+08
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202300==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202502==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202502==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202503==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202503==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202504==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202504==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202505==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202505==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202507==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202507==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202509==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202509==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202510==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202510==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202511==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202511==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202512==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202512==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202513==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202513==true'
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202300==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202300==true'
Running LTSmin : cd /tmp/ltsmin14694492975231425042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT100BReachabilityFireability202502==true'
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-100B"
export BK_EXAMINATION="ReachabilityFireability"
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-100B, examination is ReachabilityFireability"
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-174894533700951"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;