About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T06
| 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 | FFFF??FFFFFFFF?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700268.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 PolyORBLF-COL-S02J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 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 PolyORBLF-COL-S02J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748904636080
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-02 22:50:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 22:50:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:50:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 22:50:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 22:50:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 659 ms
[2025-06-02 22:50:38] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 22:50:38] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2025-06-02 22:50:38] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (19 resets) in 1173 ms. (34 steps per ms) remains 6/30 properties
BEST_FIRST walk for 40002 steps (13 resets) in 491 ms. (81 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (16 resets) in 333 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (9 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (14 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (12 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
[2025-06-02 22:50:39] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 22:50:39] [INFO ] Computed 26 invariants in 14 ms
[2025-06-02 22:50:39] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/25 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/48 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/51 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 22/73 variables, 12/21 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:39] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 3 solved, 2 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 2/115 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/118 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 3 solved, 2 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 703ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 231 ms.
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 29 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2025-06-02 22:50:40] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2025-06-02 22:50:40] [INFO ] Computed 25 invariants in 3 ms
[2025-06-02 22:50:40] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 7/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/94 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:41] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/104 variables, 1/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 103 constraints, problems are : Problem set: 2 solved, 42 unsolved in 2088 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:42] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/96 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/146 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 146 constraints, problems are : Problem set: 2 solved, 42 unsolved in 2744 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4855ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 4856ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 41
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 39
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 10 ms. Remains 58 /60 variables (removed 2) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4907 ms. Remains : 58/81 places, 39/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 22:50:45] [INFO ] Flatten gal took : 27 ms
[2025-06-02 22:50:45] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 22:50:45] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 26 ms.
[2025-06-02 22:50:45] [INFO ] Unfolded 13 HLPN properties in 0 ms.
[2025-06-02 22:50:45] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 22:50:45] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 22:50:45] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 22:50:45] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 22:50:45] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 22:50:45] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 22:50:45] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 223 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Applied a total of 2 rules in 33 ms. Remains 474 /476 variables (removed 2) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-02 22:50:45] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 474 cols
[2025-06-02 22:50:45] [INFO ] Computed 44 invariants in 26 ms
[2025-06-02 22:50:45] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:52] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:52] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:58] [INFO ] Deduced a trap composed of 223 places in 203 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:58] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:59] [INFO ] Deduced a trap composed of 235 places in 198 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:02] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1286 variables, and 47 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/474 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1286 variables, and 47 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/474 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40658ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40664ms
[2025-06-02 22:51:25] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 22:51:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:51:26] [INFO ] Implicit Places using invariants in 368 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 379 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 468/476 places, 824/824 transitions.
Applied a total of 0 rules in 14 ms. Remains 468 /468 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41094 ms. Remains : 468/476 places, 824/824 transitions.
Support contains 223 out of 468 places after structural reductions.
[2025-06-02 22:51:26] [INFO ] Flatten gal took : 71 ms
[2025-06-02 22:51:26] [INFO ] Flatten gal took : 69 ms
[2025-06-02 22:51:26] [INFO ] Input system was already deterministic with 824 transitions.
Reduction of identical properties reduced properties to check from 28 to 26
RANDOM walk for 40000 steps (9 resets) in 985 ms. (40 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40000 steps (10 resets) in 422 ms. (94 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
[2025-06-02 22:51:27] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 468 cols
[2025-06-02 22:51:27] [INFO ] Computed 38 invariants in 18 ms
[2025-06-02 22:51:27] [INFO ] State equation strengthened by 72 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 161/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 25/202 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp19 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 258/460 variables, 21/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/463 variables, 3/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/466 variables, 3/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 812/1278 variables, 466/503 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1278 variables, 72/575 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1278 variables, 0/575 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1280 variables, 2/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1280 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1280 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1280 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 468/468 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 139/146 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 47/193 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/202 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 258/460 variables, 21/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:28] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/463 variables, 3/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/466 variables, 3/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 812/1278 variables, 466/504 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1278 variables, 72/576 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1278 variables, 1/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1278 variables, 0/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1280 variables, 2/579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1280 variables, 1/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:29] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 20 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1280 variables, 1/581 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1280 variables, 0/581 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1280 variables, 0/581 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 581 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 468/468 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2671ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 7 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 96 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 192 place count 372 transition count 728
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 198 place count 366 transition count 722
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 366 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 300 place count 318 transition count 674
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 312 place count 318 transition count 662
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 324 place count 306 transition count 662
Applied a total of 324 rules in 99 ms. Remains 306 /468 variables (removed 162) and now considering 662/824 (removed 162) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-02 22:51:30] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
// Phase 1: matrix 650 rows 306 cols
[2025-06-02 22:51:30] [INFO ] Computed 38 invariants in 12 ms
[2025-06-02 22:51:30] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:34] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:34] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:34] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:34] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:34] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:34] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:35] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:35] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:35] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:35] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:35] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:36] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:45] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:45] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/956 variables, and 50 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (OVERLAPS) 1/305 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/956 variables, and 51 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40491ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 40495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40596 ms. Remains : 306/468 places, 662/824 transitions.
RANDOM walk for 40000 steps (20 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (11 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 462410 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 462410 steps, saw 215974 distinct states, run finished after 3004 ms. (steps per millisecond=153 ) properties seen :0
[2025-06-02 22:52:13] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 22:52:13] [INFO ] Invariant cache hit.
[2025-06-02 22:52:13] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/154 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 143/297 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/301 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/304 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 650/954 variables, 304/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/954 variables, 72/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/954 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/956 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/956 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/956 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/956 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 956/956 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 306/306 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/154 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 143/297 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/301 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/304 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 650/954 variables, 304/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/954 variables, 72/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/954 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:15] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 35 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/954 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/954 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/956 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/956 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:15] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 13 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/956 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/956 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/956 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 956/956 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 306/306 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2136ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 662/662 transitions.
Applied a total of 0 rules in 14 ms. Remains 306 /306 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 306/306 places, 662/662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 662/662 transitions.
Applied a total of 0 rules in 14 ms. Remains 306 /306 variables (removed 0) and now considering 662/662 (removed 0) transitions.
[2025-06-02 22:52:15] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 22:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:52:16] [INFO ] Implicit Places using invariants in 752 ms returned []
[2025-06-02 22:52:16] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 22:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:52:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:52:19] [INFO ] Implicit Places using invariants and state equation in 3263 ms returned []
Implicit Place search using SMT with State Equation took 4016 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:52:19] [INFO ] Redundant transitions in 32 ms returned []
Running 660 sub problems to find dead transitions.
[2025-06-02 22:52:19] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 22:52:19] [INFO ] Invariant cache hit.
[2025-06-02 22:52:19] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:24] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:24] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:24] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:24] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:24] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:24] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:25] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:25] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:25] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:25] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:25] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:29] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:30] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/305 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:49] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/956 variables, and 51 constraints, problems are : Problem set: 36 solved, 624 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 624 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 23/36 constraints. Problems are: Problem set: 36 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 14/50 constraints. Problems are: Problem set: 36 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:00] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 1/51 constraints. Problems are: Problem set: 36 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/956 variables, and 51 constraints, problems are : Problem set: 36 solved, 624 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60373ms problems are : Problem set: 36 solved, 624 unsolved
Search for dead transitions found 36 dead transitions in 60375ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/306 places, 626/662 transitions.
Applied a total of 0 rules in 13 ms. Remains 306 /306 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:53:20] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64482 ms. Remains : 306/306 places, 626/662 transitions.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (p1 U G(p0))))'
Support contains 13 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 462 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 456 transition count 812
Applied a total of 24 rules in 14 ms. Remains 456 /468 variables (removed 12) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:53:20] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-02 22:53:20] [INFO ] Computed 38 invariants in 10 ms
[2025-06-02 22:53:20] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:26] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:26] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:26] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:26] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:26] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:27] [INFO ] Deduced a trap composed of 217 places in 255 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:27] [INFO ] Deduced a trap composed of 86 places in 194 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:27] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:27] [INFO ] Deduced a trap composed of 121 places in 194 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:28] [INFO ] Deduced a trap composed of 194 places in 229 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:28] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:29] [INFO ] Deduced a trap composed of 222 places in 255 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:32] [INFO ] Deduced a trap composed of 205 places in 210 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:33] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:35] [INFO ] Deduced a trap composed of 222 places in 206 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:35] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:49] [INFO ] Deduced a trap composed of 298 places in 229 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:53] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:54] [INFO ] Deduced a trap composed of 234 places in 149 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40356ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40359ms
[2025-06-02 22:54:01] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:54:01] [INFO ] Implicit Places using invariants in 434 ms returned []
[2025-06-02 22:54:01] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:54:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:54:05] [INFO ] Implicit Places using invariants and state equation in 4245 ms returned []
Implicit Place search using SMT with State Equation took 4693 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:54:05] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:54:05] [INFO ] Invariant cache hit.
[2025-06-02 22:54:05] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:12] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:12] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:12] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:12] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:13] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:13] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:16] [INFO ] Deduced a trap composed of 205 places in 259 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:16] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:18] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:21] [INFO ] Deduced a trap composed of 194 places in 238 ms of which 69 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:22] [INFO ] Deduced a trap composed of 86 places in 208 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:22] [INFO ] Deduced a trap composed of 121 places in 204 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:23] [INFO ] Deduced a trap composed of 242 places in 205 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:29] [INFO ] Deduced a trap composed of 3 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-02 22:54:30] [INFO ] Deduced a trap composed of 234 places in 201 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:47] [INFO ] Deduced a trap composed of 298 places in 227 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:54] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:54:55] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Starting structural reductions in LTL mode, iteration 1 : 456/468 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105390 ms. Remains : 456/468 places, 812/824 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), p0, false, false, true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3193 steps with 1071 reset in 125 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-02 finished in 105912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X((G(p1)&&p0))||F(p2))&&(X((G(p1)&&p3))||F(p4))))))'
Support contains 26 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 468 transition count 788
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 432 transition count 782
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 426 transition count 782
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 84 place count 426 transition count 728
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 192 place count 372 transition count 728
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 198 place count 366 transition count 722
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 366 transition count 722
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 240 place count 348 transition count 704
Applied a total of 240 rules in 53 ms. Remains 348 /468 variables (removed 120) and now considering 704/824 (removed 120) transitions.
Running 702 sub problems to find dead transitions.
[2025-06-02 22:55:06] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
// Phase 1: matrix 692 rows 348 cols
[2025-06-02 22:55:06] [INFO ] Computed 38 invariants in 7 ms
[2025-06-02 22:55:06] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:11] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:11] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:11] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:11] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:11] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:11] [INFO ] Deduced a trap composed of 127 places in 181 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:12] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:12] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:12] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:13] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:16] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:16] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:16] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:23] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1040 variables, and 50 constraints, problems are : Problem set: 0 solved, 702 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1040 variables, and 50 constraints, problems are : Problem set: 0 solved, 702 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/702 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40340ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 40341ms
[2025-06-02 22:55:47] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:55:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:55:47] [INFO ] Implicit Places using invariants in 730 ms returned []
[2025-06-02 22:55:47] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:55:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:55:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:55:51] [INFO ] Implicit Places using invariants and state equation in 3738 ms returned []
Implicit Place search using SMT with State Equation took 4471 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:55:51] [INFO ] Redundant transitions in 11 ms returned []
Running 702 sub problems to find dead transitions.
[2025-06-02 22:55:51] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:55:51] [INFO ] Invariant cache hit.
[2025-06-02 22:55:51] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:56] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:57] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:57] [INFO ] Deduced a trap composed of 46 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-02 22:55:57] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:57] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:58] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:59] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:55:59] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:00] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:00] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:01] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:09] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1040 variables, and 48 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:56:33] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1040 variables, and 49 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/702 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 348/468 places, 704/824 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105178 ms. Remains : 348/468 places, 704/824 transitions.
Stuttering acceptance computed with spot in 546 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p2) p0 p1 (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p4) p1 p3 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p4)), false]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-03
Product exploration explored 100000 steps with 2256 reset in 949 ms.
Product exploration explored 100000 steps with 2246 reset in 912 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p4) p0 p1 p3), (X (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (NOT p4)), (X (AND (NOT p2) p0 p1)), (X (NOT (OR (AND (NOT p4) (NOT p1)) (AND (NOT p4) (NOT p3))))), (X (AND (NOT p4) p1 p3)), (X p0), (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p0)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p3))))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p4) (NOT p1)) (AND (NOT p4) (NOT p3)))))), (X (X (AND (NOT p2) (NOT p4) p1 p3))), (X (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p0)) (AND (NOT p2) (NOT p4) (NOT p1)))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (AND (NOT p4) p1))), (X (X (AND (NOT p2) p0 p1))), (X (X (AND (NOT p2) (NOT p4) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p4) p1 p3))), (X (X p0)), (X (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p3)))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 3416 ms. Reduced automaton from 11 states, 40 edges and 5 AP (stutter insensitive) to 11 states, 59 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 516 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (AND p0 (NOT p2) p1 (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND p1 (NOT p4) p3 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p4)), false]
Reduction of identical properties reduced properties to check from 23 to 20
RANDOM walk for 40000 steps (17 resets) in 458 ms. (87 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 980 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
[2025-06-02 22:56:58] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:56:58] [INFO ] Invariant cache hit.
[2025-06-02 22:56:58] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf7 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 26/1040 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p4) p0 p1 p3), (X (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (NOT p4)), (X (AND (NOT p2) p0 p1)), (X (NOT (OR (AND (NOT p4) (NOT p1)) (AND (NOT p4) (NOT p3))))), (X (AND (NOT p4) p1 p3)), (X p0), (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p0)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p3))))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p4) (NOT p1)) (AND (NOT p4) (NOT p3)))))), (X (X (AND (NOT p2) (NOT p4) p1 p3))), (X (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p0)) (AND (NOT p2) (NOT p4) (NOT p1)))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (AND (NOT p4) p1))), (X (X (AND (NOT p2) p0 p1))), (X (X (AND (NOT p2) (NOT p4) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p4) p1 p3))), (X (X p0)), (X (X (NOT (OR (AND (NOT p2) (NOT p4) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p3)))))), (X (X p1)), (G (OR (NOT p0) p2 (NOT p1) p4 p3)), (G (OR p0 p2 (NOT p1) p4 (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1 (NOT p4) p3))), (F (NOT (OR p2 p1))), (F (NOT (AND p1 (NOT p4)))), (F (NOT (OR p2 p1 p4))), (F (NOT (AND p0 (NOT p2) p1 (NOT p4)))), (F p4), (F (NOT (AND (OR p1 p4) (OR p4 p3)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (OR p0 p2 p4 p3) (OR p2 p1 p4)))), (F (NOT (OR p1 p4))), (F (NOT p0)), (F p2), (F (NOT (AND (OR p0 p2) (OR p2 p1)))), (F (NOT (AND (OR p0 p2 p4) (OR p2 p1 p4)))), (F (NOT p3)), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND p1 (NOT p4) p3))), (F (NOT (AND p0 (NOT p2) p1 (NOT p4) p3))), (F (NOT (AND (OR p2 p1 p4) (OR p2 p4 p3)))), (F (NOT (AND (NOT p2) p1 (NOT p4)))), (F (NOT p1))]
Knowledge based reduction with 32 factoid took 1685 ms. Reduced automaton from 11 states, 59 edges and 5 AP (stutter insensitive) to 10 states, 36 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 424 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (AND p0 (NOT p2) p1 (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), false, (AND (NOT p1) (NOT p4)), false]
Stuttering acceptance computed with spot in 406 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (AND p0 (NOT p2) p1 (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), false, (AND (NOT p1) (NOT p4)), false]
Support contains 26 out of 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 704/704 transitions.
Applied a total of 0 rules in 11 ms. Remains 348 /348 variables (removed 0) and now considering 704/704 (removed 0) transitions.
Running 702 sub problems to find dead transitions.
[2025-06-02 22:57:01] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:57:01] [INFO ] Invariant cache hit.
[2025-06-02 22:57:01] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:06] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:06] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:06] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:07] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:07] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:08] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:09] [INFO ] Deduced a trap composed of 127 places in 149 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:09] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:10] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:10] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:11] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:19] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1040 variables, and 48 constraints, problems are : Problem set: 0 solved, 702 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:33] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1040 variables, and 49 constraints, problems are : Problem set: 0 solved, 702 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/702 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40300ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 40302ms
[2025-06-02 22:57:41] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:57:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:57:42] [INFO ] Implicit Places using invariants in 731 ms returned []
[2025-06-02 22:57:42] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:57:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:57:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:57:46] [INFO ] Implicit Places using invariants and state equation in 3759 ms returned []
Implicit Place search using SMT with State Equation took 4494 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:57:46] [INFO ] Redundant transitions in 4 ms returned []
Running 702 sub problems to find dead transitions.
[2025-06-02 22:57:46] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:57:46] [INFO ] Invariant cache hit.
[2025-06-02 22:57:46] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:51] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:51] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:51] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:51] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:51] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:53] [INFO ] Deduced a trap composed of 46 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-02 22:57:54] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:54] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:55] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:55] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:57:55] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:04] [INFO ] Deduced a trap composed of 139 places in 211 ms of which 65 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1040 variables, and 48 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:28] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1040 variables, and 49 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/702 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105131 ms. Remains : 348/348 places, 704/704 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p4) p3), (X (NOT p2)), (X p3), (X (NOT p4)), (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4)))), (X (AND p1 (NOT p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (X (AND p1 p3 (NOT p4))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p4))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))), (X (X (AND p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND p1 (NOT p2) p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (AND p1 (NOT p2) (NOT p4)))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p4)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 517 ms. Reduced automaton from 10 states, 36 edges and 5 AP (stutter insensitive) to 10 states, 36 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 440 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (AND p0 (NOT p2) p1 (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), false, (AND (NOT p1) (NOT p4)), false]
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40000 steps (24 resets) in 372 ms. (107 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
[2025-06-02 22:58:47] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:58:47] [INFO ] Invariant cache hit.
[2025-06-02 22:58:47] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 26/1040 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/25 constraints, State Equation: 0/348 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p4) p3), (X (NOT p2)), (X p3), (X (NOT p4)), (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4)))), (X (AND p1 (NOT p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (X (AND p1 p3 (NOT p4))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p4))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))), (X (X (AND p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4)))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND p1 (NOT p2) p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (AND p1 (NOT p2) (NOT p4)))), (X (X (AND p1 p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p4)))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1) p2 (NOT p3) p4)), (G (OR (NOT p0) (NOT p1) p2 p3 p4))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p2 p4) (OR p2 p3 p4)))), (F (NOT (OR p1 p4))), (F (NOT (AND (OR p0 p2) (OR p1 p2)))), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 p3 (NOT p4)))), (F (NOT (AND p1 (NOT p2) (NOT p4)))), (F (NOT (AND (OR p1 p4) (OR p3 p4)))), (F (NOT (OR p1 p2 p4))), (F (NOT (AND p0 p1 (NOT p2)))), (F p2), (F (NOT p1)), (F p4), (F (NOT p0)), (F (NOT (AND p1 (NOT p4)))), (F (NOT p3)), (F (NOT (AND p1 (NOT p2) p3 (NOT p4))))]
Knowledge based reduction with 39 factoid took 1397 ms. Reduced automaton from 10 states, 36 edges and 5 AP (stutter insensitive) to 11 states, 37 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 476 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), false, (AND (NOT p1) (NOT p4)), false, false]
Stuttering acceptance computed with spot in 487 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), false, (AND (NOT p1) (NOT p4)), false, false]
Stuttering acceptance computed with spot in 459 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), false, (AND (NOT p1) (NOT p4)), false, false]
Product exploration explored 100000 steps with 2197 reset in 693 ms.
Stack based approach found an accepted trace after 56339 steps with 1247 reset with depth 231 and stack size 231 in 389 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-03 finished in 225106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 96 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 192 place count 372 transition count 728
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 198 place count 366 transition count 722
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 366 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 300 place count 318 transition count 674
Applied a total of 300 rules in 42 ms. Remains 318 /468 variables (removed 150) and now considering 674/824 (removed 150) transitions.
Running 672 sub problems to find dead transitions.
[2025-06-02 22:58:51] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2025-06-02 22:58:51] [INFO ] Computed 38 invariants in 8 ms
[2025-06-02 22:58:51] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:56] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:56] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:56] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:56] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:56] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:57] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:57] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:57] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:58] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:58:59] [INFO ] Deduced a trap composed of 184 places in 148 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:02] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:03] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:04] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:04] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/980 variables, and 50 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/980 variables, and 50 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40344ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 40345ms
[2025-06-02 22:59:32] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 22:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:59:32] [INFO ] Implicit Places using invariants in 787 ms returned []
[2025-06-02 22:59:32] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 22:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:59:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:59:36] [INFO ] Implicit Places using invariants and state equation in 3950 ms returned []
Implicit Place search using SMT with State Equation took 4739 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:59:36] [INFO ] Redundant transitions in 10 ms returned []
Running 672 sub problems to find dead transitions.
[2025-06-02 22:59:36] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 22:59:36] [INFO ] Invariant cache hit.
[2025-06-02 22:59:36] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:42] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:42] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:42] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:42] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:42] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:42] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:42] [INFO ] Deduced a trap composed of 109 places in 152 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:42] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:43] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:47] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:47] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:47] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:48] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:59:54] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/980 variables, and 50 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/317 variables, 1/51 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:36] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/980 variables, and 52 constraints, problems are : Problem set: 36 solved, 636 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 36 solved, 636 unsolved
Search for dead transitions found 36 dead transitions in 60313ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 318/468 places, 638/824 transitions.
Applied a total of 0 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:00:37] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 105474 ms. Remains : 318/468 places, 638/824 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-04
Product exploration explored 100000 steps with 1682 reset in 292 ms.
Product exploration explored 100000 steps with 1687 reset in 305 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 113 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 638/638 transitions.
Applied a total of 0 rules in 8 ms. Remains 318 /318 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Running 636 sub problems to find dead transitions.
[2025-06-02 23:00:38] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
// Phase 1: matrix 626 rows 318 cols
[2025-06-02 23:00:38] [INFO ] Computed 38 invariants in 6 ms
[2025-06-02 23:00:38] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:43] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:43] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:43] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:43] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:43] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:44] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:44] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:44] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:44] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:44] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:44] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:45] [INFO ] Deduced a trap composed of 41 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-02 23:00:46] [INFO ] Deduced a trap composed of 184 places in 147 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:48] [INFO ] Deduced a trap composed of 151 places in 179 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:49] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:50] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:50] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:00:50] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/944 variables, and 54 constraints, problems are : Problem set: 0 solved, 636 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:07] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:14] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/944 variables, and 56 constraints, problems are : Problem set: 0 solved, 636 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/636 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40272ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 40273ms
[2025-06-02 23:01:18] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
[2025-06-02 23:01:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:01:19] [INFO ] Implicit Places using invariants in 787 ms returned []
[2025-06-02 23:01:19] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
[2025-06-02 23:01:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:01:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:01:22] [INFO ] Implicit Places using invariants and state equation in 3592 ms returned []
Implicit Place search using SMT with State Equation took 4380 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:01:22] [INFO ] Redundant transitions in 3 ms returned []
Running 636 sub problems to find dead transitions.
[2025-06-02 23:01:22] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
[2025-06-02 23:01:22] [INFO ] Invariant cache hit.
[2025-06-02 23:01:22] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 104 places in 169 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:28] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:29] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:29] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:33] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:35] [INFO ] Deduced a trap composed of 184 places in 146 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:38] [INFO ] Deduced a trap composed of 151 places in 161 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:44] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:44] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 56 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 6 (OVERLAPS) 1/317 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/944 variables, and 53 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:01:58] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:06] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:06] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:07] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:07] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/944 variables, and 57 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/636 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 104935 ms. Remains : 318/318 places, 638/638 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 111 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1712 reset in 269 ms.
Product exploration explored 100000 steps with 1725 reset in 282 ms.
Built C files in :
/tmp/ltsmin17018945922879250179
[2025-06-02 23:02:24] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2025-06-02 23:02:24] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:02:24] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2025-06-02 23:02:24] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:02:24] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2025-06-02 23:02:24] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:02:24] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17018945922879250179
Running compilation step : cd /tmp/ltsmin17018945922879250179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1764 ms.
Running link step : cd /tmp/ltsmin17018945922879250179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin17018945922879250179;'/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' '--hoa' '/tmp/stateBased5394448396978368032.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 638/638 transitions.
Applied a total of 0 rules in 16 ms. Remains 318 /318 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Running 636 sub problems to find dead transitions.
[2025-06-02 23:02:39] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
[2025-06-02 23:02:39] [INFO ] Invariant cache hit.
[2025-06-02 23:02:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:44] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:44] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:44] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:44] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:44] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:44] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:45] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:45] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:45] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:45] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:46] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:50] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:52] [INFO ] Deduced a trap composed of 184 places in 150 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:02:54] [INFO ] Deduced a trap composed of 151 places in 161 ms of which 39 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 9.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/944 variables, and 50 constraints, problems are : Problem set: 0 solved, 636 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:04] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:05] [INFO ] Deduced a trap composed of 114 places in 160 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:05] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:11] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:12] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:18] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:18] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 27 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/944 variables, and 57 constraints, problems are : Problem set: 0 solved, 636 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/636 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40254ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 40255ms
[2025-06-02 23:03:19] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
[2025-06-02 23:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:03:20] [INFO ] Implicit Places using invariants in 811 ms returned []
[2025-06-02 23:03:20] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
[2025-06-02 23:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:03:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:03:24] [INFO ] Implicit Places using invariants and state equation in 3683 ms returned []
Implicit Place search using SMT with State Equation took 4496 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:03:24] [INFO ] Redundant transitions in 4 ms returned []
Running 636 sub problems to find dead transitions.
[2025-06-02 23:03:24] [INFO ] Flow matrix only has 626 transitions (discarded 12 similar events)
[2025-06-02 23:03:24] [INFO ] Invariant cache hit.
[2025-06-02 23:03:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:29] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:29] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:29] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:29] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:29] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:29] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:29] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:30] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:30] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:30] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:31] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:35] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:37] [INFO ] Deduced a trap composed of 184 places in 146 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:39] [INFO ] Deduced a trap composed of 151 places in 156 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:45] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:45] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 57 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 6 (OVERLAPS) 1/317 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/944 variables, and 53 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:03:59] [INFO ] Deduced a trap composed of 114 places in 176 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:04:07] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:04:08] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:04:08] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:04:08] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/944 variables, and 57 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/636 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105030 ms. Remains : 318/318 places, 638/638 transitions.
Built C files in :
/tmp/ltsmin8324790447614971385
[2025-06-02 23:04:24] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2025-06-02 23:04:24] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:04:24] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2025-06-02 23:04:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:04:24] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2025-06-02 23:04:24] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:04:24] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8324790447614971385
Running compilation step : cd /tmp/ltsmin8324790447614971385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1624 ms.
Running link step : cd /tmp/ltsmin8324790447614971385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8324790447614971385;'/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' '--hoa' '/tmp/stateBased2617062525714557427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:04:39] [INFO ] Flatten gal took : 37 ms
[2025-06-02 23:04:39] [INFO ] Flatten gal took : 34 ms
[2025-06-02 23:04:39] [INFO ] Time to serialize gal into /tmp/LTL3867843698115485386.gal : 8 ms
[2025-06-02 23:04:39] [INFO ] Time to serialize properties into /tmp/LTL13035111713782030187.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3867843698115485386.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10273051053616149738.hoa' '-atoms' '/tmp/LTL13035111713782030187.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13035111713782030187.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10273051053616149738.hoa
Detected timeout of ITS tools.
[2025-06-02 23:04:54] [INFO ] Flatten gal took : 55 ms
[2025-06-02 23:04:54] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:04:54] [INFO ] Time to serialize gal into /tmp/LTL4139475230290855292.gal : 5 ms
[2025-06-02 23:04:54] [INFO ] Time to serialize properties into /tmp/LTL11432733863339224064.ltl : 3 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4139475230290855292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11432733863339224064.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((P_1095<1)||(P_1113_5<1))&&((P_1095<1)||(P_1113_3<1)))&&(((P_1095<1)||(P_1113_4<1))&&((P_1095<1)||(P_1113_1<1))))&&(((P_10...210
Formula 0 simplified : FG!"(((((P_1095<1)||(P_1113_5<1))&&((P_1095<1)||(P_1113_3<1)))&&(((P_1095<1)||(P_1113_4<1))&&((P_1095<1)||(P_1113_1<1))))&&(((P_1095...204
Detected timeout of ITS tools.
[2025-06-02 23:05:09] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:05:09] [INFO ] Applying decomposition
[2025-06-02 23:05:09] [INFO ] Flatten gal took : 26 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/graph8610752245336861427.txt' '-o' '/tmp/graph8610752245336861427.bin' '-w' '/tmp/graph8610752245336861427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8610752245336861427.bin' '-l' '-1' '-v' '-w' '/tmp/graph8610752245336861427.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:05:10] [INFO ] Decomposing Gal with order
[2025-06-02 23:05:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:05:10] [INFO ] Removed a total of 548 redundant transitions.
[2025-06-02 23:05:10] [INFO ] Flatten gal took : 126 ms
[2025-06-02 23:05:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 24 ms.
[2025-06-02 23:05:10] [INFO ] Time to serialize gal into /tmp/LTL226746631166033855.gal : 10 ms
[2025-06-02 23:05:10] [INFO ] Time to serialize properties into /tmp/LTL2389849015854329472.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL226746631166033855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2389849015854329472.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((u15.P_1095<1)||(u15.P_1113_5<1))&&((u15.P_1095<1)||(u15.P_1113_3<1)))&&(((u15.P_1095<1)||(u15.P_1113_4<1))&&((u15.P_1095<...258
Formula 0 simplified : FG!"(((((u15.P_1095<1)||(u15.P_1113_5<1))&&((u15.P_1095<1)||(u15.P_1113_3<1)))&&(((u15.P_1095<1)||(u15.P_1113_4<1))&&((u15.P_1095<1)...252
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-04 finished in 393629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))||X(F((G(F(p2))||(F(p2)&&X(X(p3)))))))))'
Support contains 20 out of 468 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 462 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 456 transition count 812
Applied a total of 24 rules in 16 ms. Remains 456 /468 variables (removed 12) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:05:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-02 23:05:25] [INFO ] Computed 38 invariants in 8 ms
[2025-06-02 23:05:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:31] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:31] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:31] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:31] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:31] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:31] [INFO ] Deduced a trap composed of 217 places in 252 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:32] [INFO ] Deduced a trap composed of 86 places in 201 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:32] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:32] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:32] [INFO ] Deduced a trap composed of 194 places in 225 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:33] [INFO ] Deduced a trap composed of 242 places in 203 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:33] [INFO ] Deduced a trap composed of 222 places in 252 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:37] [INFO ] Deduced a trap composed of 205 places in 208 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:37] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:39] [INFO ] Deduced a trap composed of 222 places in 206 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:39] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:53] [INFO ] Deduced a trap composed of 298 places in 220 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:57] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:05:59] [INFO ] Deduced a trap composed of 234 places in 146 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40339ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40340ms
[2025-06-02 23:06:05] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:06:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:06:06] [INFO ] Implicit Places using invariants in 448 ms returned []
[2025-06-02 23:06:06] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:06:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:06:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:06:11] [INFO ] Implicit Places using invariants and state equation in 5645 ms returned []
Implicit Place search using SMT with State Equation took 6095 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:06:11] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:06:11] [INFO ] Invariant cache hit.
[2025-06-02 23:06:11] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:18] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:18] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:19] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:19] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:19] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:20] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:22] [INFO ] Deduced a trap composed of 205 places in 234 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:22] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:24] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:27] [INFO ] Deduced a trap composed of 194 places in 223 ms of which 71 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:28] [INFO ] Deduced a trap composed of 86 places in 198 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:29] [INFO ] Deduced a trap composed of 121 places in 209 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:29] [INFO ] Deduced a trap composed of 242 places in 204 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:35] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:36] [INFO ] Deduced a trap composed of 234 places in 195 ms of which 59 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:06:54] [INFO ] Deduced a trap composed of 298 places in 221 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:00] [INFO ] Deduced a trap composed of 222 places in 223 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:01] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 56 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60350ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Starting structural reductions in LTL mode, iteration 1 : 456/468 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106811 ms. Remains : 456/468 places, 812/824 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-05
Product exploration explored 100000 steps with 33325 reset in 325 ms.
Product exploration explored 100000 steps with 33384 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 111 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 30121 steps (8 resets) in 314 ms. (95 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F p0), (F p1), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 15 factoid took 267 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 20 out of 456 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 9 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:07:13] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:07:13] [INFO ] Invariant cache hit.
[2025-06-02 23:07:13] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:20] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:21] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:21] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:21] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:22] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:22] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:24] [INFO ] Deduced a trap composed of 205 places in 236 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:24] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:27] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:29] [INFO ] Deduced a trap composed of 194 places in 213 ms of which 70 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:31] [INFO ] Deduced a trap composed of 86 places in 205 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:31] [INFO ] Deduced a trap composed of 121 places in 199 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:31] [INFO ] Deduced a trap composed of 242 places in 210 ms of which 51 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 49 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:50] [INFO ] Deduced a trap composed of 298 places in 204 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:07:54] [INFO ] Deduced a trap composed of 222 places in 196 ms of which 50 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40394ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40396ms
[2025-06-02 23:07:54] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:07:54] [INFO ] Implicit Places using invariants in 428 ms returned []
[2025-06-02 23:07:54] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:07:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:08:00] [INFO ] Implicit Places using invariants and state equation in 5545 ms returned []
Implicit Place search using SMT with State Equation took 5979 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:08:00] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:08:00] [INFO ] Invariant cache hit.
[2025-06-02 23:08:00] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:07] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:07] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:07] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:07] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:08] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:08] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:10] [INFO ] Deduced a trap composed of 205 places in 248 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:10] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:13] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:16] [INFO ] Deduced a trap composed of 194 places in 231 ms of which 71 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:17] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:17] [INFO ] Deduced a trap composed of 121 places in 201 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:17] [INFO ] Deduced a trap composed of 242 places in 194 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:24] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:25] [INFO ] Deduced a trap composed of 234 places in 192 ms of which 59 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:42] [INFO ] Deduced a trap composed of 298 places in 218 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:48] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:08:49] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60350ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Finished structural reductions in LTL mode , in 1 iterations and 106745 ms. Remains : 456/456 places, 812/812 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 111 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (12 resets) in 260 ms. (153 steps per ms) remains 2/7 properties
BEST_FIRST walk for 8655 steps (1 resets) in 30 ms. (279 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F p0), (F p1), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 15 factoid took 322 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33378 reset in 297 ms.
Product exploration explored 100000 steps with 33489 reset in 310 ms.
Built C files in :
/tmp/ltsmin17917758864812326817
[2025-06-02 23:09:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17917758864812326817
Running compilation step : cd /tmp/ltsmin17917758864812326817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1301 ms.
Running link step : cd /tmp/ltsmin17917758864812326817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17917758864812326817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18177942526530492454.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 11 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:09:17] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:09:17] [INFO ] Invariant cache hit.
[2025-06-02 23:09:17] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:24] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:24] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:24] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:24] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:25] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:25] [INFO ] Deduced a trap composed of 64 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-02 23:09:27] [INFO ] Deduced a trap composed of 205 places in 247 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:27] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:30] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:33] [INFO ] Deduced a trap composed of 194 places in 224 ms of which 70 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:34] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:34] [INFO ] Deduced a trap composed of 121 places in 198 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:35] [INFO ] Deduced a trap composed of 242 places in 202 ms of which 52 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 (/ 21.0 4.0))
(s1 (/ 19.0 4.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 (/ 3.0 4.0))
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 (/ 1.0 3.0))
(s157 (/ 1.0 3.0))
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 (/ 2.0 3.0))
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 (/ 1.0 4.0))
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 (/ 2.0 3.0))
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 49 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:54] [INFO ] Deduced a trap composed of 298 places in 211 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:09:57] [INFO ] Deduced a trap composed of 222 places in 193 ms of which 52 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40322ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40325ms
[2025-06-02 23:09:57] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:09:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:09:58] [INFO ] Implicit Places using invariants in 514 ms returned []
[2025-06-02 23:09:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:09:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:09:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:10:03] [INFO ] Implicit Places using invariants and state equation in 4847 ms returned []
Implicit Place search using SMT with State Equation took 5361 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:10:03] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:10:03] [INFO ] Invariant cache hit.
[2025-06-02 23:10:03] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:10] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:10] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:10] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:10] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:11] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:11] [INFO ] Deduced a trap composed of 64 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-02 23:10:13] [INFO ] Deduced a trap composed of 205 places in 242 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:13] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:16] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:18] [INFO ] Deduced a trap composed of 194 places in 224 ms of which 71 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:20] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:20] [INFO ] Deduced a trap composed of 121 places in 205 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:20] [INFO ] Deduced a trap composed of 242 places in 198 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:27] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:28] [INFO ] Deduced a trap composed of 234 places in 185 ms of which 59 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:45] [INFO ] Deduced a trap composed of 298 places in 220 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:51] [INFO ] Deduced a trap composed of 222 places in 220 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:10:52] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Finished structural reductions in LTL mode , in 1 iterations and 106016 ms. Remains : 456/456 places, 812/812 transitions.
Built C files in :
/tmp/ltsmin7824703212809331030
[2025-06-02 23:11:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7824703212809331030
Running compilation step : cd /tmp/ltsmin7824703212809331030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1333 ms.
Running link step : cd /tmp/ltsmin7824703212809331030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7824703212809331030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15203524811426085761.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:11:18] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:11:18] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:11:18] [INFO ] Time to serialize gal into /tmp/LTL15385401874996243934.gal : 5 ms
[2025-06-02 23:11:18] [INFO ] Time to serialize properties into /tmp/LTL18116153636931184690.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15385401874996243934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14500029099749401362.hoa' '-atoms' '/tmp/LTL18116153636931184690.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18116153636931184690.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14500029099749401362.hoa
Detected timeout of ITS tools.
[2025-06-02 23:11:33] [INFO ] Flatten gal took : 32 ms
[2025-06-02 23:11:33] [INFO ] Flatten gal took : 26 ms
[2025-06-02 23:11:33] [INFO ] Time to serialize gal into /tmp/LTL8443403946229488746.gal : 4 ms
[2025-06-02 23:11:33] [INFO ] Time to serialize properties into /tmp/LTL16445896614765736691.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8443403946229488746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16445896614765736691.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((RunB_4>=1)||(RunB_5>=1))||((RunB_2>=1)||(RunB_3>=1)))||((RunB_0>=1)||(RunB_1>=1)))")&&(X("((((QueueJobE_1>=1)||(QueueJob...1264
Formula 0 simplified : F(G(!"((((RunB_4>=1)||(RunB_5>=1))||((RunB_2>=1)||(RunB_3>=1)))||((RunB_0>=1)||(RunB_1>=1)))" | X!"((((QueueJobE_1>=1)||(QueueJobE_0...1242
Detected timeout of ITS tools.
[2025-06-02 23:11:48] [INFO ] Flatten gal took : 30 ms
[2025-06-02 23:11:48] [INFO ] Applying decomposition
[2025-06-02 23:11:49] [INFO ] Flatten gal took : 27 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/graph5782289574286524244.txt' '-o' '/tmp/graph5782289574286524244.bin' '-w' '/tmp/graph5782289574286524244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5782289574286524244.bin' '-l' '-1' '-v' '-w' '/tmp/graph5782289574286524244.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:11:49] [INFO ] Decomposing Gal with order
[2025-06-02 23:11:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:11:49] [INFO ] Removed a total of 660 redundant transitions.
[2025-06-02 23:11:49] [INFO ] Flatten gal took : 98 ms
[2025-06-02 23:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 19 ms.
[2025-06-02 23:11:49] [INFO ] Time to serialize gal into /tmp/LTL15366729302357481345.gal : 6 ms
[2025-06-02 23:11:49] [INFO ] Time to serialize properties into /tmp/LTL16951386078437729809.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15366729302357481345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16951386078437729809.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((i10.i0.u67.RunB_4>=1)||(i2.u68.RunB_5>=1))||((i12.i0.u66.RunB_2>=1)||(i3.i3.u70.RunB_3>=1)))||((i11.i0.u65.RunB_0>=1)||(...1822
Formula 0 simplified : F(G(!"((((i10.i0.u67.RunB_4>=1)||(i2.u68.RunB_5>=1))||((i12.i0.u66.RunB_2>=1)||(i3.i3.u70.RunB_3>=1)))||((i11.i0.u65.RunB_0>=1)||(i3...1800
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-05 finished in 398947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(X(p0))||(F(!p1)&&X(p0)&&X(((X(p2) U ((!p3&&X(p2))||G(X(p2)))) U (((X(p2) U ((!p3&&X(p2))||G(X(p2))))&&p4)||G((X(p2) U ((!p3&&X(p2))||G(X(p2))))))))))))'
Support contains 35 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 462 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 462 transition count 818
Applied a total of 12 rules in 15 ms. Remains 462 /468 variables (removed 6) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-02 23:12:04] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2025-06-02 23:12:04] [INFO ] Computed 38 invariants in 15 ms
[2025-06-02 23:12:04] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:10] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:10] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:10] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:10] [INFO ] Deduced a trap composed of 65 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:10] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:11] [INFO ] Deduced a trap composed of 217 places in 252 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:11] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:11] [INFO ] Deduced a trap composed of 200 places in 231 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:12] [INFO ] Deduced a trap composed of 223 places in 253 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:14] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:16] [INFO ] Deduced a trap composed of 205 places in 254 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:16] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:18] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:19] [INFO ] Deduced a trap composed of 235 places in 210 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:19] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:19] [INFO ] Deduced a trap composed of 127 places in 214 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:22] [INFO ] Deduced a trap composed of 248 places in 216 ms of which 55 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 53 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 53 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40345ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40347ms
[2025-06-02 23:12:44] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 23:12:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:12:45] [INFO ] Implicit Places using invariants in 623 ms returned []
[2025-06-02 23:12:45] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 23:12:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:12:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:12:50] [INFO ] Implicit Places using invariants and state equation in 5036 ms returned []
Implicit Place search using SMT with State Equation took 5663 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2025-06-02 23:12:50] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 23:12:50] [INFO ] Invariant cache hit.
[2025-06-02 23:12:50] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:56] [INFO ] Deduced a trap composed of 65 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:56] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:56] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:56] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:56] [INFO ] Deduced a trap composed of 65 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:56] [INFO ] Deduced a trap composed of 217 places in 222 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:57] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:57] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:57] [INFO ] Deduced a trap composed of 200 places in 211 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:58] [INFO ] Deduced a trap composed of 223 places in 271 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:58] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:58] [INFO ] Deduced a trap composed of 205 places in 198 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:58] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:59] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:59] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:12:59] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:04] [INFO ] Deduced a trap composed of 223 places in 213 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:05] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:05] [INFO ] Deduced a trap composed of 235 places in 230 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:06] [INFO ] Deduced a trap composed of 248 places in 207 ms of which 56 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:14] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 29 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 timeout
0.0)
(s65 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1268 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1268 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60333ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 60335ms
Starting structural reductions in LTL mode, iteration 1 : 462/468 places, 818/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106363 ms. Remains : 462/468 places, 818/824 transitions.
Stuttering acceptance computed with spot in 606 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), p1, (AND p0 (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 181 steps with 3 reset in 6 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-06 finished in 107024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 54 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 420 transition count 776
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 96 place count 420 transition count 752
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 144 place count 396 transition count 752
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 150 place count 390 transition count 746
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 390 transition count 746
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 216 place count 360 transition count 716
Applied a total of 216 rules in 35 ms. Remains 360 /468 variables (removed 108) and now considering 716/824 (removed 108) transitions.
Running 714 sub problems to find dead transitions.
[2025-06-02 23:13:51] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
// Phase 1: matrix 704 rows 360 cols
[2025-06-02 23:13:51] [INFO ] Computed 38 invariants in 6 ms
[2025-06-02 23:13:51] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:56] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:56] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:56] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:56] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:56] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:56] [INFO ] Deduced a trap composed of 157 places in 205 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:56] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:57] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:57] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:57] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:13:57] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:07] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:09] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 29 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 9.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 4.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 2.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)timeout
(s331 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1064 variables, and 49 constraints, problems are : Problem set: 0 solved, 714 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 714 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:17] [INFO ] Deduced a trap composed of 226 places in 176 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:20] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:20] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1064 variables, and 52 constraints, problems are : Problem set: 0 solved, 714 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/714 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40347ms problems are : Problem set: 0 solved, 714 unsolved
Search for dead transitions found 0 dead transitions in 40348ms
[2025-06-02 23:14:31] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
[2025-06-02 23:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:14:32] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-02 23:14:32] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
[2025-06-02 23:14:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:14:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:14:35] [INFO ] Implicit Places using invariants and state equation in 3067 ms returned []
Implicit Place search using SMT with State Equation took 3819 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:14:35] [INFO ] Redundant transitions in 6 ms returned []
Running 714 sub problems to find dead transitions.
[2025-06-02 23:14:35] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
[2025-06-02 23:14:35] [INFO ] Invariant cache hit.
[2025-06-02 23:14:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:40] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:40] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:41] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:41] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:41] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:42] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:44] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:44] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:47] [INFO ] Deduced a trap composed of 122 places in 160 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:14:49] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1064 variables, and 46 constraints, problems are : Problem set: 0 solved, 714 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 714 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/360 variables, 2/48 constraints. Problems are: Problem set: 66 solved, 648 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:34] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:34] [INFO ] Deduced a trap composed of 157 places in 184 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:34] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1064 variables, and 51 constraints, problems are : Problem set: 66 solved, 648 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/714 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 66 solved, 648 unsolved
Search for dead transitions found 66 dead transitions in 60336ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 360/468 places, 650/824 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 346 transition count 626
Applied a total of 12 rules in 11 ms. Remains 346 /360 variables (removed 14) and now considering 626/650 (removed 24) transitions.
[2025-06-02 23:15:35] [INFO ] Flow matrix only has 614 transitions (discarded 12 similar events)
// Phase 1: matrix 614 rows 346 cols
[2025-06-02 23:15:35] [INFO ] Computed 38 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:15:36] [INFO ] Implicit Places using invariants in 781 ms returned []
[2025-06-02 23:15:36] [INFO ] Flow matrix only has 614 transitions (discarded 12 similar events)
[2025-06-02 23:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:15:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:15:38] [INFO ] Implicit Places using invariants and state equation in 2273 ms returned []
Implicit Place search using SMT with State Equation took 3056 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/468 places, 626/824 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107621 ms. Remains : 346/468 places, 626/824 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-07
Product exploration explored 100000 steps with 749 reset in 369 ms.
Stack based approach found an accepted trace after 1073 steps with 10 reset with depth 166 and stack size 166 in 4 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-07 finished in 108046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 13 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 468 transition count 776
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 96 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 192 place count 372 transition count 728
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 198 place count 366 transition count 722
Iterating global reduction 2 with 6 rules applied. Total rules applied 204 place count 366 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 300 place count 318 transition count 674
Applied a total of 300 rules in 32 ms. Remains 318 /468 variables (removed 150) and now considering 674/824 (removed 150) transitions.
Running 672 sub problems to find dead transitions.
[2025-06-02 23:15:39] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2025-06-02 23:15:39] [INFO ] Computed 38 invariants in 12 ms
[2025-06-02 23:15:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:43] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:43] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:43] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:43] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:43] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:43] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:44] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:44] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:44] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:44] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:48] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:49] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:49] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:49] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:15:55] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/980 variables, and 51 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:07] [INFO ] Deduced a trap composed of 184 places in 163 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:18] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/980 variables, and 53 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40333ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 40336ms
[2025-06-02 23:16:19] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 23:16:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:16:20] [INFO ] Implicit Places using invariants in 700 ms returned []
[2025-06-02 23:16:20] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 23:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:16:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:16:23] [INFO ] Implicit Places using invariants and state equation in 3341 ms returned []
Implicit Place search using SMT with State Equation took 4049 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:16:23] [INFO ] Redundant transitions in 8 ms returned []
Running 672 sub problems to find dead transitions.
[2025-06-02 23:16:23] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 23:16:23] [INFO ] Invariant cache hit.
[2025-06-02 23:16:23] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:27] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:27] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:28] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:28] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:28] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:28] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:28] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:28] [INFO ] Deduced a trap composed of 114 places in 158 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:33] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:33] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:33] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:33] [INFO ] Deduced a trap composed of 103 places in 165 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:34] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:16:34] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/317 variables, 1/51 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/980 variables, and 51 constraints, problems are : Problem set: 36 solved, 636 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 636 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 11/11 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 25/36 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 14/50 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:02] [INFO ] Deduced a trap composed of 184 places in 158 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:10] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/52 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/980 variables, and 52 constraints, problems are : Problem set: 36 solved, 636 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 36 solved, 636 unsolved
Search for dead transitions found 36 dead transitions in 60297ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 318/468 places, 638/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 318 /318 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:17:24] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 104747 ms. Remains : 318/468 places, 638/824 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-08
Stuttering criterion allowed to conclude after 2580 steps with 0 reset in 12 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-08 finished in 104877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (G(p1)||X(p2)))))'
Support contains 24 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 468 /468 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-02 23:17:24] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 468 cols
[2025-06-02 23:17:24] [INFO ] Computed 38 invariants in 12 ms
[2025-06-02 23:17:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:32] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:32] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:34] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:34] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:34] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:34] [INFO ] Deduced a trap composed of 66 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-02 23:17:35] [INFO ] Deduced a trap composed of 205 places in 241 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:35] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:37] [INFO ] Deduced a trap composed of 217 places in 230 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:38] [INFO ] Deduced a trap composed of 223 places in 249 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:38] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:39] [INFO ] Deduced a trap composed of 235 places in 209 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:39] [INFO ] Deduced a trap composed of 223 places in 207 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:41] [INFO ] Deduced a trap composed of 206 places in 235 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:42] [INFO ] Deduced a trap composed of 254 places in 239 ms of which 83 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:43] [INFO ] Deduced a trap composed of 98 places in 199 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:43] [INFO ] Deduced a trap composed of 133 places in 208 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:43] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1280 variables, and 54 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1280 variables, and 54 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40336ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40337ms
[2025-06-02 23:18:04] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 23:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:18:05] [INFO ] Implicit Places using invariants in 506 ms returned []
[2025-06-02 23:18:05] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 23:18:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:18:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:18:10] [INFO ] Implicit Places using invariants and state equation in 5332 ms returned []
Implicit Place search using SMT with State Equation took 5844 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2025-06-02 23:18:10] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 23:18:10] [INFO ] Invariant cache hit.
[2025-06-02 23:18:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:17] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:17] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:17] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:17] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:17] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:17] [INFO ] Deduced a trap composed of 217 places in 226 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:17] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:18] [INFO ] Deduced a trap composed of 254 places in 221 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:18] [INFO ] Deduced a trap composed of 223 places in 224 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:19] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:19] [INFO ] Deduced a trap composed of 205 places in 237 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:24] [INFO ] Deduced a trap composed of 223 places in 205 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:25] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:25] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:25] [INFO ] Deduced a trap composed of 235 places in 214 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:26] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:26] [INFO ] Deduced a trap composed of 133 places in 208 ms of which 64 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:32] [INFO ] Deduced a trap composed of 217 places in 230 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:32] [INFO ] Deduced a trap composed of 229 places in 200 ms of which 56 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1280 variables, and 55 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:46] [INFO ] Deduced a trap composed of 299 places in 231 ms of which 82 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/467 variables, 1/57 constraints. Problems are: Problem set: 36 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/1280 variables, and 57 constraints, problems are : Problem set: 36 solved, 786 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 36 solved, 786 unsolved
Search for dead transitions found 36 dead transitions in 60339ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 468/468 places, 788/824 transitions.
Applied a total of 0 rules in 4 ms. Remains 468 /468 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106535 ms. Remains : 468/468 places, 788/824 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-09 finished in 106847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 12 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 462 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 456 transition count 812
Applied a total of 24 rules in 11 ms. Remains 456 /468 variables (removed 12) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:19:11] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-02 23:19:11] [INFO ] Computed 38 invariants in 7 ms
[2025-06-02 23:19:11] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:16] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:16] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:16] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:16] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:16] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:17] [INFO ] Deduced a trap composed of 217 places in 256 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:17] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:17] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:17] [INFO ] Deduced a trap composed of 121 places in 186 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:18] [INFO ] Deduced a trap composed of 194 places in 224 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:18] [INFO ] Deduced a trap composed of 242 places in 203 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:18] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:22] [INFO ] Deduced a trap composed of 205 places in 206 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:22] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:24] [INFO ] Deduced a trap composed of 222 places in 194 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:25] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:38] [INFO ] Deduced a trap composed of 298 places in 217 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:42] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:19:43] [INFO ] Deduced a trap composed of 234 places in 144 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40345ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40347ms
[2025-06-02 23:19:51] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:19:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:19:51] [INFO ] Implicit Places using invariants in 414 ms returned []
[2025-06-02 23:19:51] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:19:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:19:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:19:56] [INFO ] Implicit Places using invariants and state equation in 4250 ms returned []
Implicit Place search using SMT with State Equation took 4674 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:19:56] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:19:56] [INFO ] Invariant cache hit.
[2025-06-02 23:19:56] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:02] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:03] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:03] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:03] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:04] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:04] [INFO ] Deduced a trap composed of 64 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-02 23:20:06] [INFO ] Deduced a trap composed of 205 places in 242 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:06] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:08] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:11] [INFO ] Deduced a trap composed of 194 places in 217 ms of which 72 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:12] [INFO ] Deduced a trap composed of 86 places in 196 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:12] [INFO ] Deduced a trap composed of 121 places in 201 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:12] [INFO ] Deduced a trap composed of 242 places in 198 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:18] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:19] [INFO ] Deduced a trap composed of 234 places in 188 ms of which 59 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:37] [INFO ] Deduced a trap composed of 298 places in 216 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:43] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:20:44] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60330ms
Starting structural reductions in LTL mode, iteration 1 : 456/468 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105366 ms. Remains : 456/468 places, 812/824 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-10 finished in 105495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 468 transition count 776
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 420 transition count 770
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 414 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 108 place count 414 transition count 722
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 204 place count 366 transition count 722
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 210 place count 360 transition count 716
Iterating global reduction 3 with 6 rules applied. Total rules applied 216 place count 360 transition count 716
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 300 place count 318 transition count 674
Applied a total of 300 rules in 33 ms. Remains 318 /468 variables (removed 150) and now considering 674/824 (removed 150) transitions.
Running 672 sub problems to find dead transitions.
[2025-06-02 23:20:56] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 318 cols
[2025-06-02 23:20:56] [INFO ] Computed 38 invariants in 11 ms
[2025-06-02 23:20:56] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:02] [INFO ] Deduced a trap composed of 109 places in 201 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:02] [INFO ] Deduced a trap composed of 114 places in 181 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:02] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:02] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:03] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:03] [INFO ] Deduced a trap composed of 41 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-02 23:21:07] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:07] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/980 variables, and 49 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:26] [INFO ] Deduced a trap composed of 184 places in 146 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:31] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:31] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/980 variables, and 52 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/672 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40282ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 40285ms
[2025-06-02 23:21:36] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 23:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:21:37] [INFO ] Implicit Places using invariants in 755 ms returned []
[2025-06-02 23:21:37] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 23:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:21:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:21:40] [INFO ] Implicit Places using invariants and state equation in 3111 ms returned []
Implicit Place search using SMT with State Equation took 3868 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:21:40] [INFO ] Redundant transitions in 7 ms returned []
Running 672 sub problems to find dead transitions.
[2025-06-02 23:21:40] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 23:21:40] [INFO ] Invariant cache hit.
[2025-06-02 23:21:40] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:45] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:45] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:46] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:46] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:46] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:46] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:46] [INFO ] Deduced a trap composed of 114 places in 181 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:47] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:49] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:49] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:51] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:51] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:56] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/317 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/980 variables, and 50 constraints, problems are : Problem set: 36 solved, 636 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/318 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 636 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 23/36 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 13/49 constraints. Problems are: Problem set: 36 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:24] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:24] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/51 constraints. Problems are: Problem set: 36 solved, 636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/51 constraints. Problems are: Problem set: 36 solved, 636 unsolved
SMT process timed out in 60307ms, After SMT, problems are : Problem set: 36 solved, 636 unsolved
Search for dead transitions found 36 dead transitions in 60308ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 318/468 places, 638/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 318 /318 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:22:41] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 104528 ms. Remains : 318/468 places, 638/824 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-11
Stuttering criterion allowed to conclude after 2322 steps with 0 reset in 13 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-11 finished in 104588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 14 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 462 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 462 transition count 818
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 456 transition count 812
Applied a total of 24 rules in 15 ms. Remains 456 /468 variables (removed 12) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:22:41] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-02 23:22:41] [INFO ] Computed 38 invariants in 11 ms
[2025-06-02 23:22:41] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:47] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:47] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:47] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:47] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:47] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:47] [INFO ] Deduced a trap composed of 217 places in 251 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:47] [INFO ] Deduced a trap composed of 86 places in 189 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:48] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:48] [INFO ] Deduced a trap composed of 121 places in 191 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:48] [INFO ] Deduced a trap composed of 194 places in 234 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:48] [INFO ] Deduced a trap composed of 242 places in 210 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:49] [INFO ] Deduced a trap composed of 222 places in 265 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:53] [INFO ] Deduced a trap composed of 205 places in 213 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:53] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:55] [INFO ] Deduced a trap composed of 222 places in 204 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:55] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:09] [INFO ] Deduced a trap composed of 298 places in 230 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:13] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:15] [INFO ] Deduced a trap composed of 234 places in 141 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40320ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40322ms
[2025-06-02 23:23:21] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:23:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:22] [INFO ] Implicit Places using invariants in 473 ms returned []
[2025-06-02 23:23:22] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:23:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:23:27] [INFO ] Implicit Places using invariants and state equation in 5383 ms returned []
Implicit Place search using SMT with State Equation took 5859 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:23:27] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:23:27] [INFO ] Invariant cache hit.
[2025-06-02 23:23:27] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:34] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:34] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:34] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:34] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:35] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:35] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:37] [INFO ] Deduced a trap composed of 205 places in 239 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:37] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:40] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:42] [INFO ] Deduced a trap composed of 194 places in 216 ms of which 70 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:44] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:44] [INFO ] Deduced a trap composed of 121 places in 210 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:44] [INFO ] Deduced a trap composed of 242 places in 197 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:51] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:23:52] [INFO ] Deduced a trap composed of 234 places in 205 ms of which 59 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:09] [INFO ] Deduced a trap composed of 298 places in 215 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:15] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:16] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Starting structural reductions in LTL mode, iteration 1 : 456/468 places, 812/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106548 ms. Remains : 456/468 places, 812/824 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-14
Product exploration explored 100000 steps with 1484 reset in 363 ms.
Product exploration explored 100000 steps with 1482 reset in 386 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 63 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 257 steps (0 resets) in 6 ms. (36 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-02 23:24:29] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:24:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:24:29] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 23:24:30] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 925 ms returned sat
[2025-06-02 23:24:40] [INFO ] [Real]Absence check using state equation in 9678 ms returned sat
[2025-06-02 23:24:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:24:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 23:24:40] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 297 ms returned sat
[2025-06-02 23:24:43] [INFO ] [Nat]Absence check using state equation in 2584 ms returned sat
[2025-06-02 23:24:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:24:44] [INFO ] [Nat]Added 72 Read/Feed constraints in 1068 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:44] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:44] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:44] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:45] [INFO ] Deduced a trap composed of 121 places in 219 ms of which 65 ms to minimize.
[2025-06-02 23:24:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 914 ms
[2025-06-02 23:24:45] [INFO ] Computed and/alt/rep : 546/1845/540 causal constraints (skipped 258 transitions) in 47 ms.
[2025-06-02 23:24:52] [INFO ] Added : 404 causal constraints over 82 iterations in 7249 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 14 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:24:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:24:52] [INFO ] Invariant cache hit.
[2025-06-02 23:24:52] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:59] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:59] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:59] [INFO ] Deduced a trap composed of 64 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-02 23:24:59] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:00] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:00] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:03] [INFO ] Deduced a trap composed of 205 places in 244 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:03] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:05] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:08] [INFO ] Deduced a trap composed of 194 places in 225 ms of which 71 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:09] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:10] [INFO ] Deduced a trap composed of 121 places in 207 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:10] [INFO ] Deduced a trap composed of 242 places in 207 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 49 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:29] [INFO ] Deduced a trap composed of 298 places in 208 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 50 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40332ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40334ms
[2025-06-02 23:25:32] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:25:33] [INFO ] Implicit Places using invariants in 481 ms returned []
[2025-06-02 23:25:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:25:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:25:38] [INFO ] Implicit Places using invariants and state equation in 5488 ms returned []
Implicit Place search using SMT with State Equation took 5971 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:25:38] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:25:38] [INFO ] Invariant cache hit.
[2025-06-02 23:25:38] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:46] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:46] [INFO ] Deduced a trap composed of 64 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-02 23:25:46] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:46] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:47] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:47] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:49] [INFO ] Deduced a trap composed of 205 places in 245 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:49] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:52] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:54] [INFO ] Deduced a trap composed of 194 places in 227 ms of which 71 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:56] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:56] [INFO ] Deduced a trap composed of 121 places in 213 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:56] [INFO ] Deduced a trap composed of 242 places in 205 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:03] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:04] [INFO ] Deduced a trap composed of 234 places in 187 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:21] [INFO ] Deduced a trap composed of 298 places in 228 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:28] [INFO ] Deduced a trap composed of 222 places in 237 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:29] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Finished structural reductions in LTL mode , in 1 iterations and 106684 ms. Remains : 456/456 places, 812/812 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 290 steps (0 resets) in 6 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-02 23:26:39] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:26:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 23:26:41] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 950 ms returned sat
[2025-06-02 23:26:51] [INFO ] [Real]Absence check using state equation in 9861 ms returned sat
[2025-06-02 23:26:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:26:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 23:26:51] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 310 ms returned sat
[2025-06-02 23:26:54] [INFO ] [Nat]Absence check using state equation in 2657 ms returned sat
[2025-06-02 23:26:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:26:55] [INFO ] [Nat]Added 72 Read/Feed constraints in 1106 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:55] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:55] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:55] [INFO ] Deduced a trap composed of 64 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-02 23:26:56] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 64 ms to minimize.
[2025-06-02 23:26:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 903 ms
[2025-06-02 23:26:56] [INFO ] Computed and/alt/rep : 546/1845/540 causal constraints (skipped 258 transitions) in 49 ms.
[2025-06-02 23:27:03] [INFO ] Added : 404 causal constraints over 82 iterations in 7217 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1482 reset in 348 ms.
Product exploration explored 100000 steps with 1482 reset in 377 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 14 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 456 transition count 812
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 54 Pre rules applied. Total rules applied 30 place count 456 transition count 866
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 84 place count 456 transition count 866
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 444 transition count 854
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 444 transition count 854
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 138 place count 444 transition count 854
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 150 place count 432 transition count 842
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 162 place count 432 transition count 842
Deduced a syphon composed of 90 places in 1 ms
Applied a total of 162 rules in 65 ms. Remains 432 /456 variables (removed 24) and now considering 842/812 (removed -30) transitions.
Running 840 sub problems to find dead transitions.
[2025-06-02 23:27:04] [INFO ] Flow matrix only has 830 transitions (discarded 12 similar events)
// Phase 1: matrix 830 rows 432 cols
[2025-06-02 23:27:04] [INFO ] Computed 38 invariants in 11 ms
[2025-06-02 23:27:04] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:11] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:11] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:11] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:11] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:11] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:11] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:11] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 36 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:11] [INFO ] Deduced a trap composed of 127 places in 217 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:12] [INFO ] Deduced a trap composed of 132 places in 208 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:12] [INFO ] Deduced a trap composed of 115 places in 214 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:12] [INFO ] Deduced a trap composed of 120 places in 201 ms of which 38 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD776 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:18] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 42 ms to minimize.
Problem TDEAD780 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD825 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 12/48 constraints. Problems are: Problem set: 132 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:22] [INFO ] Deduced a trap composed of 196 places in 210 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:24] [INFO ] Deduced a trap composed of 120 places in 189 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:24] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1262 variables, and 51 constraints, problems are : Problem set: 132 solved, 708 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/432 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 840/840 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 132 solved, 708 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 10/10 constraints. Problems are: Problem set: 132 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 11/21 constraints. Problems are: Problem set: 132 solved, 708 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 15/36 constraints. Problems are: Problem set: 132 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/37 constraints. Problems are: Problem set: 132 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/37 constraints. Problems are: Problem set: 132 solved, 708 unsolved
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 5 (OVERLAPS) 19/371 variables, 2/39 constraints. Problems are: Problem set: 168 solved, 672 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 0)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 0)
(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 0)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 0)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 0)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 0)
(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 9)
(s123 1)
(s124 0)
(s125 1)
(s127 0)
(s129 0)
(s131 0)
(s133 0)
(s135 0)
(s137 0)
(s139 0)
(s141 0)
(s143 0)
(s145 0)
(s147 0)
(s149 0)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 0)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 0)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 0)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 0)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 0)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 0)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 0)
(s190 1)
(s191 1)
(s192 1)
(s193 0)
(s194 0)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 0)
(s204 1)
(s205 1)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 18)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s234 0)
(s235 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 1)
(s251 0)
(s252 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1262 variables, and 39 constraints, problems are : Problem set: 168 solved, 672 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/26 constraints, State Equation: 0/432 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/840 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40444ms problems are : Problem set: 168 solved, 672 unsolved
Search for dead transitions found 168 dead transitions in 40446ms
Found 168 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 168 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 168 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:27:45] [INFO ] Redundant transitions in 5 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 432/456 places, 674/812 transitions.
Graph (complete) has 1945 edges and 432 vertex of which 354 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.3 ms
Discarding 78 places :
Also discarding 0 output transitions
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 1 rules in 15 ms. Remains 354 /432 variables (removed 78) and now considering 674/674 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 354/456 places, 674/812 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40543 ms. Remains : 354/456 places, 674/812 transitions.
Built C files in :
/tmp/ltsmin10224070119689970469
[2025-06-02 23:27:45] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10224070119689970469
Running compilation step : cd /tmp/ltsmin10224070119689970469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1368 ms.
Running link step : cd /tmp/ltsmin10224070119689970469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10224070119689970469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17172145459493853748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 14 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 812/812 transitions.
Applied a total of 0 rules in 15 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:28:00] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2025-06-02 23:28:00] [INFO ] Computed 38 invariants in 10 ms
[2025-06-02 23:28:00] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:06] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:06] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:06] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:06] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:06] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:06] [INFO ] Deduced a trap composed of 217 places in 251 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:07] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:07] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:07] [INFO ] Deduced a trap composed of 121 places in 212 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:07] [INFO ] Deduced a trap composed of 194 places in 252 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:08] [INFO ] Deduced a trap composed of 242 places in 224 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:08] [INFO ] Deduced a trap composed of 222 places in 260 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:12] [INFO ] Deduced a trap composed of 205 places in 305 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:12] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:14] [INFO ] Deduced a trap composed of 222 places in 232 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:15] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 52 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:28] [INFO ] Deduced a trap composed of 298 places in 252 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:33] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:34] [INFO ] Deduced a trap composed of 234 places in 158 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40323ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40326ms
[2025-06-02 23:28:40] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:28:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:28:41] [INFO ] Implicit Places using invariants in 519 ms returned []
[2025-06-02 23:28:41] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:28:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:28:46] [INFO ] Implicit Places using invariants and state equation in 5571 ms returned []
Implicit Place search using SMT with State Equation took 6092 ms to find 0 implicit places.
Running 810 sub problems to find dead transitions.
[2025-06-02 23:28:46] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 23:28:46] [INFO ] Invariant cache hit.
[2025-06-02 23:28:46] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:53] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:53] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:54] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:54] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:54] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:55] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:57] [INFO ] Deduced a trap composed of 205 places in 247 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:57] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:59] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:02] [INFO ] Deduced a trap composed of 194 places in 241 ms of which 72 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:03] [INFO ] Deduced a trap composed of 86 places in 205 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:04] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:04] [INFO ] Deduced a trap composed of 242 places in 201 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:10] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:11] [INFO ] Deduced a trap composed of 234 places in 197 ms of which 60 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 51 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:28] [INFO ] Deduced a trap composed of 298 places in 223 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:35] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:36] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Finished structural reductions in LTL mode , in 1 iterations and 106761 ms. Remains : 456/456 places, 812/812 transitions.
Built C files in :
/tmp/ltsmin3743231767831475728
[2025-06-02 23:29:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3743231767831475728
Running compilation step : cd /tmp/ltsmin3743231767831475728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1353 ms.
Running link step : cd /tmp/ltsmin3743231767831475728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3743231767831475728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6214962344024411904.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:30:02] [INFO ] Flatten gal took : 25 ms
[2025-06-02 23:30:02] [INFO ] Flatten gal took : 24 ms
[2025-06-02 23:30:02] [INFO ] Time to serialize gal into /tmp/LTL10607222580095684933.gal : 4 ms
[2025-06-02 23:30:02] [INFO ] Time to serialize properties into /tmp/LTL18180109472723304907.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10607222580095684933.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2384871655014901435.hoa' '-atoms' '/tmp/LTL18180109472723304907.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18180109472723304907.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2384871655014901435.hoa
Detected timeout of ITS tools.
[2025-06-02 23:30:17] [INFO ] Flatten gal took : 22 ms
[2025-06-02 23:30:17] [INFO ] Flatten gal took : 22 ms
[2025-06-02 23:30:17] [INFO ] Time to serialize gal into /tmp/LTL15178959067031139081.gal : 4 ms
[2025-06-02 23:30:17] [INFO ] Time to serialize properties into /tmp/LTL15714096366126028418.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15178959067031139081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15714096366126028418.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((((G("(((((JobCnt>=1)&&(P_1617_5>=1))||((JobCnt>=1)&&(P_1617_0>=1)))||(((JobCnt>=1)&&(P_1617_2>=1))||((JobCnt>=1)&&(P_1617_1>...432
Formula 0 simplified : XXG(!"((((RunE_2>=1)&&(ORB_Lock>=1))||((RunE_3>=1)&&(ORB_Lock>=1)))||((RunE_4>=1)&&(ORB_Lock>=1)))" & !"(((RunE_5>=1)&&(ORB_Lock>=1)...418
Detected timeout of ITS tools.
[2025-06-02 23:30:32] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:30:32] [INFO ] Applying decomposition
[2025-06-02 23:30:32] [INFO ] Flatten gal took : 30 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/graph6914818998227065730.txt' '-o' '/tmp/graph6914818998227065730.bin' '-w' '/tmp/graph6914818998227065730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6914818998227065730.bin' '-l' '-1' '-v' '-w' '/tmp/graph6914818998227065730.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:30:32] [INFO ] Decomposing Gal with order
[2025-06-02 23:30:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:30:32] [INFO ] Removed a total of 607 redundant transitions.
[2025-06-02 23:30:32] [INFO ] Flatten gal took : 49 ms
[2025-06-02 23:30:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 12 ms.
[2025-06-02 23:30:32] [INFO ] Time to serialize gal into /tmp/LTL972351077785829170.gal : 6 ms
[2025-06-02 23:30:32] [INFO ] Time to serialize properties into /tmp/LTL13950283398031092929.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL972351077785829170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13950283398031092929.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((((G("(((((i3.u0.JobCnt>=1)&&(i1.i1.u38.P_1617_5>=1))||((i3.u0.JobCnt>=1)&&(i12.i1.u34.P_1617_0>=1)))||(((i3.u0.JobCnt>=1)&&(...658
Formula 0 simplified : XXG(!"((((i13.i1.u67.RunE_2>=1)&&(i13.i3.u12.ORB_Lock>=1))||((i13.i2.u63.RunE_3>=1)&&(i13.i3.u12.ORB_Lock>=1)))||((i9.i0.u64.RunE_4>...644
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-14 finished in 486626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (G(p0) U p1)))'
Support contains 13 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 468 transition count 794
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 438 transition count 794
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 60 place count 438 transition count 734
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 180 place count 378 transition count 734
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 186 place count 372 transition count 728
Iterating global reduction 2 with 6 rules applied. Total rules applied 192 place count 372 transition count 728
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 264 place count 336 transition count 692
Applied a total of 264 rules in 31 ms. Remains 336 /468 variables (removed 132) and now considering 692/824 (removed 132) transitions.
Running 690 sub problems to find dead transitions.
[2025-06-02 23:30:47] [INFO ] Flow matrix only has 680 transitions (discarded 12 similar events)
// Phase 1: matrix 680 rows 336 cols
[2025-06-02 23:30:47] [INFO ] Computed 38 invariants in 12 ms
[2025-06-02 23:30:47] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:52] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:52] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:52] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:52] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:52] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:53] [INFO ] Deduced a trap composed of 127 places in 185 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:53] [INFO ] Deduced a trap composed of 132 places in 190 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:53] [INFO ] Deduced a trap composed of 121 places in 179 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:53] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:54] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:54] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:59] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:59] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:02] [INFO ] Deduced a trap composed of 196 places in 162 ms of which 43 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/1016 variables, and 50 constraints, problems are : Problem set: 0 solved, 690 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:22] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:22] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 334/1016 variables, and 52 constraints, problems are : Problem set: 0 solved, 690 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40348ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 40349ms
[2025-06-02 23:31:28] [INFO ] Flow matrix only has 680 transitions (discarded 12 similar events)
[2025-06-02 23:31:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:31:29] [INFO ] Implicit Places using invariants in 819 ms returned []
[2025-06-02 23:31:29] [INFO ] Flow matrix only has 680 transitions (discarded 12 similar events)
[2025-06-02 23:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:31:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:31:32] [INFO ] Implicit Places using invariants and state equation in 3712 ms returned []
Implicit Place search using SMT with State Equation took 4533 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:31:32] [INFO ] Redundant transitions in 5 ms returned []
Running 690 sub problems to find dead transitions.
[2025-06-02 23:31:32] [INFO ] Flow matrix only has 680 transitions (discarded 12 similar events)
[2025-06-02 23:31:32] [INFO ] Invariant cache hit.
[2025-06-02 23:31:32] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:37] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:37] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:37] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:37] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:37] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:37] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:37] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:38] [INFO ] Deduced a trap composed of 132 places in 180 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:38] [INFO ] Deduced a trap composed of 121 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:38] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:39] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:40] [INFO ] Deduced a trap composed of 196 places in 185 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:43] [INFO ] Deduced a trap composed of 134 places in 168 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:44] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/335 variables, 1/51 constraints. Problems are: Problem set: 36 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 335/1016 variables, and 51 constraints, problems are : Problem set: 36 solved, 654 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 654 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 10/10 constraints. Problems are: Problem set: 36 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 26/36 constraints. Problems are: Problem set: 36 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 14/50 constraints. Problems are: Problem set: 36 solved, 654 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/50 constraints. Problems are: Problem set: 36 solved, 654 unsolved
At refinement iteration 4 (OVERLAPS) 1/335 variables, 1/51 constraints. Problems are: Problem set: 36 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/1016 variables, and 51 constraints, problems are : Problem set: 36 solved, 654 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60325ms problems are : Problem set: 36 solved, 654 unsolved
Search for dead transitions found 36 dead transitions in 60327ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 336/468 places, 656/824 transitions.
Applied a total of 0 rules in 10 ms. Remains 336 /336 variables (removed 0) and now considering 656/656 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:32:33] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 105274 ms. Remains : 336/468 places, 656/824 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), p0]
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-15
Product exploration explored 100000 steps with 33268 reset in 278 ms.
Product exploration explored 100000 steps with 33411 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), p0]
RANDOM walk for 170 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), p0]
[2025-06-02 23:32:34] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
// Phase 1: matrix 644 rows 336 cols
[2025-06-02 23:32:34] [INFO ] Computed 38 invariants in 14 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:32:34] [INFO ] [Real]Absence check using 13 positive place invariants in 58 ms returned sat
[2025-06-02 23:32:34] [INFO ] [Real]Absence check using 13 positive and 25 generalized place invariants in 250 ms returned sat
[2025-06-02 23:32:35] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2025-06-02 23:32:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:32:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 38 ms returned sat
[2025-06-02 23:32:36] [INFO ] [Nat]Absence check using 13 positive and 25 generalized place invariants in 83 ms returned sat
[2025-06-02 23:32:37] [INFO ] [Nat]Absence check using state equation in 1412 ms returned sat
[2025-06-02 23:32:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:32:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 1108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:38] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:39] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:39] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 3 ms to minimize.
[2025-06-02 23:32:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1060 ms
[2025-06-02 23:32:39] [INFO ] Computed and/alt/rep : 402/1821/396 causal constraints (skipped 246 transitions) in 42 ms.
[2025-06-02 23:32:44] [INFO ] Added : 261 causal constraints over 53 iterations in 4764 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 13 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 656/656 transitions.
Applied a total of 0 rules in 14 ms. Remains 336 /336 variables (removed 0) and now considering 656/656 (removed 0) transitions.
Running 654 sub problems to find dead transitions.
[2025-06-02 23:32:44] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
[2025-06-02 23:32:44] [INFO ] Invariant cache hit.
[2025-06-02 23:32:44] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:49] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:49] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:49] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:49] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:49] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:49] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:49] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:50] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:50] [INFO ] Deduced a trap composed of 121 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:50] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:50] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:54] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:54] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:55] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:56] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:02] [INFO ] Deduced a trap composed of 168 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:02] [INFO ] Deduced a trap composed of 186 places in 165 ms of which 49 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/980 variables, and 53 constraints, problems are : Problem set: 0 solved, 654 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:11] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:12] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:12] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:12] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 334/980 variables, and 57 constraints, problems are : Problem set: 0 solved, 654 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/654 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40260ms problems are : Problem set: 0 solved, 654 unsolved
Search for dead transitions found 0 dead transitions in 40261ms
[2025-06-02 23:33:24] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
[2025-06-02 23:33:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:33:25] [INFO ] Implicit Places using invariants in 819 ms returned []
[2025-06-02 23:33:25] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
[2025-06-02 23:33:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:33:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:33:29] [INFO ] Implicit Places using invariants and state equation in 4170 ms returned []
Implicit Place search using SMT with State Equation took 4991 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:33:29] [INFO ] Redundant transitions in 6 ms returned []
Running 654 sub problems to find dead transitions.
[2025-06-02 23:33:29] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
[2025-06-02 23:33:29] [INFO ] Invariant cache hit.
[2025-06-02 23:33:29] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:34] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:34] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:34] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:34] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:34] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:34] [INFO ] Deduced a trap composed of 127 places in 178 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:34] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:35] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:35] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:35] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:35] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:39] [INFO ] Deduced a trap composed of 120 places in 169 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:39] [INFO ] Deduced a trap composed of 161 places in 181 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:40] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:41] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:47] [INFO ] Deduced a trap composed of 168 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:47] [INFO ] Deduced a trap composed of 186 places in 166 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:53] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:54] [INFO ] Deduced a trap composed of 100 places in 190 ms of which 63 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:58] [INFO ] Deduced a trap composed of 196 places in 163 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/980 variables, and 56 constraints, problems are : Problem set: 0 solved, 654 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 654/654 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 654 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 4 (OVERLAPS) 1/335 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/980 variables, and 57 constraints, problems are : Problem set: 0 solved, 654 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/654 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 654 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105564 ms. Remains : 336/336 places, 656/656 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), p0]
RANDOM walk for 174 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), p0]
[2025-06-02 23:34:30] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
[2025-06-02 23:34:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:34:30] [INFO ] [Real]Absence check using 13 positive place invariants in 110 ms returned sat
[2025-06-02 23:34:31] [INFO ] [Real]Absence check using 13 positive and 25 generalized place invariants in 348 ms returned sat
[2025-06-02 23:34:31] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2025-06-02 23:34:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:34:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 48 ms returned sat
[2025-06-02 23:34:32] [INFO ] [Nat]Absence check using 13 positive and 25 generalized place invariants in 110 ms returned sat
[2025-06-02 23:34:35] [INFO ] [Nat]Absence check using state equation in 3180 ms returned sat
[2025-06-02 23:34:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:34:35] [INFO ] [Nat]Added 72 Read/Feed constraints in 232 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:35] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:36] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:36] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:36] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:36] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:37] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:37] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:37] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 2 ms to minimize.
[2025-06-02 23:34:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1681 ms
[2025-06-02 23:34:37] [INFO ] Computed and/alt/rep : 402/1821/396 causal constraints (skipped 246 transitions) in 29 ms.
[2025-06-02 23:34:42] [INFO ] Added : 340 causal constraints over 68 iterations in 5127 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), p0]
Product exploration explored 100000 steps with 33260 reset in 253 ms.
Product exploration explored 100000 steps with 33270 reset in 277 ms.
Built C files in :
/tmp/ltsmin6792196269771360400
[2025-06-02 23:34:43] [INFO ] Computing symmetric may disable matrix : 656 transitions.
[2025-06-02 23:34:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:34:43] [INFO ] Computing symmetric may enable matrix : 656 transitions.
[2025-06-02 23:34:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:34:43] [INFO ] Computing Do-Not-Accords matrix : 656 transitions.
[2025-06-02 23:34:43] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:34:43] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6792196269771360400
Running compilation step : cd /tmp/ltsmin6792196269771360400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1697 ms.
Running link step : cd /tmp/ltsmin6792196269771360400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6792196269771360400;'/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' '--hoa' '/tmp/stateBased11322496630771574212.hoa' '--buchi-type=spotba'
LTSmin run took 5620 ms.
FORMULA PolyORBLF-COL-S02J04T06-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-15 finished in 242899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))||X(F((G(F(p2))||(F(p2)&&X(X(p3)))))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J04T06-LTLFireability-05
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 20 out of 468 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 96 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 192 place count 372 transition count 728
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 198 place count 366 transition count 722
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 366 transition count 722
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 252 place count 342 transition count 698
Applied a total of 252 rules in 40 ms. Remains 342 /468 variables (removed 126) and now considering 698/824 (removed 126) transitions.
Running 696 sub problems to find dead transitions.
[2025-06-02 23:34:51] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
// Phase 1: matrix 686 rows 342 cols
[2025-06-02 23:34:51] [INFO ] Computed 38 invariants in 13 ms
[2025-06-02 23:34:51] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:56] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:57] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:57] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:57] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:57] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:58] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:59] [INFO ] Deduced a trap composed of 115 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:59] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:01] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:02] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:02] [INFO ] Deduced a trap composed of 174 places in 178 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:03] [INFO ] Deduced a trap composed of 186 places in 179 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:03] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:08] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1028 variables, and 50 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/1028 variables, and 50 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/696 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40336ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 40337ms
[2025-06-02 23:35:31] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:35:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:35:32] [INFO ] Implicit Places using invariants in 827 ms returned []
[2025-06-02 23:35:32] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:35:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:35:36] [INFO ] Implicit Places using invariants and state equation in 3812 ms returned []
Implicit Place search using SMT with State Equation took 4641 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2025-06-02 23:35:36] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:35:36] [INFO ] Invariant cache hit.
[2025-06-02 23:35:36] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:41] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:41] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:41] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:41] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:42] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:44] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:44] [INFO ] Deduced a trap composed of 115 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:44] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:47] [INFO ] Deduced a trap composed of 98 places in 169 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:50] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:51] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:01] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:03] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 41 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1028 variables, and 49 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:22] [INFO ] Deduced a trap composed of 174 places in 184 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:22] [INFO ] Deduced a trap composed of 186 places in 174 ms of which 49 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/1028 variables, and 51 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/696 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Starting structural reductions in LI_LTL mode, iteration 1 : 342/468 places, 698/824 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 105318 ms. Remains : 342/468 places, 698/824 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-05
Product exploration explored 100000 steps with 33286 reset in 272 ms.
Product exploration explored 100000 steps with 33422 reset in 304 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 115 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40001 steps (15 resets) in 181 ms. (219 steps per ms) remains 2/7 properties
BEST_FIRST walk for 8545 steps (2 resets) in 130 ms. (65 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F p0), (F p1), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 15 factoid took 320 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 20 out of 342 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 698/698 transitions.
Applied a total of 0 rules in 9 ms. Remains 342 /342 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Running 696 sub problems to find dead transitions.
[2025-06-02 23:36:38] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:36:38] [INFO ] Invariant cache hit.
[2025-06-02 23:36:38] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:43] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:43] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:43] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:43] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:44] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:46] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:46] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:46] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:49] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:52] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:53] [INFO ] Deduced a trap composed of 115 places in 157 ms of which 27 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)timeout
(s105 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1028 variables, and 47 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:08] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:12] [INFO ] Deduced a trap composed of 120 places in 159 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:13] [INFO ] Deduced a trap composed of 186 places in 166 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/1028 variables, and 50 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/696 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40323ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 40324ms
[2025-06-02 23:37:18] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:37:19] [INFO ] Implicit Places using invariants in 840 ms returned []
[2025-06-02 23:37:19] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:37:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:37:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:37:22] [INFO ] Implicit Places using invariants and state equation in 3819 ms returned []
Implicit Place search using SMT with State Equation took 4660 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2025-06-02 23:37:23] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:37:23] [INFO ] Invariant cache hit.
[2025-06-02 23:37:23] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:28] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:28] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:28] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:28] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:29] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:31] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:31] [INFO ] Deduced a trap composed of 115 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:31] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:34] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:37] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:38] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:48] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:50] [INFO ] Deduced a trap composed of 120 places in 177 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1028 variables, and 49 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:09] [INFO ] Deduced a trap composed of 174 places in 167 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:09] [INFO ] Deduced a trap composed of 186 places in 173 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/1028 variables, and 51 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/696 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Finished structural reductions in LTL mode , in 1 iterations and 105301 ms. Remains : 342/342 places, 698/698 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 102 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40001 steps (13 resets) in 225 ms. (176 steps per ms) remains 2/7 properties
BEST_FIRST walk for 6440 steps (6 resets) in 48 ms. (131 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F p0), (F p1), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 15 factoid took 335 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33432 reset in 275 ms.
Product exploration explored 100000 steps with 33191 reset in 287 ms.
Built C files in :
/tmp/ltsmin34274715513269295
[2025-06-02 23:38:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin34274715513269295
Running compilation step : cd /tmp/ltsmin34274715513269295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1150 ms.
Running link step : cd /tmp/ltsmin34274715513269295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin34274715513269295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8363440322870063903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 698/698 transitions.
Applied a total of 0 rules in 2 ms. Remains 342 /342 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Running 696 sub problems to find dead transitions.
[2025-06-02 23:38:40] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:38:40] [INFO ] Invariant cache hit.
[2025-06-02 23:38:40] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:45] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:45] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:45] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:45] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:46] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:48] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:48] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:48] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:51] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:54] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:55] [INFO ] Deduced a trap composed of 115 places in 180 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1028 variables, and 47 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:10] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:14] [INFO ] Deduced a trap composed of 120 places in 162 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:16] [INFO ] Deduced a trap composed of 186 places in 165 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/1028 variables, and 50 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/696 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40338ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 40339ms
[2025-06-02 23:39:20] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:39:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:39:21] [INFO ] Implicit Places using invariants in 796 ms returned []
[2025-06-02 23:39:21] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:39:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:39:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:39:24] [INFO ] Implicit Places using invariants and state equation in 3626 ms returned []
Implicit Place search using SMT with State Equation took 4425 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2025-06-02 23:39:24] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:39:24] [INFO ] Invariant cache hit.
[2025-06-02 23:39:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:30] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:30] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:30] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:30] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:30] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:32] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:33] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:33] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:36] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:39] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:40] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:50] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:51] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 41 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 9.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 (/ 1.0 3.0))
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 (/ 1.0 3.0))
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1028 variables, and 49 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:10] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:10] [INFO ] Deduced a trap composed of 186 places in 173 ms of which 49 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/1028 variables, and 51 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/696 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Finished structural reductions in LTL mode , in 1 iterations and 105099 ms. Remains : 342/342 places, 698/698 transitions.
Built C files in :
/tmp/ltsmin5557159604687018522
[2025-06-02 23:40:25] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5557159604687018522
Running compilation step : cd /tmp/ltsmin5557159604687018522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1175 ms.
Running link step : cd /tmp/ltsmin5557159604687018522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5557159604687018522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14854591494963128199.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:40:40] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:40:40] [INFO ] Flatten gal took : 19 ms
[2025-06-02 23:40:40] [INFO ] Time to serialize gal into /tmp/LTL8879422351934624294.gal : 3 ms
[2025-06-02 23:40:40] [INFO ] Time to serialize properties into /tmp/LTL4245271032690126470.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8879422351934624294.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10474310041962815570.hoa' '-atoms' '/tmp/LTL4245271032690126470.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4245271032690126470.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10474310041962815570.hoa
Detected timeout of ITS tools.
[2025-06-02 23:40:55] [INFO ] Flatten gal took : 19 ms
[2025-06-02 23:40:55] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:40:55] [INFO ] Time to serialize gal into /tmp/LTL5542365054330101606.gal : 3 ms
[2025-06-02 23:40:55] [INFO ] Time to serialize properties into /tmp/LTL343717259142601145.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5542365054330101606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL343717259142601145.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((RunB_4>=1)||(RunB_5>=1))||((RunB_2>=1)||(RunB_3>=1)))||((RunB_0>=1)||(RunB_1>=1)))")&&(X("((((QueueJobE_1>=1)||(QueueJob...1264
Formula 0 simplified : F(G(!"((((RunB_4>=1)||(RunB_5>=1))||((RunB_2>=1)||(RunB_3>=1)))||((RunB_0>=1)||(RunB_1>=1)))" | X!"((((QueueJobE_1>=1)||(QueueJobE_0...1242
Detected timeout of ITS tools.
[2025-06-02 23:41:10] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:41:10] [INFO ] Applying decomposition
[2025-06-02 23:41:10] [INFO ] Flatten gal took : 19 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/graph17356515566598424727.txt' '-o' '/tmp/graph17356515566598424727.bin' '-w' '/tmp/graph17356515566598424727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17356515566598424727.bin' '-l' '-1' '-v' '-w' '/tmp/graph17356515566598424727.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:41:10] [INFO ] Decomposing Gal with order
[2025-06-02 23:41:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:41:10] [INFO ] Removed a total of 499 redundant transitions.
[2025-06-02 23:41:10] [INFO ] Flatten gal took : 55 ms
[2025-06-02 23:41:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 371 labels/synchronizations in 11 ms.
[2025-06-02 23:41:10] [INFO ] Time to serialize gal into /tmp/LTL7872489548211525692.gal : 4 ms
[2025-06-02 23:41:10] [INFO ] Time to serialize properties into /tmp/LTL18193856785499398136.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7872489548211525692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18193856785499398136.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F(("((((i4.u6.RunB_4>=1)||(i4.u1.RunB_5>=1))||((i4.u6.RunB_2>=1)||(i4.u29.RunB_3>=1)))||((i4.u6.RunB_0>=1)||(i4.u6.RunB_1>=1)))"...1811
Formula 0 simplified : F(G(!"((((i4.u6.RunB_4>=1)||(i4.u1.RunB_5>=1))||((i4.u6.RunB_2>=1)||(i4.u29.RunB_3>=1)))||((i4.u6.RunB_0>=1)||(i4.u6.RunB_1>=1)))" |...1789
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-05 finished in 395020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J04T06-LTLFireability-14
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 14 out of 468 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 468/468 places, 824/824 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 468 transition count 782
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 426 transition count 776
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 96 place count 420 transition count 728
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 192 place count 372 transition count 728
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 252 place count 342 transition count 698
Applied a total of 252 rules in 26 ms. Remains 342 /468 variables (removed 126) and now considering 698/824 (removed 126) transitions.
Running 696 sub problems to find dead transitions.
[2025-06-02 23:41:26] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
// Phase 1: matrix 686 rows 342 cols
[2025-06-02 23:41:26] [INFO ] Computed 38 invariants in 7 ms
[2025-06-02 23:41:26] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:31] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:31] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:31] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:31] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:31] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:31] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:31] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:32] [INFO ] Deduced a trap composed of 115 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:32] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:33] [INFO ] Deduced a trap composed of 196 places in 158 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:34] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:35] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1028 variables, and 48 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:57] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:01] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 40 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/1028 variables, and 50 constraints, problems are : Problem set: 0 solved, 696 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/696 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40330ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 40331ms
[2025-06-02 23:42:06] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:42:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:42:07] [INFO ] Implicit Places using invariants in 866 ms returned []
[2025-06-02 23:42:07] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:42:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:42:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:42:12] [INFO ] Implicit Places using invariants and state equation in 5270 ms returned []
Implicit Place search using SMT with State Equation took 6138 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2025-06-02 23:42:12] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 23:42:12] [INFO ] Invariant cache hit.
[2025-06-02 23:42:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:17] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:17] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:17] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:17] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:17] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:18] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:18] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:18] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:18] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:19] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:20] [INFO ] Deduced a trap composed of 196 places in 158 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:22] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/341 variables, 1/49 constraints. Problems are: Problem set: 36 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/1028 variables, and 49 constraints, problems are : Problem set: 36 solved, 660 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 23/36 constraints. Problems are: Problem set: 36 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 12/48 constraints. Problems are: Problem set: 36 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:50] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 1/49 constraints. Problems are: Problem set: 36 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/49 constraints. Problems are: Problem set: 36 solved, 660 unsolved
SMT process timed out in 60335ms, After SMT, problems are : Problem set: 36 solved, 660 unsolved
Search for dead transitions found 36 dead transitions in 60337ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 342/468 places, 662/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 342 /342 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 106844 ms. Remains : 342/468 places, 662/824 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T06-LTLFireability-14
Product exploration explored 100000 steps with 2139 reset in 327 ms.
Product exploration explored 100000 steps with 2138 reset in 349 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 190 steps (0 resets) in 6 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-02 23:43:14] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
// Phase 1: matrix 650 rows 342 cols
[2025-06-02 23:43:14] [INFO ] Computed 38 invariants in 12 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:43:14] [INFO ] [Real]Absence check using 16 positive place invariants in 108 ms returned sat
[2025-06-02 23:43:15] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 715 ms returned sat
[2025-06-02 23:43:18] [INFO ] [Real]Absence check using state equation in 2570 ms returned sat
[2025-06-02 23:43:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:43:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 99 ms returned sat
[2025-06-02 23:43:18] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 91 ms returned sat
[2025-06-02 23:43:20] [INFO ] [Nat]Absence check using state equation in 2343 ms returned sat
[2025-06-02 23:43:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:43:21] [INFO ] [Nat]Added 72 Read/Feed constraints in 184 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:21] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:21] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:21] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:22] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:22] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 25 ms to minimize.
[2025-06-02 23:43:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1226 ms
[2025-06-02 23:43:22] [INFO ] Computed and/alt/rep : 408/1827/402 causal constraints (skipped 246 transitions) in 29 ms.
[2025-06-02 23:43:27] [INFO ] Added : 341 causal constraints over 69 iterations in 5545 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 14 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 662/662 transitions.
Applied a total of 0 rules in 10 ms. Remains 342 /342 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-02 23:43:27] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:43:27] [INFO ] Invariant cache hit.
[2025-06-02 23:43:27] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:32] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:32] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:32] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:32] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:32] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:33] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:34] [INFO ] Deduced a trap composed of 196 places in 177 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:35] [INFO ] Deduced a trap composed of 100 places in 199 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:36] [INFO ] Deduced a trap composed of 110 places in 170 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:37] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:38] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:38] [INFO ] Deduced a trap composed of 122 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:39] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:39] [INFO ] Deduced a trap composed of 163 places in 164 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/992 variables, and 50 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:51] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:59] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:59] [INFO ] Deduced a trap composed of 161 places in 170 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:59] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:59] [INFO ] Deduced a trap composed of 172 places in 164 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:43:59] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:00] [INFO ] Deduced a trap composed of 172 places in 175 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/992 variables, and 57 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40283ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 40284ms
[2025-06-02 23:44:08] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:44:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:44:09] [INFO ] Implicit Places using invariants in 895 ms returned []
[2025-06-02 23:44:09] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:44:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:44:12] [INFO ] Implicit Places using invariants and state equation in 3907 ms returned []
Implicit Place search using SMT with State Equation took 4804 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-02 23:44:12] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:44:12] [INFO ] Invariant cache hit.
[2025-06-02 23:44:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:17] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:17] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:17] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:17] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:18] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:18] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:19] [INFO ] Deduced a trap composed of 196 places in 189 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:20] [INFO ] Deduced a trap composed of 100 places in 210 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:21] [INFO ] Deduced a trap composed of 110 places in 176 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:22] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:23] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:23] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:24] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:24] [INFO ] Deduced a trap composed of 163 places in 158 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (OVERLAPS) 1/341 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:42] [INFO ] Deduced a trap composed of 120 places in 169 ms of which 42 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:47] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:51] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:57] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 44 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/992 variables, and 54 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Finished structural reductions in LTL mode , in 1 iterations and 105383 ms. Remains : 342/342 places, 662/662 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 189 steps (0 resets) in 6 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 231 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-02 23:45:13] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:45:14] [INFO ] [Real]Absence check using 16 positive place invariants in 125 ms returned sat
[2025-06-02 23:45:14] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 558 ms returned sat
[2025-06-02 23:45:18] [INFO ] [Real]Absence check using state equation in 3557 ms returned sat
[2025-06-02 23:45:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:45:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 69 ms returned sat
[2025-06-02 23:45:18] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 97 ms returned sat
[2025-06-02 23:45:21] [INFO ] [Nat]Absence check using state equation in 2091 ms returned sat
[2025-06-02 23:45:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:45:21] [INFO ] [Nat]Added 72 Read/Feed constraints in 390 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:21] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:22] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:22] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:22] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:22] [INFO ] Deduced a trap composed of 107 places in 188 ms of which 37 ms to minimize.
[2025-06-02 23:45:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1309 ms
[2025-06-02 23:45:22] [INFO ] Computed and/alt/rep : 408/1827/402 causal constraints (skipped 246 transitions) in 32 ms.
[2025-06-02 23:45:28] [INFO ] Added : 371 causal constraints over 75 iterations in 5465 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2138 reset in 396 ms.
Product exploration explored 100000 steps with 2140 reset in 402 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 14 out of 342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 342/342 places, 662/662 transitions.
Applied a total of 0 rules in 13 ms. Remains 342 /342 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-02 23:45:29] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:45:29] [INFO ] Invariant cache hit.
[2025-06-02 23:45:29] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:34] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:34] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:34] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:34] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:34] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:35] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:36] [INFO ] Deduced a trap composed of 196 places in 181 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:37] [INFO ] Deduced a trap composed of 100 places in 183 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:38] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:38] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:40] [INFO ] Deduced a trap composed of 120 places in 172 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:40] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:40] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:40] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/992 variables, and 50 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:45:53] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:00] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:00] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:00] [INFO ] Deduced a trap composed of 161 places in 193 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:01] [INFO ] Deduced a trap composed of 172 places in 178 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:01] [INFO ] Deduced a trap composed of 149 places in 172 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:01] [INFO ] Deduced a trap composed of 172 places in 172 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 9)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 1)
(s216 1)
(s217 0)
(s218 2)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 5)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/992 variables, and 57 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40317ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 40318ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:46:09] [INFO ] Redundant transitions in 5 ms returned []
Running 660 sub problems to find dead transitions.
[2025-06-02 23:46:09] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:46:09] [INFO ] Invariant cache hit.
[2025-06-02 23:46:09] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:14] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:14] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:14] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:14] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:14] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:15] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:16] [INFO ] Deduced a trap composed of 196 places in 196 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:17] [INFO ] Deduced a trap composed of 100 places in 205 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:18] [INFO ] Deduced a trap composed of 110 places in 184 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:18] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:20] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:20] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (OVERLAPS) 1/341 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:39] [INFO ] Deduced a trap composed of 120 places in 166 ms of which 40 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:48] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:54] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 43 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/992 variables, and 54 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 100635 ms. Remains : 342/342 places, 662/662 transitions.
Built C files in :
/tmp/ltsmin6209026889239836453
[2025-06-02 23:47:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6209026889239836453
Running compilation step : cd /tmp/ltsmin6209026889239836453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1106 ms.
Running link step : cd /tmp/ltsmin6209026889239836453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6209026889239836453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10585030602976815257.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 14 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 662/662 transitions.
Applied a total of 0 rules in 8 ms. Remains 342 /342 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Running 660 sub problems to find dead transitions.
[2025-06-02 23:47:25] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:47:25] [INFO ] Invariant cache hit.
[2025-06-02 23:47:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:29] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:30] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:30] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:30] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:30] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:31] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:32] [INFO ] Deduced a trap composed of 196 places in 165 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:32] [INFO ] Deduced a trap composed of 100 places in 178 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:33] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:34] [INFO ] Deduced a trap composed of 134 places in 151 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:35] [INFO ] Deduced a trap composed of 120 places in 155 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:35] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:36] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:36] [INFO ] Deduced a trap composed of 163 places in 143 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/992 variables, and 50 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:48] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:56] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:56] [INFO ] Deduced a trap composed of 161 places in 171 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:56] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:56] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:57] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:57] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/992 variables, and 57 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40275ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 40283ms
[2025-06-02 23:48:05] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:48:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:48:06] [INFO ] Implicit Places using invariants in 901 ms returned []
[2025-06-02 23:48:06] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:48:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:48:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 23:48:10] [INFO ] Implicit Places using invariants and state equation in 3795 ms returned []
Implicit Place search using SMT with State Equation took 4697 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-02 23:48:10] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2025-06-02 23:48:10] [INFO ] Invariant cache hit.
[2025-06-02 23:48:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:14] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:14] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:15] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:15] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:15] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:16] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:17] [INFO ] Deduced a trap composed of 196 places in 205 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:17] [INFO ] Deduced a trap composed of 100 places in 185 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:18] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:19] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:20] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:20] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:21] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:21] [INFO ] Deduced a trap composed of 163 places in 150 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (OVERLAPS) 1/341 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:39] [INFO ] Deduced a trap composed of 120 places in 159 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:44] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:49] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:54] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 43 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/992 variables, and 54 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Finished structural reductions in LTL mode , in 1 iterations and 105290 ms. Remains : 342/342 places, 662/662 transitions.
Built C files in :
/tmp/ltsmin2395159165796879031
[2025-06-02 23:49:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2395159165796879031
Running compilation step : cd /tmp/ltsmin2395159165796879031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1091 ms.
Running link step : cd /tmp/ltsmin2395159165796879031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2395159165796879031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10210469693233737368.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:49:25] [INFO ] Flatten gal took : 26 ms
[2025-06-02 23:49:25] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:49:25] [INFO ] Time to serialize gal into /tmp/LTL17553165078698602315.gal : 3 ms
[2025-06-02 23:49:25] [INFO ] Time to serialize properties into /tmp/LTL10198361963268488534.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17553165078698602315.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14448983040673807108.hoa' '-atoms' '/tmp/LTL10198361963268488534.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10198361963268488534.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14448983040673807108.hoa
Detected timeout of ITS tools.
[2025-06-02 23:49:40] [INFO ] Flatten gal took : 17 ms
[2025-06-02 23:49:40] [INFO ] Flatten gal took : 17 ms
[2025-06-02 23:49:40] [INFO ] Time to serialize gal into /tmp/LTL2090934866670255061.gal : 3 ms
[2025-06-02 23:49:40] [INFO ] Time to serialize properties into /tmp/LTL1306798704398132235.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2090934866670255061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1306798704398132235.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((((G("(((((JobCnt>=1)&&(P_1617_5>=1))||((JobCnt>=1)&&(P_1617_0>=1)))||(((JobCnt>=1)&&(P_1617_2>=1))||((JobCnt>=1)&&(P_1617_1>...432
Formula 0 simplified : XXG(!"((((RunE_2>=1)&&(ORB_Lock>=1))||((RunE_3>=1)&&(ORB_Lock>=1)))||((RunE_4>=1)&&(ORB_Lock>=1)))" & !"(((RunE_5>=1)&&(ORB_Lock>=1)...418
Detected timeout of ITS tools.
[2025-06-02 23:49:55] [INFO ] Flatten gal took : 22 ms
[2025-06-02 23:49:55] [INFO ] Applying decomposition
[2025-06-02 23:49:55] [INFO ] Flatten gal took : 18 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/graph2317177881854259737.txt' '-o' '/tmp/graph2317177881854259737.bin' '-w' '/tmp/graph2317177881854259737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2317177881854259737.bin' '-l' '-1' '-v' '-w' '/tmp/graph2317177881854259737.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:49:55] [INFO ] Decomposing Gal with order
[2025-06-02 23:49:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:49:55] [INFO ] Removed a total of 592 redundant transitions.
[2025-06-02 23:49:55] [INFO ] Flatten gal took : 48 ms
[2025-06-02 23:49:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 308 labels/synchronizations in 9 ms.
[2025-06-02 23:49:55] [INFO ] Time to serialize gal into /tmp/LTL594464944392411859.gal : 5 ms
[2025-06-02 23:49:55] [INFO ] Time to serialize properties into /tmp/LTL2721576904940901229.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL594464944392411859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2721576904940901229.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F((((G("(((((i1.u0.JobCnt>=1)&&(i0.u43.P_1617_5>=1))||((i1.u0.JobCnt>=1)&&(i0.u21.P_1617_0>=1)))||(((i1.u0.JobCnt>=1)&&(i0.u41....594
Formula 0 simplified : XXG(!"((((i0.u33.RunE_2>=1)&&(i0.u24.ORB_Lock>=1))||((i0.u34.RunE_3>=1)&&(i0.u24.ORB_Lock>=1)))||((i0.u35.RunE_4>=1)&&(i0.u24.ORB_Lo...580
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T06-LTLFireability-14 finished in 525159 ms.
[2025-06-02 23:50:11] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11688340610622061346
[2025-06-02 23:50:11] [INFO ] Computing symmetric may disable matrix : 824 transitions.
[2025-06-02 23:50:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:50:11] [INFO ] Applying decomposition
[2025-06-02 23:50:11] [INFO ] Computing symmetric may enable matrix : 824 transitions.
[2025-06-02 23:50:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:50:11] [INFO ] Flatten gal took : 35 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/graph3735811800476334421.txt' '-o' '/tmp/graph3735811800476334421.bin' '-w' '/tmp/graph3735811800476334421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3735811800476334421.bin' '-l' '-1' '-v' '-w' '/tmp/graph3735811800476334421.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:50:11] [INFO ] Decomposing Gal with order
[2025-06-02 23:50:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:50:11] [INFO ] Computing Do-Not-Accords matrix : 824 transitions.
[2025-06-02 23:50:11] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:50:11] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11688340610622061346
Running compilation step : cd /tmp/ltsmin11688340610622061346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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-02 23:50:11] [INFO ] Removed a total of 648 redundant transitions.
[2025-06-02 23:50:11] [INFO ] Flatten gal took : 48 ms
[2025-06-02 23:50:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 6 ms.
[2025-06-02 23:50:11] [INFO ] Time to serialize gal into /tmp/LTLFireability10581190135720755749.gal : 5 ms
[2025-06-02 23:50:11] [INFO ] Time to serialize properties into /tmp/LTLFireability4080865721080536886.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10581190135720755749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4080865721080536886.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F("(((((u66.P_1095<1)||(u66.P_1113_5<1))&&((u66.P_1095<1)||(u66.P_1113_3<1)))&&(((u66.P_1095<1)||(u66.P_1113_4<1))&&((u66.P_1095<...258
Formula 0 simplified : FG!"(((((u66.P_1095<1)||(u66.P_1113_5<1))&&((u66.P_1095<1)||(u66.P_1113_3<1)))&&(((u66.P_1095<1)||(u66.P_1113_4<1))&&((u66.P_1095<1)...252
Compilation finished in 2284 ms.
Running link step : cd /tmp/ltsmin11688340610622061346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11688340610622061346;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="PolyORBLF-COL-S02J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253700268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;