About the Execution of ITS-Tools for DoubleLock-PT-p3s2
| 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 | FF?FTFFTFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067700572.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 DoubleLock-PT-p3s2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067700572
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 330K 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 DoubleLock-PT-p3s2-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p3s2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748781829781
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 12:43:51] [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-01 12:43:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 12:43:51] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-01 12:43:51] [INFO ] Transformed 112 places.
[2025-06-01 12:43:51] [INFO ] Transformed 744 transitions.
[2025-06-01 12:43:51] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 32 transitions.
FORMULA DoubleLock-PT-p3s2-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 712/712 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 712
Applied a total of 3 rules in 19 ms. Remains 89 /92 variables (removed 3) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:43:51] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2025-06-01 12:43:51] [INFO ] Computed 2 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:43:51] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-01 12:43:51] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:43:51] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:43:52] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:43:52] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:43:52] [INFO ] Invariant cache hit.
[2025-06-01 12:43:52] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56693ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56710ms
Starting structural reductions in LTL mode, iteration 1 : 89/92 places, 712/712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57257 ms. Remains : 89/92 places, 712/712 transitions.
Support contains 49 out of 89 places after structural reductions.
[2025-06-01 12:44:49] [INFO ] Flatten gal took : 76 ms
[2025-06-01 12:44:49] [INFO ] Flatten gal took : 42 ms
[2025-06-01 12:44:49] [INFO ] Input system was already deterministic with 712 transitions.
Support contains 47 out of 89 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40017 steps (470 resets) in 1092 ms. (36 steps per ms) remains 15/31 properties
BEST_FIRST walk for 4004 steps (10 resets) in 37 ms. (105 steps per ms) remains 12/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 62 ms. (63 steps per ms) remains 8/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4002 steps (8 resets) in 7 ms. (500 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 6/6 properties
[2025-06-01 12:44:49] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:44:49] [INFO ] Invariant cache hit.
[2025-06-01 12:44:49] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 450/501 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 8 (OVERLAPS) 103/604 variables, 38/111 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 27/138 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 2 solved, 4 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/38 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 329/367 variables, 38/39 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 12/51 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 223/590 variables, 37/88 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 1/89 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 35/124 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 4/128 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 12:44:50] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/590 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 12 (OVERLAPS) 14/604 variables, 14/143 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/604 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/604 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 143 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1852ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 1 properties in 384 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 712/712 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 89 transition count 705
Applied a total of 7 rules in 29 ms. Remains 89 /89 variables (removed 0) and now considering 705/712 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 89/89 places, 705/712 transitions.
RANDOM walk for 40004 steps (460 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (88 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1082719 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 1
Probabilistic random walk after 1082719 steps, saw 821510 distinct states, run finished after 3005 ms. (steps per millisecond=360 ) properties seen :0
[2025-06-01 12:44:55] [INFO ] Flow matrix only has 508 transitions (discarded 197 similar events)
// Phase 1: matrix 508 rows 89 cols
[2025-06-01 12:44:55] [INFO ] Computed 2 invariants in 8 ms
[2025-06-01 12:44:55] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 521/576 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 47/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/582 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/597 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/597 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 521/576 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 47/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 12:44:55] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/582 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/597 variables, 15/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/597 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/597 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 705/705 transitions.
Applied a total of 0 rules in 21 ms. Remains 89 /89 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 89/89 places, 705/705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 705/705 transitions.
Applied a total of 0 rules in 14 ms. Remains 89 /89 variables (removed 0) and now considering 705/705 (removed 0) transitions.
[2025-06-01 12:44:55] [INFO ] Flow matrix only has 508 transitions (discarded 197 similar events)
[2025-06-01 12:44:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:44:55] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-01 12:44:55] [INFO ] Flow matrix only has 508 transitions (discarded 197 similar events)
[2025-06-01 12:44:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:44:56] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:44:56] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:44:56] [INFO ] Redundant transitions in 42 ms returned []
Running 703 sub problems to find dead transitions.
[2025-06-01 12:44:56] [INFO ] Flow matrix only has 508 transitions (discarded 197 similar events)
[2025-06-01 12:44:56] [INFO ] Invariant cache hit.
[2025-06-01 12:44:56] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 508/597 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 6 (OVERLAPS) 0/597 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 703 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 138 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 508/597 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 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 TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 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 TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 703/841 constraints. Problems are: Problem set: 144 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/597 variables, and 841 constraints, problems are : Problem set: 144 solved, 559 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 144 solved, 559 unsolved
Search for dead transitions found 144 dead transitions in 60334ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/89 places, 561/705 transitions.
Graph (complete) has 966 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 81 /89 variables (removed 8) and now considering 561/561 (removed 0) transitions.
[2025-06-01 12:45:56] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
// Phase 1: matrix 382 rows 81 cols
[2025-06-01 12:45:56] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:45:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-01 12:45:56] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2025-06-01 12:45:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:45:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-01 12:45:57] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/89 places, 561/705 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61230 ms. Remains : 81/89 places, 561/705 transitions.
RANDOM walk for 40001 steps (471 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (91 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1233709 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :0 out of 1
Probabilistic random walk after 1233709 steps, saw 888099 distinct states, run finished after 3002 ms. (steps per millisecond=410 ) properties seen :0
[2025-06-01 12:46:00] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2025-06-01 12:46:00] [INFO ] Invariant cache hit.
[2025-06-01 12:46:00] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 386/426 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 41/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/463 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/463 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 386/426 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 41/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/463 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 12:46:00] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/463 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 562ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 561/561 transitions.
Applied a total of 0 rules in 13 ms. Remains 81 /81 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 81/81 places, 561/561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 561/561 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2025-06-01 12:46:00] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2025-06-01 12:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:46:00] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-01 12:46:00] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2025-06-01 12:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:46:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-01 12:46:01] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:46:01] [INFO ] Redundant transitions in 5 ms returned []
Running 559 sub problems to find dead transitions.
[2025-06-01 12:46:01] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2025-06-01 12:46:01] [INFO ] Invariant cache hit.
[2025-06-01 12:46:01] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 382/463 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 559 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (OVERLAPS) 0/463 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 559 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 123 constraints, problems are : Problem set: 0 solved, 559 unsolved in 11284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 559 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 382/463 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 559/682 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 682 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41500ms problems are : Problem set: 0 solved, 559 unsolved
Search for dead transitions found 0 dead transitions in 41502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41944 ms. Remains : 81/81 places, 561/561 transitions.
FORMULA DoubleLock-PT-p3s2-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA DoubleLock-PT-p3s2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 176 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' '!(F(p0))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 21 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:46:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2025-06-01 12:46:43] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:46:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-01 12:46:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:46:43] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:46:43] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:46:43] [INFO ] Redundant transitions in 11 ms returned []
Running 710 sub problems to find dead transitions.
[2025-06-01 12:46:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:46:43] [INFO ] Invariant cache hit.
[2025-06-01 12:46:43] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56609ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56611ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57035 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-00
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 5 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-00 finished in 57236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((X(X(X(p1)))||(!p1 U (p2||G(!p1))))))))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:47:40] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:47:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-01 12:47:40] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:47:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:47:40] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:47:40] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:47:40] [INFO ] Invariant cache hit.
[2025-06-01 12:47:40] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56387ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56389ms
Finished structural reductions in LTL mode , in 1 iterations and 56769 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 467 ms :[(NOT p0), (NOT p0), true, (NOT p1), false, false, (NOT p1), (NOT p1), false, false, (AND (NOT p2) p1)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-01
Entered a terminal (fully accepting) state of product in 507 steps with 10 reset in 9 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-01 finished in 57267 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(((X(!p0)&&(p1||G(p2)))||G(!p0))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:48:37] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:48:37] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 12:48:37] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:48:37] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:48:37] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:48:37] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:48:37] [INFO ] Invariant cache hit.
[2025-06-01 12:48:37] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26077 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56333ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56335ms
Finished structural reductions in LTL mode , in 1 iterations and 56716 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 190 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-02
Product exploration explored 100000 steps with 1970 reset in 423 ms.
Product exploration explored 100000 steps with 1946 reset in 337 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 136 ms. Reduced automaton from 4 states, 21 edges and 3 AP (stutter sensitive) to 4 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40002 steps (460 resets) in 171 ms. (232 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (102 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (101 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (103 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (102 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (89 resets) in 72 ms. (547 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (92 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
[2025-06-01 12:49:35] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:49:35] [INFO ] Invariant cache hit.
[2025-06-01 12:49:35] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 32/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 438/485 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 8 (OVERLAPS) 119/604 variables, 42/107 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 31/138 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 5 solved, 2 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/47 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 438/485 variables, 47/49 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 16/65 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/65 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 119/604 variables, 42/107 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 31/138 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 2/140 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/140 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/140 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 140 constraints, problems are : Problem set: 5 solved, 2 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 712/712 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 89 transition count 705
Applied a total of 7 rules in 11 ms. Remains 89 /89 variables (removed 0) and now considering 705/712 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 89/89 places, 705/712 transitions.
RANDOM walk for 40002 steps (465 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (87 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 487890 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 2
Probabilistic random walk after 487890 steps, saw 342942 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2025-06-01 12:49:39] [INFO ] Flow matrix only has 508 transitions (discarded 197 similar events)
// Phase 1: matrix 508 rows 89 cols
[2025-06-01 12:49:39] [INFO ] Computed 2 invariants in 9 ms
[2025-06-01 12:49:39] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 438/485 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 112/597 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 31/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/597 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 138 constraints, problems are : Problem set: 0 solved, 2 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 438/485 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 112/597 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 31/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/597 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 140 constraints, problems are : Problem set: 0 solved, 2 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 640ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 705/705 transitions.
Applied a total of 0 rules in 13 ms. Remains 89 /89 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 89/89 places, 705/705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 705/705 transitions.
Applied a total of 0 rules in 9 ms. Remains 89 /89 variables (removed 0) and now considering 705/705 (removed 0) transitions.
[2025-06-01 12:49:40] [INFO ] Flow matrix only has 508 transitions (discarded 197 similar events)
[2025-06-01 12:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:49:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-01 12:49:40] [INFO ] Flow matrix only has 508 transitions (discarded 197 similar events)
[2025-06-01 12:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:49:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:49:40] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:49:40] [INFO ] Redundant transitions in 5 ms returned []
Running 703 sub problems to find dead transitions.
[2025-06-01 12:49:40] [INFO ] Flow matrix only has 508 transitions (discarded 197 similar events)
[2025-06-01 12:49:40] [INFO ] Invariant cache hit.
[2025-06-01 12:49:40] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 508/597 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/597 variables, and 138 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 508/597 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 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 TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 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 TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 703/841 constraints. Problems are: Problem set: 144 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/597 variables, and 841 constraints, problems are : Problem set: 144 solved, 559 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 144 solved, 559 unsolved
Search for dead transitions found 144 dead transitions in 60293ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/89 places, 561/705 transitions.
Graph (complete) has 966 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 81 /89 variables (removed 8) and now considering 561/561 (removed 0) transitions.
[2025-06-01 12:50:41] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
// Phase 1: matrix 382 rows 81 cols
[2025-06-01 12:50:41] [INFO ] Computed 1 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:50:41] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 12:50:41] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2025-06-01 12:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:50:41] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-01 12:50:41] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/89 places, 561/705 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61046 ms. Remains : 81/89 places, 561/705 transitions.
RANDOM walk for 32055 steps (377 resets) in 86 ms. (368 steps per ms) remains 0/2 properties
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) (NOT p1)))), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F p2), (F p0)]
Knowledge based reduction with 32 factoid took 376 ms. Reduced automaton from 4 states, 21 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Support contains 4 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:50:42] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2025-06-01 12:50:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:50:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 12:50:42] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:50:42] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:50:42] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:50:42] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:50:42] [INFO ] Invariant cache hit.
[2025-06-01 12:50:42] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25599 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55896ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 55898ms
Finished structural reductions in LTL mode , in 1 iterations and 56261 ms. Remains : 89/89 places, 712/712 transitions.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
RANDOM walk for 13181 steps (151 resets) in 37 ms. (346 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Product exploration explored 100000 steps with 1950 reset in 287 ms.
Product exploration explored 100000 steps with 1980 reset in 300 ms.
Built C files in :
/tmp/ltsmin2568269661846051024
[2025-06-01 12:51:40] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2568269661846051024
Running compilation step : cd /tmp/ltsmin2568269661846051024;'/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 1145 ms.
Running link step : cd /tmp/ltsmin2568269661846051024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2568269661846051024;'/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/stateBased13410234927011827591.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:51:55] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:51:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-01 12:51:55] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:51:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:51:55] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:51:55] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:51:55] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:51:55] [INFO ] Invariant cache hit.
[2025-06-01 12:51:55] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55782ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 55789ms
Finished structural reductions in LTL mode , in 1 iterations and 56182 ms. Remains : 89/89 places, 712/712 transitions.
Built C files in :
/tmp/ltsmin2566920158626738075
[2025-06-01 12:52:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2566920158626738075
Running compilation step : cd /tmp/ltsmin2566920158626738075;'/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 1029 ms.
Running link step : cd /tmp/ltsmin2566920158626738075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2566920158626738075;'/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/stateBased9274175877967632005.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:53:06] [INFO ] Flatten gal took : 43 ms
[2025-06-01 12:53:06] [INFO ] Flatten gal took : 30 ms
[2025-06-01 12:53:06] [INFO ] Time to serialize gal into /tmp/LTL13913594992155103850.gal : 7 ms
[2025-06-01 12:53:06] [INFO ] Time to serialize properties into /tmp/LTL16670917250535921712.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/LTL13913594992155103850.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15038264652408437009.hoa' '-atoms' '/tmp/LTL16670917250535921712.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16670917250535921712.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15038264652408437009.hoa
Detected timeout of ITS tools.
[2025-06-01 12:53:21] [INFO ] Flatten gal took : 28 ms
[2025-06-01 12:53:21] [INFO ] Flatten gal took : 25 ms
[2025-06-01 12:53:21] [INFO ] Time to serialize gal into /tmp/LTL32599136774074278.gal : 5 ms
[2025-06-01 12:53:21] [INFO ] Time to serialize properties into /tmp/LTL14849059283509035298.ltl : 7 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/LTL32599136774074278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14849059283509035298.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F((G("((s1<1)||(l20<1))"))||((X("((s1<1)||(l20<1))"))&&((G("((s8>=1)&&(l26>=1))"))||("((p46>=1)&&(l23>=1))"))))))
Formula 0 simplified : G(F!"((s1<1)||(l20<1))" & (X!"((s1<1)||(l20<1))" | (!"((p46>=1)&&(l23>=1))" & F!"((s8>=1)&&(l26>=1))")))
Detected timeout of ITS tools.
[2025-06-01 12:53:36] [INFO ] Flatten gal took : 32 ms
[2025-06-01 12:53:36] [INFO ] Applying decomposition
[2025-06-01 12:53:36] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2195752323355897783.txt' '-o' '/tmp/graph2195752323355897783.bin' '-w' '/tmp/graph2195752323355897783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2195752323355897783.bin' '-l' '-1' '-v' '-w' '/tmp/graph2195752323355897783.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:53:37] [INFO ] Decomposing Gal with order
[2025-06-01 12:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:53:37] [INFO ] Removed a total of 1644 redundant transitions.
[2025-06-01 12:53:37] [INFO ] Flatten gal took : 107 ms
[2025-06-01 12:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 31 ms.
[2025-06-01 12:53:37] [INFO ] Time to serialize gal into /tmp/LTL15433834473285868512.gal : 15 ms
[2025-06-01 12:53:37] [INFO ] Time to serialize properties into /tmp/LTL13336117493748387816.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/LTL15433834473285868512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13336117493748387816.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i5.u7.s1<1)||(i3.i2.u31.l20<1))"))||((X("((i5.u7.s1<1)||(i3.i2.u31.l20<1))"))&&((G("((i3.i0.u4.s8>=1)&&(i5.u25.l26>=1))"))|...201
Formula 0 simplified : G(F!"((i5.u7.s1<1)||(i3.i2.u31.l20<1))" & (X!"((i5.u7.s1<1)||(i3.i2.u31.l20<1))" | (!"((i0.u6.p46>=1)&&(i3.i2.u23.l23>=1))" & F!"((i...191
Detected timeout of ITS tools.
Treatment of property DoubleLock-PT-p3s2-LTLFireability-02 finished in 314927 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 (G(!p0)||(!p0&&(X(X(!p1)) U ((!p2&&X(X(!p1)))||X(X(G(!p1))))))))) U (X(!p0)&&p3)))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:53:52] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:53:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:53:52] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-01 12:53:52] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:53:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:53:52] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:53:52] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:53:52] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:53:52] [INFO ] Invariant cache hit.
[2025-06-01 12:53:52] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55930ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 55933ms
Finished structural reductions in LTL mode , in 1 iterations and 56343 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 579 ms :[(OR (NOT p3) p0), p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0, (AND p0 p3), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-03
Product exploration explored 100000 steps with 24985 reset in 191 ms.
Product exploration explored 100000 steps with 24947 reset in 191 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p3 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND p3 p0))), (X (AND (NOT p3) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 262 ms. Reduced automaton from 13 states, 50 edges and 4 AP (stutter sensitive) to 13 states, 50 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 544 ms :[(OR (NOT p3) p0), p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0, (AND p0 p3), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Reduction of identical properties reduced properties to check from 20 to 13
RANDOM walk for 40007 steps (481 resets) in 112 ms. (354 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (100 resets) in 45 ms. (869 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (125 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (112 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (134 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (117 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
[2025-06-01 12:54:50] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:54:50] [INFO ] Invariant cache hit.
[2025-06-01 12:54:50] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 406/451 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf18 is UNSAT
After SMT solving in domain Real declared 602/604 variables, and 103 constraints, problems are : Problem set: 4 solved, 0 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/89 constraints, ReadFeed: 14/47 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p3 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT p3)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND p3 p0))), (X (AND (NOT p3) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p3)))]
False Knowledge obtained : [(F p3), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR p0 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) p3)))]
Knowledge based reduction with 37 factoid took 841 ms. Reduced automaton from 13 states, 50 edges and 4 AP (stutter sensitive) to 10 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[(OR (NOT p3) p0), p0, (AND p0 p1), (AND p0 p1), p0, (AND p0 p2 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p3) p0), p0, (AND p0 p1), (AND p0 p1), p0, (AND p0 p2 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
[2025-06-01 12:54:52] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:54:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 12:54:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 12:54:53] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-06-01 12:54:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:54:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 12:54:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 12:54:53] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-06-01 12:54:53] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:54:53] [INFO ] [Nat]Added 47 Read/Feed constraints in 20 ms returned sat
[2025-06-01 12:54:53] [INFO ] Computed and/alt/rep : 67/387/67 causal constraints (skipped 446 transitions) in 45 ms.
[2025-06-01 12:54:53] [INFO ] Added : 0 causal constraints over 0 iterations in 102 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:54:53] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:54:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:54:53] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-01 12:54:53] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:54:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:54:53] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:54:53] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:54:53] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:54:53] [INFO ] Invariant cache hit.
[2025-06-01 12:54:53] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 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 TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 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 TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 144 solved, 566 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56379ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 56382ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 89/89 places, 568/712 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 81 transition count 568
Applied a total of 8 rules in 3 ms. Remains 81 /89 variables (removed 8) and now considering 568/568 (removed 0) transitions.
[2025-06-01 12:55:50] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2025-06-01 12:55:50] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:55:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 12:55:50] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2025-06-01 12:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:55:50] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-01 12:55:50] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 81/89 places, 568/712 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57176 ms. Remains : 81/89 places, 568/712 transitions.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p3))), (X (NOT p3)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 260 ms. Reduced automaton from 10 states, 33 edges and 4 AP (stutter sensitive) to 10 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p3) p0), p0, (AND p0 p1), (AND p0 p1), p0, (AND p0 p2 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 40016 steps (460 resets) in 119 ms. (333 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40003 steps (101 resets) in 29 ms. (1333 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (120 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2025-06-01 12:55:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2025-06-01 12:55:51] [INFO ] Invariant cache hit.
[2025-06-01 12:55:51] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 161/174 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 463/470 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 76/81 constraints, ReadFeed: 2/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p3))), (X (NOT p3)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p3), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F p1), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 26 factoid took 819 ms. Reduced automaton from 10 states, 33 edges and 4 AP (stutter sensitive) to 10 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p3) p0), p0, (AND p0 p1), (AND p0 p1), p0, (AND p0 p2 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p3) p0), p0, (AND p0 p1), (AND p0 p1), p0, (AND p0 p2 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
[2025-06-01 12:55:53] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2025-06-01 12:55:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:55:53] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 12:55:53] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-01 12:55:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:55:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 12:55:53] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-01 12:55:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-01 12:55:53] [INFO ] [Nat]Added 41 Read/Feed constraints in 23 ms returned sat
[2025-06-01 12:55:53] [INFO ] Computed and/alt/rep : 23/67/23 causal constraints (skipped 364 transitions) in 34 ms.
[2025-06-01 12:55:53] [INFO ] Added : 0 causal constraints over 0 iterations in 77 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p3) p0), p0, (AND p0 p1), (AND p0 p1), p0, (AND p0 p2 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 24954 reset in 176 ms.
Product exploration explored 100000 steps with 25045 reset in 203 ms.
Built C files in :
/tmp/ltsmin18376470038152053150
[2025-06-01 12:55:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18376470038152053150
Running compilation step : cd /tmp/ltsmin18376470038152053150;'/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 805 ms.
Running link step : cd /tmp/ltsmin18376470038152053150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18376470038152053150;'/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/stateBased14800222232376169108.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleLock-PT-p3s2-LTLFireability-03 finished in 123385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 14 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:55:55] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2025-06-01 12:55:55] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:55:55] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 12:55:55] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:55:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:55:55] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:55:56] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:55:56] [INFO ] Redundant transitions in 11 ms returned []
Running 710 sub problems to find dead transitions.
[2025-06-01 12:55:56] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:55:56] [INFO ] Invariant cache hit.
[2025-06-01 12:55:56] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26064 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 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 TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 53 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 53 solved, 657 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56374ms problems are : Problem set: 53 solved, 657 unsolved
Search for dead transitions found 53 dead transitions in 56375ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 89/89 places, 659/712 transitions.
Graph (complete) has 1232 edges and 89 vertex of which 86 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 86 /89 variables (removed 3) and now considering 659/659 (removed 0) transitions.
[2025-06-01 12:56:52] [INFO ] Flow matrix only has 471 transitions (discarded 188 similar events)
// Phase 1: matrix 471 rows 86 cols
[2025-06-01 12:56:52] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:56:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 12:56:52] [INFO ] Flow matrix only has 471 transitions (discarded 188 similar events)
[2025-06-01 12:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:56:52] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:56:52] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/89 places, 659/712 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57173 ms. Remains : 86/89 places, 659/712 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-06
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-06 finished in 57217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (G((G(p1)||X(F(!p0))))||(!p2&&(G(p1)||X(F(!p0)))))))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:56:53] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2025-06-01 12:56:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:56:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 12:56:53] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:56:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:56:53] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:56:53] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:56:53] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:56:53] [INFO ] Invariant cache hit.
[2025-06-01 12:56:53] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55495ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 55498ms
Finished structural reductions in LTL mode , in 1 iterations and 55854 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 19 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p3s2-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s2-LTLFireability-07 finished in 56293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&(p2 U X(p3))))'
Support contains 8 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:57:49] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:57:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 12:57:49] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:57:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:57:49] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:57:49] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:57:49] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:57:49] [INFO ] Invariant cache hit.
[2025-06-01 12:57:49] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 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
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 49 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 49 solved, 661 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56672ms problems are : Problem set: 49 solved, 661 unsolved
Search for dead transitions found 49 dead transitions in 56673ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in LTL mode, iteration 1 : 89/89 places, 663/712 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 86 transition count 663
Applied a total of 3 rules in 2 ms. Remains 86 /89 variables (removed 3) and now considering 663/663 (removed 0) transitions.
[2025-06-01 12:58:46] [INFO ] Flow matrix only has 473 transitions (discarded 190 similar events)
// Phase 1: matrix 473 rows 86 cols
[2025-06-01 12:58:46] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:58:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-01 12:58:46] [INFO ] Flow matrix only has 473 transitions (discarded 190 similar events)
[2025-06-01 12:58:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:58:46] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:58:46] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 86/89 places, 663/712 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57497 ms. Remains : 86/89 places, 663/712 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p3) (NOT p1)), (NOT p1), (NOT p3), (NOT p3), true]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-10 finished in 57670 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)))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:58:47] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2025-06-01 12:58:47] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:58:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-01 12:58:47] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:58:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:58:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:58:47] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 12:58:47] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:58:47] [INFO ] Invariant cache hit.
[2025-06-01 12:58:47] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56354ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56356ms
Finished structural reductions in LTL mode , in 1 iterations and 56756 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-11
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-11 finished in 56849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 13 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 12:59:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:59:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:59:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-01 12:59:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:59:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:59:44] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 12:59:44] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:59:44] [INFO ] Redundant transitions in 9 ms returned []
Running 710 sub problems to find dead transitions.
[2025-06-01 12:59:44] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 12:59:44] [INFO ] Invariant cache hit.
[2025-06-01 12:59:44] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25932 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56233ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56235ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56621 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-12
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-12 finished in 56664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))&&F(p1)))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 13:00:40] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:00:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 13:00:40] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:00:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 13:00:40] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 13:00:40] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:00:40] [INFO ] Invariant cache hit.
[2025-06-01 13:00:40] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25687 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55964ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 55966ms
Finished structural reductions in LTL mode , in 1 iterations and 56357 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-13
Entered a terminal (fully accepting) state of product in 18490 steps with 330 reset in 58 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-13 finished in 56621 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(X(G(p1)))))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 13:01:37] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:01:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:01:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-01 13:01:37] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:01:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:01:37] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 13:01:37] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 13:01:37] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:01:37] [INFO ] Invariant cache hit.
[2025-06-01 13:01:37] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56288ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56290ms
Finished structural reductions in LTL mode , in 1 iterations and 56666 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-14
Stuttering criterion allowed to conclude after 1984 steps with 39 reset in 9 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-14 finished in 56886 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(G(p0))))))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 13:02:34] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:02:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:02:34] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 13:02:34] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:02:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:02:34] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 13:02:34] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 13:02:34] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:02:34] [INFO ] Invariant cache hit.
[2025-06-01 13:02:34] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26333 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56618ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56621ms
Finished structural reductions in LTL mode , in 1 iterations and 57021 ms. Remains : 89/89 places, 712/712 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-15 finished in 57230 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(((X(!p0)&&(p1||G(p2)))||G(!p0))))'
Found a Shortening insensitive property : DoubleLock-PT-p3s2-LTLFireability-02
Stuttering acceptance computed with spot in 148 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 13:03:31] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:03:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:03:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-01 13:03:31] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:03:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:03:31] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 13:03:31] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 13:03:31] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:03:31] [INFO ] Invariant cache hit.
[2025-06-01 13:03:31] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55790ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 55791ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 56172 ms. Remains : 89/89 places, 712/712 transitions.
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-02
Product exploration explored 100000 steps with 1975 reset in 336 ms.
Product exploration explored 100000 steps with 1944 reset in 368 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 135 ms. Reduced automaton from 4 states, 21 edges and 3 AP (stutter sensitive) to 4 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40008 steps (465 resets) in 136 ms. (292 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (86 resets) in 43 ms. (909 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (96 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (106 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (105 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (101 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (85 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (93 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
[2025-06-01 13:04:28] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:04:28] [INFO ] Invariant cache hit.
[2025-06-01 13:04:28] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 32/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 438/485 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 8 (OVERLAPS) 119/604 variables, 42/107 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 31/138 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 5 solved, 2 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/47 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 438/485 variables, 47/49 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 16/65 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/65 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 119/604 variables, 42/107 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 31/138 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 2/140 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/140 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/140 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 140 constraints, problems are : Problem set: 5 solved, 2 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 695ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 160 ms.
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 712/712 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 89 transition count 705
Applied a total of 7 rules in 16 ms. Remains 89 /89 variables (removed 0) and now considering 705/712 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 89/89 places, 705/712 transitions.
RANDOM walk for 35238 steps (419 resets) in 62 ms. (559 steps per ms) remains 0/2 properties
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) (NOT p1)))), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F p2), (F p0)]
Knowledge based reduction with 32 factoid took 433 ms. Reduced automaton from 4 states, 21 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Support contains 4 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 13:04:30] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:04:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 13:04:30] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:04:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 13:04:30] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 13:04:30] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:04:30] [INFO ] Invariant cache hit.
[2025-06-01 13:04:30] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 25612 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55951ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 55953ms
Finished structural reductions in LTL mode , in 1 iterations and 56311 ms. Remains : 89/89 places, 712/712 transitions.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 77 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
RANDOM walk for 16390 steps (189 resets) in 28 ms. (565 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Product exploration explored 100000 steps with 1939 reset in 258 ms.
Product exploration explored 100000 steps with 1964 reset in 280 ms.
Built C files in :
/tmp/ltsmin8464064093378714995
[2025-06-01 13:05:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8464064093378714995
Running compilation step : cd /tmp/ltsmin8464064093378714995;'/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 1030 ms.
Running link step : cd /tmp/ltsmin8464064093378714995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8464064093378714995;'/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/stateBased8401367213445988354.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 712/712 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2025-06-01 13:05:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:05:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-01 13:05:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:05:43] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 13:05:43] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2025-06-01 13:05:43] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2025-06-01 13:05:43] [INFO ] Invariant cache hit.
[2025-06-01 13:05:43] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 26388 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56714ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 56716ms
Finished structural reductions in LTL mode , in 1 iterations and 57101 ms. Remains : 89/89 places, 712/712 transitions.
Built C files in :
/tmp/ltsmin1985783647919466328
[2025-06-01 13:06:40] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1985783647919466328
Running compilation step : cd /tmp/ltsmin1985783647919466328;'/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 1034 ms.
Running link step : cd /tmp/ltsmin1985783647919466328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1985783647919466328;'/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/stateBased8748583405244493592.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 13:06:55] [INFO ] Flatten gal took : 20 ms
[2025-06-01 13:06:55] [INFO ] Flatten gal took : 20 ms
[2025-06-01 13:06:55] [INFO ] Time to serialize gal into /tmp/LTL12571636971164257666.gal : 4 ms
[2025-06-01 13:06:55] [INFO ] Time to serialize properties into /tmp/LTL3420115825775898683.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/LTL12571636971164257666.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6224631952986063622.hoa' '-atoms' '/tmp/LTL3420115825775898683.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/LTL3420115825775898683.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6224631952986063622.hoa
Detected timeout of ITS tools.
[2025-06-01 13:07:10] [INFO ] Flatten gal took : 19 ms
[2025-06-01 13:07:10] [INFO ] Flatten gal took : 19 ms
[2025-06-01 13:07:10] [INFO ] Time to serialize gal into /tmp/LTL9327207180722325150.gal : 4 ms
[2025-06-01 13:07:10] [INFO ] Time to serialize properties into /tmp/LTL15417909933355132470.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/LTL9327207180722325150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15417909933355132470.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 : !((F((G("((s1<1)||(l20<1))"))||((X("((s1<1)||(l20<1))"))&&((G("((s8>=1)&&(l26>=1))"))||("((p46>=1)&&(l23>=1))"))))))
Formula 0 simplified : G(F!"((s1<1)||(l20<1))" & (X!"((s1<1)||(l20<1))" | (!"((p46>=1)&&(l23>=1))" & F!"((s8>=1)&&(l26>=1))")))
Detected timeout of ITS tools.
[2025-06-01 13:07:25] [INFO ] Flatten gal took : 39 ms
[2025-06-01 13:07:25] [INFO ] Applying decomposition
[2025-06-01 13:07:25] [INFO ] Flatten gal took : 20 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/graph17368807626921850040.txt' '-o' '/tmp/graph17368807626921850040.bin' '-w' '/tmp/graph17368807626921850040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17368807626921850040.bin' '-l' '-1' '-v' '-w' '/tmp/graph17368807626921850040.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:07:25] [INFO ] Decomposing Gal with order
[2025-06-01 13:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:07:25] [INFO ] Removed a total of 1644 redundant transitions.
[2025-06-01 13:07:25] [INFO ] Flatten gal took : 45 ms
[2025-06-01 13:07:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 17 ms.
[2025-06-01 13:07:25] [INFO ] Time to serialize gal into /tmp/LTL11309230528020106575.gal : 3 ms
[2025-06-01 13:07:25] [INFO ] Time to serialize properties into /tmp/LTL9891241598918418464.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/LTL11309230528020106575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9891241598918418464.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 : !((F((G("((i4.u0.s1<1)||(i0.i1.u23.l20<1))"))||((X("((i4.u0.s1<1)||(i0.i1.u23.l20<1))"))&&((G("((i0.u13.s8>=1)&&(i4.u26.l26>=1))"))||(...202
Formula 0 simplified : G(F!"((i4.u0.s1<1)||(i0.i1.u23.l20<1))" & (X!"((i4.u0.s1<1)||(i0.i1.u23.l20<1))" | (!"((i2.i0.u7.p46>=1)&&(i0.i1.u24.l23>=1))" & F!"...192
Detected timeout of ITS tools.
Treatment of property DoubleLock-PT-p3s2-LTLFireability-02 finished in 249614 ms.
[2025-06-01 13:07:40] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15303438730214621794
[2025-06-01 13:07:40] [INFO ] Applying decomposition
[2025-06-01 13:07:40] [INFO ] Computing symmetric may disable matrix : 712 transitions.
[2025-06-01 13:07:40] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:07:40] [INFO ] Computing symmetric may enable matrix : 712 transitions.
[2025-06-01 13:07:40] [INFO ] Flatten gal took : 23 ms
[2025-06-01 13:07:40] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph12940010817208404641.txt' '-o' '/tmp/graph12940010817208404641.bin' '-w' '/tmp/graph12940010817208404641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12940010817208404641.bin' '-l' '-1' '-v' '-w' '/tmp/graph12940010817208404641.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:07:40] [INFO ] Decomposing Gal with order
[2025-06-01 13:07:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:07:41] [INFO ] Removed a total of 1644 redundant transitions.
[2025-06-01 13:07:41] [INFO ] Flatten gal took : 41 ms
[2025-06-01 13:07:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 9 ms.
[2025-06-01 13:07:41] [INFO ] Time to serialize gal into /tmp/LTLFireability17159837456345079342.gal : 3 ms
[2025-06-01 13:07:41] [INFO ] Time to serialize properties into /tmp/LTLFireability11518652738765914379.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/LTLFireability17159837456345079342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11518652738765914379.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...278
Read 1 LTL properties
[2025-06-01 13:07:41] [INFO ] Computing Do-Not-Accords matrix : 712 transitions.
Checking formula 0 : !((F(((X(!("((i5.u1.s1>=1)&&(i0.i2.u31.l20>=1))")))&&(("((i3.i0.u8.p46>=1)&&(i0.i2.u23.l23>=1))")||(G("((i0.i0.u5.s8>=1)&&(i5.u25.l26>...214
Formula 0 simplified : G(F"((i5.u1.s1>=1)&&(i0.i2.u31.l20>=1))" & (X"((i5.u1.s1>=1)&&(i0.i2.u31.l20>=1))" | (!"((i3.i0.u8.p46>=1)&&(i0.i2.u23.l23>=1))" & F...196
[2025-06-01 13:07:41] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:07:41] [INFO ] Built C files in 215ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15303438730214621794
Running compilation step : cd /tmp/ltsmin15303438730214621794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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 1755 ms.
Running link step : cd /tmp/ltsmin15303438730214621794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15303438730214621794;'/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(!(LTLAPp0==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.057: LTL layer: formula: <>(((X(!(LTLAPp0==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))||[](!(LTLAPp0==true))))
pins2lts-mc-linux64( 7/ 8), 0.057: "<>(((X(!(LTLAPp0==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))||[](!(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.057: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.124: There are 716 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.124: State length is 90, there are 751 groups
pins2lts-mc-linux64( 0/ 8), 0.124: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.124: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.124: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.124: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.169: [Blue] ~116 levels ~960 states ~3664 transitions
pins2lts-mc-linux64( 1/ 8), 0.212: [Blue] ~236 levels ~1920 states ~6784 transitions
pins2lts-mc-linux64( 1/ 8), 0.286: [Blue] ~476 levels ~3840 states ~13024 transitions
pins2lts-mc-linux64( 4/ 8), 0.405: [Blue] ~439 levels ~7680 states ~19096 transitions
pins2lts-mc-linux64( 4/ 8), 0.601: [Blue] ~823 levels ~15360 states ~35224 transitions
pins2lts-mc-linux64( 4/ 8), 0.928: [Blue] ~1591 levels ~30720 states ~67480 transitions
pins2lts-mc-linux64( 4/ 8), 1.472: [Blue] ~3127 levels ~61440 states ~131992 transitions
pins2lts-mc-linux64( 4/ 8), 2.424: [Blue] ~6199 levels ~122880 states ~261016 transitions
pins2lts-mc-linux64( 4/ 8), 4.030: [Blue] ~12343 levels ~245760 states ~519064 transitions
pins2lts-mc-linux64( 4/ 8), 6.740: [Blue] ~24631 levels ~491520 states ~1035160 transitions
pins2lts-mc-linux64( 3/ 8), 11.843: [Blue] ~98354 levels ~983040 states ~3149064 transitions
pins2lts-mc-linux64( 3/ 8), 21.984: [Blue] ~196658 levels ~1966080 states ~6294792 transitions
pins2lts-mc-linux64( 3/ 8), 43.404: [Blue] ~393266 levels ~3932160 states ~12586248 transitions
pins2lts-mc-linux64( 4/ 8), 46.042: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 46.180:
pins2lts-mc-linux64( 0/ 8), 46.180: Explored 3862813 states 13066761 transitions, fanout: 3.383
pins2lts-mc-linux64( 0/ 8), 46.180: Total exploration time 46.050 sec (45.920 sec minimum, 45.970 sec on average)
pins2lts-mc-linux64( 0/ 8), 46.180: States per second: 83883, Transitions per second: 283752
pins2lts-mc-linux64( 0/ 8), 46.180:
pins2lts-mc-linux64( 0/ 8), 46.180: State space has 12456590 states, 117046 are accepting
pins2lts-mc-linux64( 0/ 8), 46.180: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 46.180: blue states: 3862813 (31.01%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 46.180: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 46.180: all-red states: 234092 (1.88%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 46.180:
pins2lts-mc-linux64( 0/ 8), 46.180: Total memory used for local state coloring: 46.1MB
pins2lts-mc-linux64( 0/ 8), 46.180:
pins2lts-mc-linux64( 0/ 8), 46.180: Queue width: 8B, total height: 3019275, memory: 23.04MB
pins2lts-mc-linux64( 0/ 8), 46.180: Tree memory: 351.0MB, 29.5 B/state, compr.: 8.2%
pins2lts-mc-linux64( 0/ 8), 46.180: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 46.180: Stored 722 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 46.180: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 46.180: Est. total memory use: 374.1MB (~1047.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15303438730214621794;'/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(!(LTLAPp0==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15303438730214621794;'/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(!(LTLAPp0==true))&&((LTLAPp1==true)||[]((LTLAPp2==true))))||[](!(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 13:35:37] [INFO ] Flatten gal took : 16 ms
[2025-06-01 13:35:37] [INFO ] Time to serialize gal into /tmp/LTLFireability11446312852760217503.gal : 7 ms
[2025-06-01 13:35:37] [INFO ] Time to serialize properties into /tmp/LTLFireability8191111501868589390.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/LTLFireability11446312852760217503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8191111501868589390.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...298
Read 1 LTL properties
Checking formula 0 : !((F(((X(!("((s1>=1)&&(l20>=1))")))&&(("((p46>=1)&&(l23>=1))")||(G("((s8>=1)&&(l26>=1))"))))||(G(!("((s1>=1)&&(l20>=1))"))))))
Formula 0 simplified : G(F"((s1>=1)&&(l20>=1))" & (X"((s1>=1)&&(l20>=1))" | (!"((p46>=1)&&(l23>=1))" & F!"((s8>=1)&&(l26>=1))")))
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="DoubleLock-PT-p3s2"
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 DoubleLock-PT-p3s2, 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 r072-tall-174860067700572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s2.tgz
mv DoubleLock-PT-p3s2 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 ;