About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T06
| 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 | ?F?TTTFFTTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700292.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-S02J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700292
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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-S02J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748915387706
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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-03 01:49:48] [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-03 01:49:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 01:49:49] [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-03 01:49:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 01:49:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 646 ms
[2025-06-03 01:49:49] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-03 01:49:49] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2025-06-03 01:49:49] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 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 (14 resets) in 744 ms. (53 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40001 steps (11 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
[2025-06-03 01:49:50] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 01:49:50] [INFO ] Computed 26 invariants in 10 ms
[2025-06-03 01:49:50] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 23/145 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 4/11 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2025-06-03 01:49:50] [INFO ] Flatten gal took : 27 ms
[2025-06-03 01:49:50] [INFO ] Flatten gal took : 8 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 01:49:50] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 31 ms.
[2025-06-03 01:49:50] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2025-06-03 01:49:50] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 277 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 47 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2025-06-03 01:49:50] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2025-06-03 01:49:50] [INFO ] Computed 48 invariants in 51 ms
[2025-06-03 01:49:50] [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/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:01] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:01] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:01] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:01] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:01] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:01] [INFO ] Deduced a trap composed of 245 places in 320 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:02] [INFO ] Deduced a trap composed of 98 places in 237 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:02] [INFO ] Deduced a trap composed of 133 places in 227 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:03] [INFO ] Deduced a trap composed of 278 places in 297 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:03] [INFO ] Deduced a trap composed of 278 places in 306 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:04] [INFO ] Deduced a trap composed of 251 places in 328 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:04] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 3 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 532/1490 variables, and 58 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:24] [INFO ] Deduced a trap composed of 349 places in 329 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:26] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:30] [INFO ] Deduced a trap composed of 247 places in 301 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:30] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:31] [INFO ] Deduced a trap composed of 259 places in 296 ms of which 95 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 63 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40827ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40838ms
[2025-06-03 01:50:31] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 01:50:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:50:32] [INFO ] Implicit Places using invariants in 728 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 743 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/536 places, 968/968 transitions.
Applied a total of 0 rules in 15 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41658 ms. Remains : 528/536 places, 968/968 transitions.
Support contains 277 out of 528 places after structural reductions.
[2025-06-03 01:50:32] [INFO ] Flatten gal took : 76 ms
[2025-06-03 01:50:32] [INFO ] Flatten gal took : 72 ms
[2025-06-03 01:50:32] [INFO ] Input system was already deterministic with 968 transitions.
RANDOM walk for 40000 steps (12 resets) in 1165 ms. (34 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40003 steps (9 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
[2025-06-03 01:50:33] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2025-06-03 01:50:33] [INFO ] Computed 42 invariants in 41 ms
[2025-06-03 01:50:33] [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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 193/202 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/231 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 518/1484 variables, and 33 constraints, problems are : Problem set: 1 solved, 0 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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' '!(G(F(p0)))'
Support contains 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 408 transition count 848
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 408 transition count 848
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 324 place count 366 transition count 806
Applied a total of 324 rules in 122 ms. Remains 366 /528 variables (removed 162) and now considering 806/968 (removed 162) transitions.
Running 804 sub problems to find dead transitions.
[2025-06-03 01:50:33] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2025-06-03 01:50:33] [INFO ] Computed 42 invariants in 15 ms
[2025-06-03 01:50:33] [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/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:42] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:42] [INFO ] Deduced a trap composed of 47 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-03 01:50:42] [INFO ] Deduced a trap composed of 47 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-03 01:50:42] [INFO ] Deduced a trap composed of 47 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-03 01:50:42] [INFO ] Deduced a trap composed of 47 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-03 01:50:43] [INFO ] Deduced a trap composed of 125 places in 221 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:43] [INFO ] Deduced a trap composed of 130 places in 229 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:43] [INFO ] Deduced a trap composed of 119 places in 206 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:43] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:50:44] [INFO ] Deduced a trap composed of 47 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-03 01:50:45] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 51 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:04] [INFO ] Deduced a trap composed of 120 places in 204 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:04] [INFO ] Deduced a trap composed of 212 places in 200 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:04] [INFO ] Deduced a trap composed of 55 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-03 01:51:05] [INFO ] Deduced a trap composed of 92 places in 198 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1160 variables, and 55 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40572ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 40575ms
[2025-06-03 01:51:14] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:51:15] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2025-06-03 01:51:15] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:51:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:51:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:51:19] [INFO ] Implicit Places using invariants and state equation in 3906 ms returned []
Implicit Place search using SMT with State Equation took 5115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:51:19] [INFO ] Redundant transitions in 47 ms returned []
Running 804 sub problems to find dead transitions.
[2025-06-03 01:51:19] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:51:19] [INFO ] Invariant cache hit.
[2025-06-03 01:51: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/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:28] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:28] [INFO ] Deduced a trap composed of 47 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-03 01:51:28] [INFO ] Deduced a trap composed of 47 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-03 01:51:28] [INFO ] Deduced a trap composed of 47 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-03 01:51:28] [INFO ] Deduced a trap composed of 47 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-03 01:51:28] [INFO ] Deduced a trap composed of 125 places in 189 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:28] [INFO ] Deduced a trap composed of 130 places in 204 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:29] [INFO ] Deduced a trap composed of 119 places in 213 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:29] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:29] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:51:45] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 51 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:17] [INFO ] Deduced a trap composed of 120 places in 183 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:18] [INFO ] Deduced a trap composed of 92 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-03 01:52:19] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1160 variables, and 54 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Starting structural reductions in SI_LTL mode, iteration 1 : 366/528 places, 806/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106305 ms. Remains : 366/528 places, 806/968 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-00
Product exploration explored 100000 steps with 3941 reset in 372 ms.
Product exploration explored 100000 steps with 3864 reset in 337 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 93 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35 steps (0 resets) in 4 ms. (7 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 97 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 366/366 places, 806/806 transitions.
Applied a total of 0 rules in 35 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Running 804 sub problems to find dead transitions.
[2025-06-03 01:52:21] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:52:21] [INFO ] Invariant cache hit.
[2025-06-03 01:52:21] [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/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:30] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:30] [INFO ] Deduced a trap composed of 47 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-03 01:52:30] [INFO ] Deduced a trap composed of 47 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-03 01:52:30] [INFO ] Deduced a trap composed of 47 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-03 01:52:30] [INFO ] Deduced a trap composed of 47 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-03 01:52:30] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:31] [INFO ] Deduced a trap composed of 130 places in 210 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:31] [INFO ] Deduced a trap composed of 119 places in 206 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:31] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:32] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 50 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:52:53] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1160 variables, and 51 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40505ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 40507ms
[2025-06-03 01:53:02] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:53:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:53:03] [INFO ] Implicit Places using invariants in 1311 ms returned []
[2025-06-03 01:53:03] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:53:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:53:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:53:07] [INFO ] Implicit Places using invariants and state equation in 3910 ms returned []
Implicit Place search using SMT with State Equation took 5233 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:53:07] [INFO ] Redundant transitions in 13 ms returned []
Running 804 sub problems to find dead transitions.
[2025-06-03 01:53:07] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:53:07] [INFO ] Invariant cache hit.
[2025-06-03 01:53:07] [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/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:16] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:16] [INFO ] Deduced a trap composed of 47 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-03 01:53:16] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:16] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:16] [INFO ] Deduced a trap composed of 47 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-03 01:53:16] [INFO ] Deduced a trap composed of 125 places in 218 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:16] [INFO ] Deduced a trap composed of 130 places in 206 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:17] [INFO ] Deduced a trap composed of 119 places in 214 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:17] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:17] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:53:33] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 51 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:02] [INFO ] Deduced a trap composed of 222 places in 223 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1160 variables, and 52 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106238 ms. Remains : 366/366 places, 806/806 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 90 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 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 130 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3801 reset in 269 ms.
Product exploration explored 100000 steps with 3731 reset in 320 ms.
Built C files in :
/tmp/ltsmin17916051207550427288
[2025-06-03 01:54:08] [INFO ] Computing symmetric may disable matrix : 806 transitions.
[2025-06-03 01:54:08] [INFO ] Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:54:08] [INFO ] Computing symmetric may enable matrix : 806 transitions.
[2025-06-03 01:54:08] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:54:09] [INFO ] Computing Do-Not-Accords matrix : 806 transitions.
[2025-06-03 01:54:09] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:54:09] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17916051207550427288
Running compilation step : cd /tmp/ltsmin17916051207550427288;'/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 2395 ms.
Running link step : cd /tmp/ltsmin17916051207550427288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17916051207550427288;'/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/stateBased6333782774458277888.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 366/366 places, 806/806 transitions.
Applied a total of 0 rules in 18 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Running 804 sub problems to find dead transitions.
[2025-06-03 01:54:23] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:54:23] [INFO ] Invariant cache hit.
[2025-06-03 01:54:23] [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/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:32] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:32] [INFO ] Deduced a trap composed of 47 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-03 01:54:32] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:32] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:32] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:32] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:33] [INFO ] Deduced a trap composed of 130 places in 200 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:33] [INFO ] Deduced a trap composed of 119 places in 213 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:33] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:34] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 50 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:54:55] [INFO ] Deduced a trap composed of 25 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-03 01:55:04] [INFO ] Deduced a trap composed of 120 places in 189 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1160 variables, and 52 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40474ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 40476ms
[2025-06-03 01:55:04] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:55:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:55:05] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2025-06-03 01:55:05] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:55:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:55:09] [INFO ] Implicit Places using invariants and state equation in 3801 ms returned []
Implicit Place search using SMT with State Equation took 4971 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:55:09] [INFO ] Redundant transitions in 6 ms returned []
Running 804 sub problems to find dead transitions.
[2025-06-03 01:55:09] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 01:55:09] [INFO ] Invariant cache hit.
[2025-06-03 01:55: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/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:17] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:17] [INFO ] Deduced a trap composed of 47 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-03 01:55:18] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:18] [INFO ] Deduced a trap composed of 47 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-03 01:55:18] [INFO ] Deduced a trap composed of 47 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-03 01:55:18] [INFO ] Deduced a trap composed of 125 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:18] [INFO ] Deduced a trap composed of 130 places in 212 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:18] [INFO ] Deduced a trap composed of 119 places in 191 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:19] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:19] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:55:35] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 51 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1160 variables, and 51 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105840 ms. Remains : 366/366 places, 806/806 transitions.
Built C files in :
/tmp/ltsmin10029034361910367499
[2025-06-03 01:56:09] [INFO ] Computing symmetric may disable matrix : 806 transitions.
[2025-06-03 01:56:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:56:09] [INFO ] Computing symmetric may enable matrix : 806 transitions.
[2025-06-03 01:56:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:56:09] [INFO ] Computing Do-Not-Accords matrix : 806 transitions.
[2025-06-03 01:56:09] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:56:09] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10029034361910367499
Running compilation step : cd /tmp/ltsmin10029034361910367499;'/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 2228 ms.
Running link step : cd /tmp/ltsmin10029034361910367499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10029034361910367499;'/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/stateBased15671451960169532427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 01:56:25] [INFO ] Flatten gal took : 52 ms
[2025-06-03 01:56:25] [INFO ] Flatten gal took : 61 ms
[2025-06-03 01:56:25] [INFO ] Time to serialize gal into /tmp/LTL14851716752581386763.gal : 17 ms
[2025-06-03 01:56:25] [INFO ] Time to serialize properties into /tmp/LTL12268411130889976868.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/LTL14851716752581386763.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3666798853454955825.hoa' '-atoms' '/tmp/LTL12268411130889976868.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/LTL12268411130889976868.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3666798853454955825.hoa
Detected timeout of ITS tools.
[2025-06-03 01:56:40] [INFO ] Flatten gal took : 36 ms
[2025-06-03 01:56:40] [INFO ] Flatten gal took : 36 ms
[2025-06-03 01:56:40] [INFO ] Time to serialize gal into /tmp/LTL1963132453172261560.gal : 8 ms
[2025-06-03 01:56:40] [INFO ] Time to serialize properties into /tmp/LTL8761316227252455747.ltl : 6 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/LTL1963132453172261560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8761316227252455747.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 : !((G(F("((((QueueJobE_3<1)&&(QueueJobE_2<1))&&((QueueJobE_5<1)&&(QueueJobE_4<1)))&&((QueueJobE_1<1)&&(QueueJobE_0<1)))"))))
Formula 0 simplified : FG!"((((QueueJobE_3<1)&&(QueueJobE_2<1))&&((QueueJobE_5<1)&&(QueueJobE_4<1)))&&((QueueJobE_1<1)&&(QueueJobE_0<1)))"
Detected timeout of ITS tools.
[2025-06-03 01:56:55] [INFO ] Flatten gal took : 59 ms
[2025-06-03 01:56:55] [INFO ] Applying decomposition
[2025-06-03 01:56:55] [INFO ] Flatten gal took : 64 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/graph6982166177931942203.txt' '-o' '/tmp/graph6982166177931942203.bin' '-w' '/tmp/graph6982166177931942203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6982166177931942203.bin' '-l' '-1' '-v' '-w' '/tmp/graph6982166177931942203.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:56:55] [INFO ] Decomposing Gal with order
[2025-06-03 01:56:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:56:56] [INFO ] Removed a total of 467 redundant transitions.
[2025-06-03 01:56:56] [INFO ] Flatten gal took : 414 ms
[2025-06-03 01:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 429 labels/synchronizations in 53 ms.
[2025-06-03 01:56:56] [INFO ] Time to serialize gal into /tmp/LTL6769370106369617892.gal : 25 ms
[2025-06-03 01:56:56] [INFO ] Time to serialize properties into /tmp/LTL2486275249977233673.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/LTL6769370106369617892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2486275249977233673.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 : !((G(F("((((i0.u3.QueueJobE_3<1)&&(i0.u3.QueueJobE_2<1))&&((i0.u3.QueueJobE_5<1)&&(i0.u3.QueueJobE_4<1)))&&((i0.u3.QueueJobE_1<1)&&(i0...180
Formula 0 simplified : FG!"((((i0.u3.QueueJobE_3<1)&&(i0.u3.QueueJobE_2<1))&&((i0.u3.QueueJobE_5<1)&&(i0.u3.QueueJobE_4<1)))&&((i0.u3.QueueJobE_1<1)&&(i0.u...174
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-00 finished in 397717 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((X(p0)&&(!p1 U (G(!p1)||(!p1&&G(!p2)))))))))'
Support contains 62 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 15 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:57:11] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 01:57:11] [INFO ] Computed 42 invariants in 28 ms
[2025-06-03 01:57: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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:20] [INFO ] Deduced a trap composed of 72 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-03 01:57:20] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:21] [INFO ] Deduced a trap composed of 72 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-03 01:57:21] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:21] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:21] [INFO ] Deduced a trap composed of 245 places in 277 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:21] [INFO ] Deduced a trap composed of 121 places in 247 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:22] [INFO ] Deduced a trap composed of 72 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-03 01:57:22] [INFO ] Deduced a trap composed of 266 places in 245 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:23] [INFO ] Deduced a trap composed of 250 places in 337 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:23] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:23] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 58 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:40] [INFO ] Deduced a trap composed of 241 places in 293 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:40] [INFO ] Deduced a trap composed of 348 places in 282 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:44] [INFO ] Deduced a trap composed of 246 places in 286 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:57:45] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 41 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40522ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40524ms
[2025-06-03 01:57:51] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:57:52] [INFO ] Implicit Places using invariants in 585 ms returned []
[2025-06-03 01:57:52] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:57:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:57:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:57:58] [INFO ] Implicit Places using invariants and state equation in 5664 ms returned []
Implicit Place search using SMT with State Equation took 6252 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:57:58] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:57:58] [INFO ] Invariant cache hit.
[2025-06-03 01:57:58] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:07] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:07] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:07] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:07] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:07] [INFO ] Deduced a trap composed of 72 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-03 01:58:08] [INFO ] Deduced a trap composed of 245 places in 303 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:08] [INFO ] Deduced a trap composed of 121 places in 241 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:08] [INFO ] Deduced a trap composed of 72 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-03 01:58:09] [INFO ] Deduced a trap composed of 250 places in 313 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:09] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:10] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:18] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:22] [INFO ] Deduced a trap composed of 218 places in 272 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:22] [INFO ] Deduced a trap composed of 266 places in 268 ms of which 69 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:40] [INFO ] Deduced a trap composed of 246 places in 295 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:42] [INFO ] Deduced a trap composed of 86 places in 253 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:43] [INFO ] Deduced a trap composed of 284 places in 206 ms of which 49 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:58:52] [INFO ] Deduced a trap composed of 241 places in 249 ms of which 64 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 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107227 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 p2), p2]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-01 finished in 107668 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 p1)&&F((p2||X(p3))))))'
Support contains 61 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 22 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:58:59] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:58:59] [INFO ] Invariant cache hit.
[2025-06-03 01:58:59] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:08] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:08] [INFO ] Deduced a trap composed of 72 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-03 01:59:08] [INFO ] Deduced a trap composed of 72 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-03 01:59:08] [INFO ] Deduced a trap composed of 72 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-03 01:59:08] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:09] [INFO ] Deduced a trap composed of 245 places in 297 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:09] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:09] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:10] [INFO ] Deduced a trap composed of 250 places in 312 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:10] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:10] [INFO ] Deduced a trap composed of 233 places in 274 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:19] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 21 ms to minimize.
SMT process timed out in 20444ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 20447ms
[2025-06-03 01:59:19] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:59:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:59:20] [INFO ] Implicit Places using invariants in 669 ms returned []
[2025-06-03 01:59:20] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:59:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:59:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 01:59:27] [INFO ] Implicit Places using invariants and state equation in 7238 ms returned []
Implicit Place search using SMT with State Equation took 7912 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 01:59:27] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 01:59:27] [INFO ] Invariant cache hit.
[2025-06-03 01:59: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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:36] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:36] [INFO ] Deduced a trap composed of 72 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-03 01:59:36] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:36] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:37] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:37] [INFO ] Deduced a trap composed of 245 places in 297 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:37] [INFO ] Deduced a trap composed of 121 places in 224 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:37] [INFO ] Deduced a trap composed of 72 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-03 01:59:38] [INFO ] Deduced a trap composed of 250 places in 312 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:39] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:39] [INFO ] Deduced a trap composed of 233 places in 264 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:47] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:51] [INFO ] Deduced a trap composed of 218 places in 252 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:59:51] [INFO ] Deduced a trap composed of 266 places in 288 ms of which 69 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:09] [INFO ] Deduced a trap composed of 246 places in 292 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:11] [INFO ] Deduced a trap composed of 86 places in 245 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:12] [INFO ] Deduced a trap composed of 284 places in 193 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:00:21] [INFO ] Deduced a trap composed of 241 places in 264 ms of which 65 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88859 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-02
Product exploration explored 100000 steps with 4427 reset in 531 ms.
Product exploration explored 100000 steps with 4366 reset in 432 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) p2 p3), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 243 steps (0 resets) in 9 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p3), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 11 factoid took 186 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-03 02:00:30] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:00:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:00:31] [INFO ] [Real]Absence check using 15 positive place invariants in 338 ms returned sat
[2025-06-03 02:00:32] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 1710 ms returned sat
[2025-06-03 02:00:40] [INFO ] [Real]Absence check using state equation in 7861 ms returned sat
[2025-06-03 02:00: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-03 02:00:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 36 ms returned sat
[2025-06-03 02:00:41] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 266 ms returned sat
[2025-06-03 02:00:49] [INFO ] [Nat]Absence check using state equation in 7440 ms returned sat
[2025-06-03 02:00:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:00:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 387 ms returned sat
[2025-06-03 02:00:49] [INFO ] Computed and/alt/rep : 618/2193/612 causal constraints (skipped 330 transitions) in 58 ms.
[2025-06-03 02:00:55] [INFO ] Added : 230 causal constraints over 46 iterations in 6193 ms. Result :unknown
Could not prove EG (NOT p0)
[2025-06-03 02:00:55] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:00:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:00:56] [INFO ] [Real]Absence check using 15 positive place invariants in 48 ms returned sat
[2025-06-03 02:00:57] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 1397 ms returned sat
[2025-06-03 02:01:00] [INFO ] [Real]Absence check using state equation in 3512 ms returned sat
[2025-06-03 02:01:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:01:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 110 ms returned sat
[2025-06-03 02:01:01] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 439 ms returned sat
[2025-06-03 02:01:07] [INFO ] [Nat]Absence check using state equation in 5548 ms returned sat
[2025-06-03 02:01:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:01:08] [INFO ] [Nat]Added 72 Read/Feed constraints in 1337 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:09] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 46 ms to minimize.
[2025-06-03 02:01:10] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1819 ms
Could not prove EG (NOT p1)
Support contains 49 out of 516 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 956/956 transitions.
Applied a total of 0 rules in 12 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:01:10] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:01:10] [INFO ] Invariant cache hit.
[2025-06-03 02:01:10] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:19] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:19] [INFO ] Deduced a trap composed of 72 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-03 02:01:20] [INFO ] Deduced a trap composed of 72 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-03 02:01:20] [INFO ] Deduced a trap composed of 72 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-03 02:01:20] [INFO ] Deduced a trap composed of 72 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-03 02:01:20] [INFO ] Deduced a trap composed of 245 places in 292 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:20] [INFO ] Deduced a trap composed of 121 places in 237 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:21] [INFO ] Deduced a trap composed of 72 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-03 02:01:21] [INFO ] Deduced a trap composed of 250 places in 288 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:22] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:22] [INFO ] Deduced a trap composed of 233 places in 266 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:30] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:01:39] [INFO ] Deduced a trap composed of 218 places in 290 ms of which 59 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40490ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40492ms
[2025-06-03 02:01:51] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:01:51] [INFO ] Implicit Places using invariants in 672 ms returned []
[2025-06-03 02:01:51] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:01:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:01:59] [INFO ] Implicit Places using invariants and state equation in 7332 ms returned []
Implicit Place search using SMT with State Equation took 8006 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:01:59] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:01:59] [INFO ] Invariant cache hit.
[2025-06-03 02:01:59] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:08] [INFO ] Deduced a trap composed of 72 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-03 02:02:08] [INFO ] Deduced a trap composed of 72 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-03 02:02:08] [INFO ] Deduced a trap composed of 72 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-03 02:02:08] [INFO ] Deduced a trap composed of 72 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-03 02:02:08] [INFO ] Deduced a trap composed of 72 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-03 02:02:09] [INFO ] Deduced a trap composed of 245 places in 292 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:09] [INFO ] Deduced a trap composed of 121 places in 233 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:09] [INFO ] Deduced a trap composed of 72 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-03 02:02:10] [INFO ] Deduced a trap composed of 250 places in 296 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:10] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:11] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:19] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:22] [INFO ] Deduced a trap composed of 218 places in 265 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:23] [INFO ] Deduced a trap composed of 266 places in 281 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:41] [INFO ] Deduced a trap composed of 246 places in 293 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:44] [INFO ] Deduced a trap composed of 86 places in 256 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:44] [INFO ] Deduced a trap composed of 284 places in 218 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:02:53] [INFO ] Deduced a trap composed of 241 places in 302 ms of which 64 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Finished structural reductions in LTL mode , in 1 iterations and 108945 ms. Remains : 516/516 places, 956/956 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 (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 240 steps (0 resets) in 9 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-03 02:03:00] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:03:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:03:01] [INFO ] [Real]Absence check using 15 positive place invariants in 350 ms returned sat
[2025-06-03 02:03:03] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 1720 ms returned sat
[2025-06-03 02:03:10] [INFO ] [Real]Absence check using state equation in 7853 ms returned sat
[2025-06-03 02:03:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:03:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 33 ms returned sat
[2025-06-03 02:03:11] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 259 ms returned sat
[2025-06-03 02:03:19] [INFO ] [Nat]Absence check using state equation in 7248 ms returned sat
[2025-06-03 02:03:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:03:19] [INFO ] [Nat]Added 72 Read/Feed constraints in 382 ms returned sat
[2025-06-03 02:03:19] [INFO ] Computed and/alt/rep : 618/2193/612 causal constraints (skipped 330 transitions) in 58 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-03 02:03:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
[2025-06-03 02:03:26] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:03:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:03:26] [INFO ] [Real]Absence check using 15 positive place invariants in 48 ms returned sat
[2025-06-03 02:03:27] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 1388 ms returned sat
[2025-06-03 02:03:31] [INFO ] [Real]Absence check using state equation in 3498 ms returned sat
[2025-06-03 02:03: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-03 02:03:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 110 ms returned sat
[2025-06-03 02:03:32] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 437 ms returned sat
[2025-06-03 02:03:37] [INFO ] [Nat]Absence check using state equation in 5491 ms returned sat
[2025-06-03 02:03:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:03:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 1335 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:39] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 46 ms to minimize.
[2025-06-03 02:03:40] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1807 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4357 reset in 373 ms.
Product exploration explored 100000 steps with 4363 reset in 379 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 49 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 956/956 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 516 transition count 956
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 30 place count 516 transition count 1022
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 96 place count 516 transition count 1022
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 138 place count 516 transition count 1022
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 156 place count 498 transition count 1004
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 174 place count 498 transition count 1004
Deduced a syphon composed of 126 places in 1 ms
Applied a total of 174 rules in 80 ms. Remains 498 /516 variables (removed 18) and now considering 1004/956 (removed -48) transitions.
Running 1002 sub problems to find dead transitions.
[2025-06-03 02:03:42] [INFO ] Flow matrix only has 992 transitions (discarded 12 similar events)
// Phase 1: matrix 992 rows 498 cols
[2025-06-03 02:03:42] [INFO ] Computed 42 invariants in 12 ms
[2025-06-03 02:03:42] [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/496 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:51] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:52] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:52] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:52] [INFO ] Deduced a trap composed of 48 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-03 02:03:52] [INFO ] Deduced a trap composed of 48 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-03 02:03:52] [INFO ] Deduced a trap composed of 48 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-03 02:03:52] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 2 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-03 02:03:52] [INFO ] Deduced a trap composed of 137 places in 260 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:53] [INFO ] Deduced a trap composed of 142 places in 274 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:53] [INFO ] Deduced a trap composed of 131 places in 271 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:54] [INFO ] Deduced a trap composed of 136 places in 268 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:55] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:56] [INFO ] Deduced a trap composed of 127 places in 263 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:03:57] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 70 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 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 TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
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 TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem 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 TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem 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
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/1490 variables, and 54 constraints, problems are : Problem set: 156 solved, 846 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/498 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1002/1002 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 156 solved, 846 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 12/12 constraints. Problems are: Problem set: 156 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 10/22 constraints. Problems are: Problem set: 156 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 14/36 constraints. Problems are: Problem set: 156 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:13] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:14] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:14] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:14] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:14] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:14] [INFO ] Deduced a trap composed of 22 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-03 02:04:15] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:15] [INFO ] Deduced a trap composed of 98 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:19] [INFO ] Deduced a trap composed of 16 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-03 02:04:20] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:20] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:20] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1490 variables, and 48 constraints, problems are : Problem set: 156 solved, 846 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 10/25 constraints, State Equation: 0/498 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1002 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40624ms problems are : Problem set: 156 solved, 846 unsolved
Search for dead transitions found 156 dead transitions in 40626ms
Found 156 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 156 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 156 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:04:23] [INFO ] Redundant transitions in 5 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 498/516 places, 848/956 transitions.
Graph (complete) has 2346 edges and 498 vertex of which 408 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.4 ms
Discarding 90 places :
Also discarding 0 output transitions
Deduced a syphon composed of 36 places in 1 ms
Applied a total of 1 rules in 22 ms. Remains 408 /498 variables (removed 90) and now considering 848/848 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 408/516 places, 848/956 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40752 ms. Remains : 408/516 places, 848/956 transitions.
Built C files in :
/tmp/ltsmin17024057568420858242
[2025-06-03 02:04:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17024057568420858242
Running compilation step : cd /tmp/ltsmin17024057568420858242;'/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 1672 ms.
Running link step : cd /tmp/ltsmin17024057568420858242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17024057568420858242;'/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/stateBased1119105645417610460.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 49 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 956/956 transitions.
Applied a total of 0 rules in 7 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:04:38] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 02:04:38] [INFO ] Computed 42 invariants in 13 ms
[2025-06-03 02:04: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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:47] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:47] [INFO ] Deduced a trap composed of 72 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-03 02:04:47] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:47] [INFO ] Deduced a trap composed of 72 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-03 02:04:47] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:48] [INFO ] Deduced a trap composed of 245 places in 249 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:48] [INFO ] Deduced a trap composed of 121 places in 244 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:48] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:49] [INFO ] Deduced a trap composed of 266 places in 271 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:49] [INFO ] Deduced a trap composed of 250 places in 343 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:50] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:04:50] [INFO ] Deduced a trap composed of 233 places in 268 ms of which 58 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:07] [INFO ] Deduced a trap composed of 241 places in 278 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:07] [INFO ] Deduced a trap composed of 348 places in 294 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:11] [INFO ] Deduced a trap composed of 246 places in 286 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:12] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40527ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40529ms
[2025-06-03 02:05:18] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:05:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:05:19] [INFO ] Implicit Places using invariants in 675 ms returned []
[2025-06-03 02:05:19] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:05:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:05:26] [INFO ] Implicit Places using invariants and state equation in 7243 ms returned []
Implicit Place search using SMT with State Equation took 7921 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:05:26] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:05:26] [INFO ] Invariant cache hit.
[2025-06-03 02:05:26] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:35] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:35] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:36] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:36] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:36] [INFO ] Deduced a trap composed of 72 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-03 02:05:36] [INFO ] Deduced a trap composed of 245 places in 306 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:36] [INFO ] Deduced a trap composed of 121 places in 229 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:37] [INFO ] Deduced a trap composed of 72 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-03 02:05:37] [INFO ] Deduced a trap composed of 250 places in 321 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:38] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:38] [INFO ] Deduced a trap composed of 233 places in 274 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:47] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:50] [INFO ] Deduced a trap composed of 218 places in 270 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:05:50] [INFO ] Deduced a trap composed of 266 places in 257 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:09] [INFO ] Deduced a trap composed of 246 places in 278 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:11] [INFO ] Deduced a trap composed of 86 places in 256 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:11] [INFO ] Deduced a trap composed of 284 places in 197 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:06:21] [INFO ] Deduced a trap composed of 241 places in 247 ms of which 66 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(s8 0)
(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 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(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 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(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 9)
(s147 0)
(s148 1)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(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 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(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 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(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 1)
(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)
(s277 1)
(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 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 1)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 0)
(s346 1)
(s347 0)
(s348 1)
(s349 0)
(s350 1)
(s351 10)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)timeout
(s408 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Finished structural reductions in LTL mode , in 1 iterations and 109011 ms. Remains : 516/516 places, 956/956 transitions.
Built C files in :
/tmp/ltsmin16870736856840553248
[2025-06-03 02:06:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16870736856840553248
Running compilation step : cd /tmp/ltsmin16870736856840553248;'/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 1605 ms.
Running link step : cd /tmp/ltsmin16870736856840553248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16870736856840553248;'/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/stateBased13728558868623518565.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 02:06:42] [INFO ] Flatten gal took : 36 ms
[2025-06-03 02:06:42] [INFO ] Flatten gal took : 46 ms
[2025-06-03 02:06:42] [INFO ] Time to serialize gal into /tmp/LTL16957849785284856992.gal : 5 ms
[2025-06-03 02:06:42] [INFO ] Time to serialize properties into /tmp/LTL8455655860285949560.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/LTL16957849785284856992.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9727355167310706772.hoa' '-atoms' '/tmp/LTL8455655860285949560.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/LTL8455655860285949560.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9727355167310706772.hoa
Detected timeout of ITS tools.
[2025-06-03 02:06:57] [INFO ] Flatten gal took : 31 ms
[2025-06-03 02:06:57] [INFO ] Flatten gal took : 32 ms
[2025-06-03 02:06:57] [INFO ] Time to serialize gal into /tmp/LTL12241528943123074634.gal : 6 ms
[2025-06-03 02:06:57] [INFO ] Time to serialize properties into /tmp/LTL1481005303945258531.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/LTL12241528943123074634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1481005303945258531.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 : !((X(((F("((((((((QueueJobB_12>=1)&&(P_1727>=1))||((QueueJobB_17>=1)&&(P_1727>=1)))||(((QueueJobB_7>=1)&&(P_1727>=1))||((QueueJobB_22>...2101
Formula 0 simplified : X((G!"((((((((QueueJobB_12>=1)&&(P_1727>=1))||((QueueJobB_17>=1)&&(P_1727>=1)))||(((QueueJobB_7>=1)&&(P_1727>=1))||((QueueJobB_22>=1...2092
Detected timeout of ITS tools.
[2025-06-03 02:07:12] [INFO ] Flatten gal took : 28 ms
[2025-06-03 02:07:12] [INFO ] Applying decomposition
[2025-06-03 02:07:12] [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/graph1450674642638160605.txt' '-o' '/tmp/graph1450674642638160605.bin' '-w' '/tmp/graph1450674642638160605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1450674642638160605.bin' '-l' '-1' '-v' '-w' '/tmp/graph1450674642638160605.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:07:12] [INFO ] Decomposing Gal with order
[2025-06-03 02:07:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:07:12] [INFO ] Removed a total of 815 redundant transitions.
[2025-06-03 02:07:12] [INFO ] Flatten gal took : 69 ms
[2025-06-03 02:07:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 20 ms.
[2025-06-03 02:07:12] [INFO ] Time to serialize gal into /tmp/LTL15461928718888468470.gal : 7 ms
[2025-06-03 02:07:12] [INFO ] Time to serialize properties into /tmp/LTL2909132052204528166.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/LTL15461928718888468470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2909132052204528166.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 : !((X(((F("((((((((i1.u18.QueueJobB_12>=1)&&(i1.u18.P_1727>=1))||((i1.u18.QueueJobB_17>=1)&&(i1.u18.P_1727>=1)))||(((i1.u18.QueueJobB_7...2884
Formula 0 simplified : X((G!"((((((((i1.u18.QueueJobB_12>=1)&&(i1.u18.P_1727>=1))||((i1.u18.QueueJobB_17>=1)&&(i1.u18.P_1727>=1)))||(((i1.u18.QueueJobB_7>=...2875
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-02 finished in 508935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((!p1 U (G(!p1)||(!p1&&G(p2))))||F((G(F(p2))||(F(p2)&&X(!p3)))))))'
Support contains 25 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 16 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:07:28] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:07:28] [INFO ] Invariant cache hit.
[2025-06-03 02:07:28] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:37] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:37] [INFO ] Deduced a trap composed of 72 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-03 02:07:37] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:37] [INFO ] Deduced a trap composed of 72 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-03 02:07:37] [INFO ] Deduced a trap composed of 72 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-03 02:07:37] [INFO ] Deduced a trap composed of 245 places in 301 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:38] [INFO ] Deduced a trap composed of 121 places in 240 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:38] [INFO ] Deduced a trap composed of 72 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-03 02:07:39] [INFO ] Deduced a trap composed of 250 places in 329 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:39] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:39] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:07:48] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 20 ms to minimize.
SMT process timed out in 20538ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 20540ms
[2025-06-03 02:07:48] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:07:49] [INFO ] Implicit Places using invariants in 698 ms returned []
[2025-06-03 02:07:49] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:07:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:07:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:07:55] [INFO ] Implicit Places using invariants and state equation in 5913 ms returned []
Implicit Place search using SMT with State Equation took 6612 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:07:55] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:07:55] [INFO ] Invariant cache hit.
[2025-06-03 02:07:55] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:04] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:04] [INFO ] Deduced a trap composed of 72 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-03 02:08:04] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:04] [INFO ] Deduced a trap composed of 72 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-03 02:08:04] [INFO ] Deduced a trap composed of 72 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-03 02:08:05] [INFO ] Deduced a trap composed of 245 places in 285 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:05] [INFO ] Deduced a trap composed of 121 places in 232 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:05] [INFO ] Deduced a trap composed of 72 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-03 02:08:06] [INFO ] Deduced a trap composed of 250 places in 322 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:06] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:07] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:16] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:19] [INFO ] Deduced a trap composed of 218 places in 279 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:19] [INFO ] Deduced a trap composed of 266 places in 276 ms of which 69 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:38] [INFO ] Deduced a trap composed of 246 places in 301 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:40] [INFO ] Deduced a trap composed of 86 places in 241 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:41] [INFO ] Deduced a trap composed of 284 places in 209 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:08:50] [INFO ] Deduced a trap composed of 241 places in 279 ms of which 64 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 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60534ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87710 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 402 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), (AND (NOT p2) p1 p3), (AND p1 (NOT p2)), (AND p1 (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) p3 (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Product exploration explored 100000 steps with 50000 reset in 455 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 p2 (NOT p1) (NOT p0) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0 p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND (NOT p2) p0 p3))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND (NOT p2) p1 (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 51 factoid took 27 ms. Reduced automaton from 9 states, 36 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-03 finished in 89078 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 U p1))&&F(X(F(!p0)))))'
Support contains 15 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2025-06-03 02:08:57] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2025-06-03 02:08:57] [INFO ] Computed 42 invariants in 19 ms
[2025-06-03 02:08:57] [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/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:06] [INFO ] Deduced a trap composed of 74 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-03 02:09:06] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:06] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:07] [INFO ] Deduced a trap composed of 74 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-03 02:09:07] [INFO ] Deduced a trap composed of 74 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-03 02:09:07] [INFO ] Deduced a trap composed of 245 places in 262 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:07] [INFO ] Deduced a trap composed of 133 places in 284 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:08] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:08] [INFO ] Deduced a trap composed of 251 places in 290 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:09] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:09] [INFO ] Deduced a trap composed of 233 places in 284 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:11] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 52 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:28] [INFO ] Deduced a trap composed of 278 places in 285 ms of which 94 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 53 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40525ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40526ms
[2025-06-03 02:09:37] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 02:09:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:09:38] [INFO ] Implicit Places using invariants in 727 ms returned []
[2025-06-03 02:09:38] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 02:09:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:09:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:09:45] [INFO ] Implicit Places using invariants and state equation in 7293 ms returned []
Implicit Place search using SMT with State Equation took 8028 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2025-06-03 02:09:45] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 02:09:45] [INFO ] Invariant cache hit.
[2025-06-03 02:09:45] [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/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:55] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:55] [INFO ] Deduced a trap composed of 74 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-03 02:09:55] [INFO ] Deduced a trap composed of 74 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-03 02:09:55] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:55] [INFO ] Deduced a trap composed of 74 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-03 02:09:55] [INFO ] Deduced a trap composed of 245 places in 300 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:56] [INFO ] Deduced a trap composed of 133 places in 252 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:56] [INFO ] Deduced a trap composed of 74 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-03 02:09:56] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:57] [INFO ] Deduced a trap composed of 251 places in 283 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:57] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:09:57] [INFO ] Deduced a trap composed of 233 places in 288 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:07] [INFO ] Deduced a trap composed of 259 places in 292 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:07] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:09] [INFO ] Deduced a trap composed of 278 places in 310 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:09] [INFO ] Deduced a trap composed of 284 places in 259 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 56 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:24] [INFO ] Deduced a trap composed of 253 places in 322 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:25] [INFO ] Deduced a trap composed of 349 places in 305 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:29] [INFO ] Deduced a trap composed of 247 places in 271 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:30] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 60 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60535ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Finished structural reductions in LTL mode , in 1 iterations and 109103 ms. Remains : 528/528 places, 968/968 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR p0 p1), p1, p0]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-04
Product exploration explored 100000 steps with 28598 reset in 304 ms.
Product exploration explored 100000 steps with 28545 reset in 344 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[p0, p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 5 factoid took 233 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 79 ms :[p0, p0]
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Support contains 9 out of 528 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 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 528 transition count 926
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 486 transition count 926
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 486 transition count 866
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 426 transition count 866
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 276 place count 390 transition count 830
Applied a total of 276 rules in 37 ms. Remains 390 /528 variables (removed 138) and now considering 830/968 (removed 138) transitions.
Running 828 sub problems to find dead transitions.
[2025-06-03 02:10:47] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
// Phase 1: matrix 818 rows 390 cols
[2025-06-03 02:10:47] [INFO ] Computed 42 invariants in 15 ms
[2025-06-03 02:10: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/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:54] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:54] [INFO ] Deduced a trap composed of 51 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-03 02:10:54] [INFO ] Deduced a trap composed of 51 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-03 02:10:54] [INFO ] Deduced a trap composed of 51 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-03 02:10:55] [INFO ] Deduced a trap composed of 51 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-03 02:10:55] [INFO ] Deduced a trap composed of 143 places in 250 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:55] [INFO ] Deduced a trap composed of 148 places in 238 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:55] [INFO ] Deduced a trap composed of 131 places in 222 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:56] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:56] [INFO ] Deduced a trap composed of 51 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-03 02:10:58] [INFO ] Deduced a trap composed of 240 places in 203 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:02] [INFO ] Deduced a trap composed of 146 places in 205 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:05] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 828 unsolved
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 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)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1208 variables, and 53 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:23] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:24] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1208 variables, and 55 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40485ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 40487ms
[2025-06-03 02:11:28] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 02:11:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:11:29] [INFO ] Implicit Places using invariants in 1276 ms returned []
[2025-06-03 02:11:29] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 02:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:11:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:11:34] [INFO ] Implicit Places using invariants and state equation in 4512 ms returned []
Implicit Place search using SMT with State Equation took 5790 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:11:34] [INFO ] Redundant transitions in 9 ms returned []
Running 828 sub problems to find dead transitions.
[2025-06-03 02:11:34] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 02:11:34] [INFO ] Invariant cache hit.
[2025-06-03 02:11:34] [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/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:41] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:41] [INFO ] Deduced a trap composed of 51 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-03 02:11:41] [INFO ] Deduced a trap composed of 51 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-03 02:11:41] [INFO ] Deduced a trap composed of 51 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-03 02:11:41] [INFO ] Deduced a trap composed of 51 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-03 02:11:41] [INFO ] Deduced a trap composed of 143 places in 231 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:41] [INFO ] Deduced a trap composed of 148 places in 220 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:42] [INFO ] Deduced a trap composed of 131 places in 216 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:42] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:42] [INFO ] Deduced a trap composed of 51 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-03 02:11:47] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:50] [INFO ] Deduced a trap composed of 138 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-03 02:11:51] [INFO ] Deduced a trap composed of 110 places in 182 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:55] [INFO ] Deduced a trap composed of 240 places in 199 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:57] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1208 variables, and 55 constraints, problems are : Problem set: 0 solved, 828 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:14] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1208 variables, and 56 constraints, problems are : Problem set: 0 solved, 828 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60451ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 390/528 places, 830/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106783 ms. Remains : 390/528 places, 830/968 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 105 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 52 ms :[p0, p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 113 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 54 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Product exploration explored 100000 steps with 28563 reset in 272 ms.
Product exploration explored 100000 steps with 28563 reset in 296 ms.
Built C files in :
/tmp/ltsmin14142441443130628908
[2025-06-03 02:12:35] [INFO ] Computing symmetric may disable matrix : 830 transitions.
[2025-06-03 02:12:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:12:35] [INFO ] Computing symmetric may enable matrix : 830 transitions.
[2025-06-03 02:12:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:12:35] [INFO ] Computing Do-Not-Accords matrix : 830 transitions.
[2025-06-03 02:12:35] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:12:35] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14142441443130628908
Running compilation step : cd /tmp/ltsmin14142441443130628908;'/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 2395 ms.
Running link step : cd /tmp/ltsmin14142441443130628908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14142441443130628908;'/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/stateBased11150270867663294004.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 390 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 830/830 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 390 transition count 818
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 378 transition count 818
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 372 transition count 812
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 372 transition count 812
Applied a total of 36 rules in 27 ms. Remains 372 /390 variables (removed 18) and now considering 812/830 (removed 18) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 02:12:50] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 372 cols
[2025-06-03 02:12:50] [INFO ] Computed 42 invariants in 12 ms
[2025-06-03 02:12:50] [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/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:57] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:57] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:57] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:57] [INFO ] Deduced a trap composed of 48 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-03 02:12:57] [INFO ] Deduced a trap composed of 48 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-03 02:12:57] [INFO ] Deduced a trap composed of 131 places in 220 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:57] [INFO ] Deduced a trap composed of 136 places in 230 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:58] [INFO ] Deduced a trap composed of 48 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-03 02:12:59] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:00] [INFO ] Deduced a trap composed of 228 places in 211 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:02] [INFO ] Deduced a trap composed of 119 places in 204 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:02] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:05] [INFO ] Deduced a trap composed of 126 places in 198 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:06] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 14/54 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 Real declared 370/1172 variables, and 54 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 14/14 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/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:20] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1172 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40407ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40409ms
[2025-06-03 02:13:31] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:13:32] [INFO ] Implicit Places using invariants in 1157 ms returned []
[2025-06-03 02:13:32] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:13:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:13:37] [INFO ] Implicit Places using invariants and state equation in 5222 ms returned []
Implicit Place search using SMT with State Equation took 6395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:13:37] [INFO ] Redundant transitions in 8 ms returned []
Running 810 sub problems to find dead transitions.
[2025-06-03 02:13:37] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:13:37] [INFO ] Invariant cache hit.
[2025-06-03 02:13:37] [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/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:44] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:44] [INFO ] Deduced a trap composed of 48 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-03 02:13:44] [INFO ] Deduced a trap composed of 48 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-03 02:13:44] [INFO ] Deduced a trap composed of 48 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-03 02:13:44] [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-03 02:13:44] [INFO ] Deduced a trap composed of 131 places in 217 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:44] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:44] [INFO ] Deduced a trap composed of 119 places in 216 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:45] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:45] [INFO ] Deduced a trap composed of 48 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-03 02:13:46] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:50] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:53] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:53] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:57] [INFO ] Deduced a trap composed of 228 places in 193 ms of which 51 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1172 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 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/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
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 TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem 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
At refinement iteration 4 (OVERLAPS) 1/371 variables, 1/56 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1172 variables, and 56 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60445ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 60447ms
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 : 372/390 places, 776/830 transitions.
Applied a total of 0 rules in 11 ms. Remains 372 /372 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:14:37] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 107325 ms. Remains : 372/390 places, 776/830 transitions.
Built C files in :
/tmp/ltsmin11701435023383953685
[2025-06-03 02:14:37] [INFO ] Computing symmetric may disable matrix : 776 transitions.
[2025-06-03 02:14:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:14:37] [INFO ] Computing symmetric may enable matrix : 776 transitions.
[2025-06-03 02:14:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:14:38] [INFO ] Computing Do-Not-Accords matrix : 776 transitions.
[2025-06-03 02:14:38] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:14:38] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11701435023383953685
Running compilation step : cd /tmp/ltsmin11701435023383953685;'/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 2223 ms.
Running link step : cd /tmp/ltsmin11701435023383953685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11701435023383953685;'/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/stateBased12218925167247414827.hoa' '--buchi-type=spotba'
LTSmin run took 6162 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-04 finished in 349394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U ((p0 U p1)&&F(p2))))'
Support contains 60 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 20 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:14:46] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 02:14:46] [INFO ] Computed 42 invariants in 18 ms
[2025-06-03 02:14:46] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:55] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:55] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:55] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:55] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:56] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:56] [INFO ] Deduced a trap composed of 245 places in 261 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:56] [INFO ] Deduced a trap composed of 121 places in 238 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:56] [INFO ] Deduced a trap composed of 72 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-03 02:14:57] [INFO ] Deduced a trap composed of 266 places in 274 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:58] [INFO ] Deduced a trap composed of 250 places in 350 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:58] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:58] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:15] [INFO ] Deduced a trap composed of 241 places in 299 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:16] [INFO ] Deduced a trap composed of 348 places in 291 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:20] [INFO ] Deduced a trap composed of 246 places in 283 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:21] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40484ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40485ms
[2025-06-03 02:15:27] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:15:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:15:27] [INFO ] Implicit Places using invariants in 653 ms returned []
[2025-06-03 02:15:27] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:15:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:15:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:15:34] [INFO ] Implicit Places using invariants and state equation in 7073 ms returned []
Implicit Place search using SMT with State Equation took 7727 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:15:34] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:15:34] [INFO ] Invariant cache hit.
[2025-06-03 02:15:34] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:44] [INFO ] Deduced a trap composed of 72 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-03 02:15:44] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:44] [INFO ] Deduced a trap composed of 72 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-03 02:15:44] [INFO ] Deduced a trap composed of 72 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-03 02:15:44] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:44] [INFO ] Deduced a trap composed of 245 places in 302 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:45] [INFO ] Deduced a trap composed of 121 places in 240 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:45] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:46] [INFO ] Deduced a trap composed of 250 places in 318 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:46] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:46] [INFO ] Deduced a trap composed of 233 places in 266 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:55] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:58] [INFO ] Deduced a trap composed of 218 places in 276 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:59] [INFO ] Deduced a trap composed of 266 places in 281 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:17] [INFO ] Deduced a trap composed of 246 places in 288 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:19] [INFO ] Deduced a trap composed of 86 places in 260 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:20] [INFO ] Deduced a trap composed of 284 places in 205 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:29] [INFO ] Deduced a trap composed of 241 places in 260 ms of which 65 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108698 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-06 finished in 108907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X((p1 U p2)))))))'
Support contains 18 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Applied a total of 12 rules in 16 ms. Remains 522 /528 variables (removed 6) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2025-06-03 02:16:35] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 522 cols
[2025-06-03 02:16:35] [INFO ] Computed 42 invariants in 16 ms
[2025-06-03 02:16:35] [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/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:44] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:44] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:44] [INFO ] Deduced a trap composed of 73 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-03 02:16:44] [INFO ] Deduced a trap composed of 73 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-03 02:16:45] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:45] [INFO ] Deduced a trap composed of 245 places in 296 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:45] [INFO ] Deduced a trap composed of 127 places in 240 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:45] [INFO ] Deduced a trap composed of 73 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-03 02:16:46] [INFO ] Deduced a trap composed of 224 places in 274 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:47] [INFO ] Deduced a trap composed of 252 places in 310 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:47] [INFO ] Deduced a trap composed of 253 places in 313 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:47] [INFO ] Deduced a trap composed of 251 places in 311 ms of which 92 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1472 variables, and 52 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:09] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:11] [INFO ] Deduced a trap composed of 349 places in 268 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:13] [INFO ] Deduced a trap composed of 233 places in 298 ms of which 86 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1472 variables, and 55 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40460ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 40461ms
[2025-06-03 02:17:15] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:17:16] [INFO ] Implicit Places using invariants in 652 ms returned []
[2025-06-03 02:17:16] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:17:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:17:24] [INFO ] Implicit Places using invariants and state equation in 7519 ms returned []
Implicit Place search using SMT with State Equation took 8173 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2025-06-03 02:17:24] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:17:24] [INFO ] Invariant cache hit.
[2025-06-03 02:17: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/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:33] [INFO ] Deduced a trap composed of 73 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-03 02:17:33] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:33] [INFO ] Deduced a trap composed of 73 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-03 02:17:33] [INFO ] Deduced a trap composed of 73 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-03 02:17:33] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:34] [INFO ] Deduced a trap composed of 245 places in 344 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:34] [INFO ] Deduced a trap composed of 92 places in 238 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:34] [INFO ] Deduced a trap composed of 127 places in 237 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:35] [INFO ] Deduced a trap composed of 73 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-03 02:17:35] [INFO ] Deduced a trap composed of 272 places in 280 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:35] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:36] [INFO ] Deduced a trap composed of 251 places in 311 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:44] [INFO ] Deduced a trap composed of 233 places in 263 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:44] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:45] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:45] [INFO ] Deduced a trap composed of 259 places in 280 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:46] [INFO ] Deduced a trap composed of 247 places in 282 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:17:47] [INFO ] Deduced a trap composed of 284 places in 222 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.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 0.0)
(s11 1.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 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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1472 variables, and 58 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1472 variables, and 58 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in LTL mode, iteration 1 : 522/528 places, 962/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109124 ms. Remains : 522/528 places, 962/968 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-08
Product exploration explored 100000 steps with 4596 reset in 268 ms.
Product exploration explored 100000 steps with 4591 reset in 273 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
RANDOM walk for 40001 steps (14 resets) in 333 ms. (119 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (9 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
[2025-06-03 02:18:25] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:18:25] [INFO ] Invariant cache hit.
[2025-06-03 02:18:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 157/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/208 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/222 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 512/1472 variables, and 33 constraints, problems are : Problem set: 1 solved, 0 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 10/16 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 434ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT p0))), (G (AND (OR (NOT p1) p2) (OR (NOT p0) p2)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p0 p2)))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
[2025-06-03 02:18:26] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:18:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:18:27] [INFO ] [Real]Absence check using 16 positive place invariants in 48 ms returned sat
[2025-06-03 02:18:27] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 316 ms returned sat
[2025-06-03 02:18:30] [INFO ] [Real]Absence check using state equation in 3506 ms returned sat
[2025-06-03 02:18: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-03 02:18:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 110 ms returned sat
[2025-06-03 02:18:31] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 371 ms returned sat
[2025-06-03 02:18:38] [INFO ] [Nat]Absence check using state equation in 6277 ms returned sat
[2025-06-03 02:18:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:18:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 295 ms returned sat
[2025-06-03 02:18:38] [INFO ] Computed and/alt/rep : 624/2199/618 causal constraints (skipped 330 transitions) in 76 ms.
[2025-06-03 02:18:43] [INFO ] Added : 193 causal constraints over 39 iterations in 5409 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 522 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 962/962 transitions.
Applied a total of 0 rules in 6 ms. Remains 522 /522 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Running 960 sub problems to find dead transitions.
[2025-06-03 02:18:43] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:18:43] [INFO ] Invariant cache hit.
[2025-06-03 02:18:43] [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/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:54] [INFO ] Deduced a trap composed of 73 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-03 02:18:54] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:54] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:54] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:54] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:54] [INFO ] Deduced a trap composed of 245 places in 331 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:55] [INFO ] Deduced a trap composed of 92 places in 231 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:55] [INFO ] Deduced a trap composed of 127 places in 239 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:55] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:56] [INFO ] Deduced a trap composed of 272 places in 290 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:56] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:56] [INFO ] Deduced a trap composed of 251 places in 314 ms of which 92 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 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 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 9.0)
(s147 1.0)
(s148 0.0)
(s149 1.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 0.0)
(s160 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1472 variables, and 52 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:12] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:13] [INFO ] Deduced a trap composed of 349 places in 290 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:18] [INFO ] Deduced a trap composed of 247 places in 272 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:19] [INFO ] Deduced a trap composed of 259 places in 271 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:21] [INFO ] Deduced a trap composed of 284 places in 232 ms of which 60 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1472 variables, and 57 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40573ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 40575ms
[2025-06-03 02:19:24] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:19:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:25] [INFO ] Implicit Places using invariants in 646 ms returned []
[2025-06-03 02:19:25] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:19:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:19:32] [INFO ] Implicit Places using invariants and state equation in 7484 ms returned []
Implicit Place search using SMT with State Equation took 8136 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2025-06-03 02:19:32] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:19:32] [INFO ] Invariant cache hit.
[2025-06-03 02:19: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/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:42] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:42] [INFO ] Deduced a trap composed of 73 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-03 02:19:42] [INFO ] Deduced a trap composed of 73 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-03 02:19:42] [INFO ] Deduced a trap composed of 73 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-03 02:19:42] [INFO ] Deduced a trap composed of 73 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-03 02:19:42] [INFO ] Deduced a trap composed of 245 places in 324 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:43] [INFO ] Deduced a trap composed of 92 places in 237 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:43] [INFO ] Deduced a trap composed of 127 places in 231 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:43] [INFO ] Deduced a trap composed of 73 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-03 02:19:43] [INFO ] Deduced a trap composed of 272 places in 263 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:44] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:44] [INFO ] Deduced a trap composed of 251 places in 307 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:52] [INFO ] Deduced a trap composed of 233 places in 277 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:53] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:54] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:54] [INFO ] Deduced a trap composed of 259 places in 291 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:54] [INFO ] Deduced a trap composed of 247 places in 294 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:56] [INFO ] Deduced a trap composed of 284 places in 212 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1472 variables, and 58 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1472 variables, and 58 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60486ms
Finished structural reductions in LTL mode , in 1 iterations and 109215 ms. Remains : 522/522 places, 962/962 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 p2 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
RANDOM walk for 93 steps (0 resets) in 8 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p2)), (F p0)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
[2025-06-03 02:20:33] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:20:34] [INFO ] [Real]Absence check using 16 positive place invariants in 49 ms returned sat
[2025-06-03 02:20:34] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 315 ms returned sat
[2025-06-03 02:20:38] [INFO ] [Real]Absence check using state equation in 3551 ms returned sat
[2025-06-03 02:20:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:20:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 110 ms returned sat
[2025-06-03 02:20:39] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 377 ms returned sat
[2025-06-03 02:20:45] [INFO ] [Nat]Absence check using state equation in 6382 ms returned sat
[2025-06-03 02:20:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:20:45] [INFO ] [Nat]Added 72 Read/Feed constraints in 290 ms returned sat
[2025-06-03 02:20:45] [INFO ] Computed and/alt/rep : 624/2199/618 causal constraints (skipped 330 transitions) in 50 ms.
[2025-06-03 02:20:51] [INFO ] Added : 193 causal constraints over 39 iterations in 5320 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4615 reset in 248 ms.
Product exploration explored 100000 steps with 4610 reset in 270 ms.
Built C files in :
/tmp/ltsmin15744999309803239100
[2025-06-03 02:20:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15744999309803239100
Running compilation step : cd /tmp/ltsmin15744999309803239100;'/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 1626 ms.
Running link step : cd /tmp/ltsmin15744999309803239100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15744999309803239100;'/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/stateBased10431248772427551045.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 522/522 places, 962/962 transitions.
Applied a total of 0 rules in 5 ms. Remains 522 /522 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Running 960 sub problems to find dead transitions.
[2025-06-03 02:21:06] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:21:06] [INFO ] Invariant cache hit.
[2025-06-03 02:21:07] [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/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:16] [INFO ] Deduced a trap composed of 73 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-03 02:21:16] [INFO ] Deduced a trap composed of 73 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-03 02:21:16] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:16] [INFO ] Deduced a trap composed of 73 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-03 02:21:16] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:17] [INFO ] Deduced a trap composed of 245 places in 341 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:17] [INFO ] Deduced a trap composed of 92 places in 225 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:17] [INFO ] Deduced a trap composed of 127 places in 236 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:17] [INFO ] Deduced a trap composed of 73 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-03 02:21:18] [INFO ] Deduced a trap composed of 272 places in 277 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:18] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:19] [INFO ] Deduced a trap composed of 251 places in 285 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:27] [INFO ] Deduced a trap composed of 233 places in 280 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:27] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 23 ms to minimize.
SMT process timed out in 20488ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 20490ms
[2025-06-03 02:21:27] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:21:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:21:28] [INFO ] Implicit Places using invariants in 629 ms returned []
[2025-06-03 02:21:28] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:21:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:21:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:21:35] [INFO ] Implicit Places using invariants and state equation in 7449 ms returned []
Implicit Place search using SMT with State Equation took 8080 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2025-06-03 02:21:35] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2025-06-03 02:21:35] [INFO ] Invariant cache hit.
[2025-06-03 02:21: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/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:44] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:44] [INFO ] Deduced a trap composed of 73 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-03 02:21:44] [INFO ] Deduced a trap composed of 73 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-03 02:21:44] [INFO ] Deduced a trap composed of 73 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-03 02:21:45] [INFO ] Deduced a trap composed of 73 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-03 02:21:45] [INFO ] Deduced a trap composed of 245 places in 344 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:45] [INFO ] Deduced a trap composed of 92 places in 238 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:46] [INFO ] Deduced a trap composed of 127 places in 233 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:46] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:46] [INFO ] Deduced a trap composed of 272 places in 279 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:46] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:47] [INFO ] Deduced a trap composed of 251 places in 306 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:55] [INFO ] Deduced a trap composed of 233 places in 250 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:55] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:56] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:57] [INFO ] Deduced a trap composed of 259 places in 275 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:57] [INFO ] Deduced a trap composed of 247 places in 277 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:59] [INFO ] Deduced a trap composed of 284 places in 227 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.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 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 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 9.0)
(s147 0.0)
(s148 1.0)
(s149 1.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 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 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.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 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 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.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 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 520/1472 variables, and 58 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1472 variables, and 58 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Finished structural reductions in LTL mode , in 1 iterations and 89043 ms. Remains : 522/522 places, 962/962 transitions.
Built C files in :
/tmp/ltsmin7185900317272452168
[2025-06-03 02:22:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7185900317272452168
Running compilation step : cd /tmp/ltsmin7185900317272452168;'/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 1699 ms.
Running link step : cd /tmp/ltsmin7185900317272452168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7185900317272452168;'/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/stateBased10700741715422888801.hoa' '--buchi-type=spotba'
LTSmin run took 12096 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-08 finished in 374484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 24 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:22:49] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 02:22:49] [INFO ] Computed 42 invariants in 17 ms
[2025-06-03 02:22:49] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:22:58] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:22:59] [INFO ] Deduced a trap composed of 72 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-03 02:22:59] [INFO ] Deduced a trap composed of 72 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-03 02:22:59] [INFO ] Deduced a trap composed of 72 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-03 02:22:59] [INFO ] Deduced a trap composed of 72 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-03 02:22:59] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:22:59] [INFO ] Deduced a trap composed of 121 places in 241 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:00] [INFO ] Deduced a trap composed of 72 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-03 02:23:00] [INFO ] Deduced a trap composed of 266 places in 271 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:01] [INFO ] Deduced a trap composed of 250 places in 315 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:01] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:01] [INFO ] Deduced a trap composed of 233 places in 267 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:18] [INFO ] Deduced a trap composed of 241 places in 290 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:19] [INFO ] Deduced a trap composed of 348 places in 277 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:22] [INFO ] Deduced a trap composed of 246 places in 285 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:23] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 954 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 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40499ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40501ms
[2025-06-03 02:23:30] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:23:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:23:31] [INFO ] Implicit Places using invariants in 728 ms returned []
[2025-06-03 02:23:31] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:23:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:23:37] [INFO ] Implicit Places using invariants and state equation in 6608 ms returned []
Implicit Place search using SMT with State Equation took 7365 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:23:37] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:23:37] [INFO ] Invariant cache hit.
[2025-06-03 02:23:37] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:46] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:47] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:47] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:47] [INFO ] Deduced a trap composed of 72 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-03 02:23:47] [INFO ] Deduced a trap composed of 72 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-03 02:23:47] [INFO ] Deduced a trap composed of 245 places in 300 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:48] [INFO ] Deduced a trap composed of 121 places in 231 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:48] [INFO ] Deduced a trap composed of 72 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-03 02:23:48] [INFO ] Deduced a trap composed of 250 places in 306 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:49] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:49] [INFO ] Deduced a trap composed of 233 places in 262 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:57] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:00] [INFO ] Deduced a trap composed of 218 places in 249 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:01] [INFO ] Deduced a trap composed of 266 places in 264 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:19] [INFO ] Deduced a trap composed of 246 places in 311 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:22] [INFO ] Deduced a trap composed of 86 places in 253 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:22] [INFO ] Deduced a trap composed of 284 places in 221 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:31] [INFO ] Deduced a trap composed of 241 places in 303 ms of which 65 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108299 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 257 ms.
Product exploration explored 100000 steps with 33333 reset in 258 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-09 finished in 108952 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)&&F(G(p1)))))'
Support contains 13 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 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 528 transition count 926
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 486 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 480 transition count 920
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 96 place count 480 transition count 854
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 234 place count 408 transition count 848
Iterating global reduction 3 with 6 rules applied. Total rules applied 240 place count 408 transition count 848
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 300 place count 378 transition count 818
Applied a total of 300 rules in 58 ms. Remains 378 /528 variables (removed 150) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-03 02:24:38] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 378 cols
[2025-06-03 02:24:38] [INFO ] Computed 42 invariants in 9 ms
[2025-06-03 02:24: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/376 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:46] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:46] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:46] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:46] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:48] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:48] [INFO ] Deduced a trap composed of 234 places in 208 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:49] [INFO ] Deduced a trap composed of 49 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-03 02:24:50] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:51] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:54] [INFO ] Deduced a trap composed of 104 places in 222 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1184 variables, and 50 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 10/10 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/376 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:09] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:14] [INFO ] Deduced a trap composed of 132 places in 203 ms of which 50 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/1184 variables, and 52 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40557ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40558ms
[2025-06-03 02:25:19] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 02:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:20] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2025-06-03 02:25:20] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 02:25:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:25:25] [INFO ] Implicit Places using invariants and state equation in 4431 ms returned []
Implicit Place search using SMT with State Equation took 5659 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:25:25] [INFO ] Redundant transitions in 10 ms returned []
Running 816 sub problems to find dead transitions.
[2025-06-03 02:25:25] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-03 02:25:25] [INFO ] Invariant cache hit.
[2025-06-03 02:25:25] [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/376 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:32] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:32] [INFO ] Deduced a trap composed of 49 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-03 02:25:33] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:34] [INFO ] Deduced a trap composed of 234 places in 332 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:35] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:35] [INFO ] Deduced a trap composed of 49 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-03 02:25:36] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:37] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:37] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:41] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 816 unsolved
SMT process timed out in 30477ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 30480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 378/528 places, 818/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76783 ms. Remains : 378/528 places, 818/968 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-10
Stuttering criterion allowed to conclude after 2459 steps with 0 reset in 11 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-10 finished in 76909 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 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 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 528 transition count 926
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 486 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 480 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 480 transition count 860
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 420 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 414 transition count 854
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 414 transition count 854
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 312 place count 372 transition count 812
Applied a total of 312 rules in 57 ms. Remains 372 /528 variables (removed 156) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-03 02:25:55] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 372 cols
[2025-06-03 02:25:55] [INFO ] Computed 42 invariants in 24 ms
[2025-06-03 02:25:55] [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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:02] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:02] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:02] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:02] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:02] [INFO ] Deduced a trap composed of 48 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-03 02:26:03] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:03] [INFO ] Deduced a trap composed of 142 places in 284 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:03] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:03] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:04] [INFO ] Deduced a trap composed of 48 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-03 02:26:04] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:06] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:11] [INFO ] Deduced a trap composed of 104 places in 217 ms of which 42 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1172 variables, and 53 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:26] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:31] [INFO ] Deduced a trap composed of 127 places in 223 ms of which 46 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 370/1172 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40532ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40533ms
[2025-06-03 02:26:36] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:26:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:37] [INFO ] Implicit Places using invariants in 1160 ms returned []
[2025-06-03 02:26:37] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:26:42] [INFO ] Implicit Places using invariants and state equation in 4724 ms returned []
Implicit Place search using SMT with State Equation took 5891 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:26:42] [INFO ] Redundant transitions in 7 ms returned []
Running 810 sub problems to find dead transitions.
[2025-06-03 02:26:42] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-03 02:26:42] [INFO ] Invariant cache hit.
[2025-06-03 02:26:42] [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/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:48] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:48] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:48] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:48] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:49] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:49] [INFO ] Deduced a trap composed of 137 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-03 02:26:49] [INFO ] Deduced a trap composed of 142 places in 213 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:49] [INFO ] Deduced a trap composed of 131 places in 236 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:50] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:50] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:50] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:50] [INFO ] Deduced a trap composed of 136 places in 234 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:51] [INFO ] Deduced a trap composed of 48 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-03 02:26:52] [INFO ] Deduced a trap composed of 228 places in 196 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:57] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:58] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:58] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 30431ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 30434ms
Starting structural reductions in SI_LTL mode, iteration 1 : 372/528 places, 812/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76931 ms. Remains : 372/528 places, 812/968 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-11
Product exploration explored 100000 steps with 54 reset in 277 ms.
Stack based approach found an accepted trace after 797 steps with 0 reset with depth 798 and stack size 798 in 4 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-11 finished in 77263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p1)))'
Support contains 12 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 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 528 transition count 938
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 498 transition count 938
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 60 place count 498 transition count 872
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 192 place count 432 transition count 872
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 2 with 84 rules applied. Total rules applied 276 place count 390 transition count 830
Applied a total of 276 rules in 50 ms. Remains 390 /528 variables (removed 138) and now considering 830/968 (removed 138) transitions.
Running 828 sub problems to find dead transitions.
[2025-06-03 02:27:13] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
// Phase 1: matrix 818 rows 390 cols
[2025-06-03 02:27:13] [INFO ] Computed 42 invariants in 9 ms
[2025-06-03 02:27: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/388 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:19] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:19] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:19] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:19] [INFO ] Deduced a trap composed of 51 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-03 02:27:19] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:19] [INFO ] Deduced a trap composed of 51 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-03 02:27:20] [INFO ] Deduced a trap composed of 149 places in 215 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:20] [INFO ] Deduced a trap composed of 154 places in 240 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:20] [INFO ] Deduced a trap composed of 143 places in 221 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:20] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:21] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:23] [INFO ] Deduced a trap composed of 240 places in 217 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:28] [INFO ] Deduced a trap composed of 122 places in 192 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:29] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1208 variables, and 54 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:45] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:27:53] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1208 variables, and 56 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40521ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 40524ms
[2025-06-03 02:27:53] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 02:27:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:54] [INFO ] Implicit Places using invariants in 1160 ms returned []
[2025-06-03 02:27:54] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 02:27:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:28:00] [INFO ] Implicit Places using invariants and state equation in 5698 ms returned []
Implicit Place search using SMT with State Equation took 6872 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:28:00] [INFO ] Redundant transitions in 7 ms returned []
Running 828 sub problems to find dead transitions.
[2025-06-03 02:28:00] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 02:28:00] [INFO ] Invariant cache hit.
[2025-06-03 02:28: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/388 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:06] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:06] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:06] [INFO ] Deduced a trap composed of 51 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-03 02:28:06] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:06] [INFO ] Deduced a trap composed of 51 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-03 02:28:07] [INFO ] Deduced a trap composed of 149 places in 236 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:07] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:07] [INFO ] Deduced a trap composed of 143 places in 224 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:07] [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-03 02:28:08] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:08] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:15] [INFO ] Deduced a trap composed of 152 places in 210 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:16] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:20] [INFO ] Deduced a trap composed of 240 places in 218 ms of which 56 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1208 variables, and 54 constraints, problems are : Problem set: 0 solved, 828 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:50] [INFO ] Deduced a trap composed of 79 places in 187 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1208 variables, and 55 constraints, problems are : Problem set: 0 solved, 828 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Starting structural reductions in SI_LTL mode, iteration 1 : 390/528 places, 830/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107959 ms. Remains : 390/528 places, 830/968 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-14
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-14 finished in 108071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G((X(p0) U !p1))||G(p1))) U (F(p1)&&p2)))'
Support contains 32 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 20 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:29:01] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 02:29:01] [INFO ] Computed 42 invariants in 19 ms
[2025-06-03 02:29: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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:10] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:10] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:10] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:10] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:10] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:11] [INFO ] Deduced a trap composed of 245 places in 265 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:11] [INFO ] Deduced a trap composed of 121 places in 233 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:11] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:12] [INFO ] Deduced a trap composed of 266 places in 270 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:12] [INFO ] Deduced a trap composed of 250 places in 329 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:12] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:13] [INFO ] Deduced a trap composed of 233 places in 281 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:30] [INFO ] Deduced a trap composed of 241 places in 293 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:30] [INFO ] Deduced a trap composed of 348 places in 291 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:34] [INFO ] Deduced a trap composed of 246 places in 304 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:35] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(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 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(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 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(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 10)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(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 1)
(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)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40486ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40488ms
[2025-06-03 02:29:41] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:29:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:42] [INFO ] Implicit Places using invariants in 686 ms returned []
[2025-06-03 02:29:42] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:29:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 02:29:49] [INFO ] Implicit Places using invariants and state equation in 6734 ms returned []
Implicit Place search using SMT with State Equation took 7435 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 02:29:49] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 02:29:49] [INFO ] Invariant cache hit.
[2025-06-03 02:29:49] [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/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:58] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:58] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:58] [INFO ] Deduced a trap composed of 72 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-03 02:29:58] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:58] [INFO ] Deduced a trap composed of 72 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-03 02:29:59] [INFO ] Deduced a trap composed of 245 places in 296 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:59] [INFO ] Deduced a trap composed of 121 places in 231 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:59] [INFO ] Deduced a trap composed of 72 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-03 02:30:00] [INFO ] Deduced a trap composed of 250 places in 302 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:00] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:01] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:09] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:13] [INFO ] Deduced a trap composed of 218 places in 252 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:13] [INFO ] Deduced a trap composed of 266 places in 265 ms of which 69 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:31] [INFO ] Deduced a trap composed of 246 places in 296 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:34] [INFO ] Deduced a trap composed of 86 places in 243 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:34] [INFO ] Deduced a trap composed of 284 places in 205 ms of which 48 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:30:44] [INFO ] Deduced a trap composed of 241 places in 272 ms of which 67 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108465 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p2)), false, (NOT p1), p1, (AND (NOT p1) (NOT p0)), (OR (NOT p0) p1), true, (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 386 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLFireability-15 finished in 108806 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' '!(X(((F(p0) U p1)&&F((p2||X(p3))))))'
[2025-06-03 02:30:50] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11830953217688522222
[2025-06-03 02:30:50] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2025-06-03 02:30:50] [INFO ] Applying decomposition
[2025-06-03 02:30:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:30:50] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2025-06-03 02:30:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:30:50] [INFO ] Flatten gal took : 28 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/graph432468917924419797.txt' '-o' '/tmp/graph432468917924419797.bin' '-w' '/tmp/graph432468917924419797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph432468917924419797.bin' '-l' '-1' '-v' '-w' '/tmp/graph432468917924419797.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:30:50] [INFO ] Decomposing Gal with order
[2025-06-03 02:30:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:30:50] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2025-06-03 02:30:50] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:30:50] [INFO ] Removed a total of 804 redundant transitions.
[2025-06-03 02:30:50] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11830953217688522222
Running compilation step : cd /tmp/ltsmin11830953217688522222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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-03 02:30:50] [INFO ] Flatten gal took : 67 ms
[2025-06-03 02:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 16 ms.
[2025-06-03 02:30:50] [INFO ] Time to serialize gal into /tmp/LTLFireability9152247037914591986.gal : 8 ms
[2025-06-03 02:30:50] [INFO ] Time to serialize properties into /tmp/LTLFireability10213346749029048928.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/LTLFireability9152247037914591986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10213346749029048928.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 2 LTL properties
Checking formula 0 : !((G(F("((((i0.u20.QueueJobE_3<1)&&(i0.u20.QueueJobE_2<1))&&((i0.u20.QueueJobE_5<1)&&(i0.u20.QueueJobE_4<1)))&&((i0.u20.QueueJobE_1<1)...186
Formula 0 simplified : FG!"((((i0.u20.QueueJobE_3<1)&&(i0.u20.QueueJobE_2<1))&&((i0.u20.QueueJobE_5<1)&&(i0.u20.QueueJobE_4<1)))&&((i0.u20.QueueJobE_1<1)&&...180
Compilation finished in 2930 ms.
Running link step : cd /tmp/ltsmin11830953217688522222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11830953217688522222;'/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'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11830953217688522222;'/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'
Running LTSmin : cd /tmp/ltsmin11830953217688522222;'/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' '--ltl' 'X(((<>((LTLAPp1==true)) U (LTLAPp2==true))&&<>(((LTLAPp3==true)||X((LTLAPp4==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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-S02J06T06"
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-S02J06T06, 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-174881253700292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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 ;