About the Execution of ITS-Tools for ErlangenMainframeV0-PT-0909
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 334032.00 | 0.00 | 0.00 | FTTTFFFFFFFTTTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600307.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 ErlangenMainframeV0-PT-0909, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 62M
-rw-r--r-- 1 mcc users 6.9K Jun 6 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 6 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 6 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 6 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Jun 6 09:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Jun 6 09:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 61M Jun 5 20:08 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 ErlangenMainframeV0-PT-0909-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-0909-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749358148063
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0909
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 04:49:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 04:49:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 04:49:11] [INFO ] Load time of PNML (sax parser for PT used): 2456 ms
[2025-06-08 04:49:11] [INFO ] Transformed 283 places.
[2025-06-08 04:49:12] [INFO ] Transformed 59341 transitions.
[2025-06-08 04:49:12] [INFO ] Found NUPN structural information;
[2025-06-08 04:49:12] [INFO ] Parsed PT model containing 283 places and 59341 transitions and 1260524 arcs in 3052 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 59341/59341 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 223 transition count 59281
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 223 transition count 59281
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 149 place count 194 transition count 59252
Iterating global reduction 0 with 29 rules applied. Total rules applied 178 place count 194 transition count 59252
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 191 place count 181 transition count 39758
Ensure Unique test removed 2 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 206 place count 179 transition count 39758
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 216 place count 169 transition count 776
Iterating global reduction 0 with 10 rules applied. Total rules applied 226 place count 169 transition count 776
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 229 place count 166 transition count 770
Iterating global reduction 0 with 3 rules applied. Total rules applied 232 place count 166 transition count 770
Applied a total of 232 rules in 8229 ms. Remains 166 /283 variables (removed 117) and now considering 770/59341 (removed 58571) transitions.
// Phase 1: matrix 770 rows 166 cols
[2025-06-08 04:49:21] [INFO ] Computed 22 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:49:21] [INFO ] Implicit Places using invariants in 527 ms returned []
[2025-06-08 04:49:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:49:22] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Running 769 sub problems to find dead transitions.
[2025-06-08 04:49:22] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:31] [INFO ] Deduced a trap composed of 23 places in 498 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:31] [INFO ] Deduced a trap composed of 26 places in 389 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:32] [INFO ] Deduced a trap composed of 26 places in 472 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:32] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:32] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:33] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:33] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:33] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:33] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:34] [INFO ] Deduced a trap composed of 15 places in 381 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:35] [INFO ] Deduced a trap composed of 15 places in 352 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:35] [INFO ] Deduced a trap composed of 15 places in 367 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:35] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:44] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:44] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:45] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:45] [INFO ] Deduced a trap composed of 24 places in 341 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 166/936 variables, and 39 constraints, problems are : Problem set: 0 solved, 769 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 769/170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 769 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:57] [INFO ] Deduced a trap composed of 22 places in 506 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:58] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:58] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:58] [INFO ] Deduced a trap composed of 24 places in 359 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:59] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:59] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:49:59] [INFO ] Deduced a trap composed of 25 places in 362 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:00] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:00] [INFO ] Deduced a trap composed of 26 places in 363 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:01] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:01] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:02] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:02] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:07] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:08] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:08] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:08] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:09] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 7 (OVERLAPS) 770/936 variables, 166/223 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 170/393 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/936 variables, and 393 constraints, problems are : Problem set: 0 solved, 769 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 769/170 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61400ms problems are : Problem set: 0 solved, 769 unsolved
Search for dead transitions found 0 dead transitions in 61421ms
Starting structural reductions in LTL mode, iteration 1 : 166/283 places, 770/59341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70811 ms. Remains : 166/283 places, 770/59341 transitions.
Support contains 27 out of 166 places after structural reductions.
[2025-06-08 04:50:24] [INFO ] Flatten gal took : 340 ms
[2025-06-08 04:50:24] [INFO ] Flatten gal took : 174 ms
[2025-06-08 04:50:25] [INFO ] Input system was already deterministic with 770 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 37514 steps (8 resets) in 1637 ms. (22 steps per ms) remains 0/16 properties
Computed a total of 27 stabilizing places and 27 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((X(p2)&&p1))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 770/770 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 152 transition count 756
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 152 transition count 756
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 143 transition count 590
Ensure Unique test removed 2 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 141 transition count 590
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 134 transition count 240
Ensure Unique test removed 4 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 130 transition count 240
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 124 transition count 176
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 124 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 121 transition count 170
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 121 transition count 170
Applied a total of 84 rules in 16 ms. Remains 121 /166 variables (removed 45) and now considering 170/770 (removed 600) transitions.
// Phase 1: matrix 170 rows 121 cols
[2025-06-08 04:50:26] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:50:26] [INFO ] Implicit Places using invariants in 90 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/166 places, 170/770 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 120/166 places, 170/770 transitions.
Stuttering acceptance computed with spot in 656 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLCardinality-00
Product exploration explored 100000 steps with 569 reset in 323 ms.
Product exploration explored 100000 steps with 576 reset in 214 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 107 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 13 to 11
RANDOM walk for 40000 steps (8 resets) in 909 ms. (43 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
// Phase 1: matrix 170 rows 120 cols
[2025-06-08 04:50:28] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/70 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/120 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 170/290 variables, 120/135 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 135 constraints, problems are : Problem set: 3 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 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: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/70 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:28] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 4 ms to minimize.
Problem apf5 is UNSAT
After SMT solving in domain Int declared 70/290 variables, and 11 constraints, problems are : Problem set: 4 solved, 0 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, State Equation: 0/120 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (G (OR p0 p2 (NOT p1))), (G (OR p2 (NOT p1))), (G (OR p0 (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 31 factoid took 431 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 170/170 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2025-06-08 04:50:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:50:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-08 04:50:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:50:29] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2025-06-08 04:50:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:30] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:30] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:30] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:30] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 170/290 variables, 120/141 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:32] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 142 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7210 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:37] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:37] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/290 variables, 120/144 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 169/313 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:38] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:38] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:41] [INFO ] Deduced a trap along path composed of 7 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:41] [INFO ] Deduced a trap along path composed of 11 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:50:41] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/290 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 318 constraints, problems are : Problem set: 0 solved, 169 unsolved in 17387 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 24627ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 24628ms
Finished structural reductions in LTL mode , in 1 iterations and 24783 ms. Remains : 120/120 places, 170/170 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT p1)), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 27705 steps (5 resets) in 86 ms. (318 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT p1)), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p2))), (F p1), (F p2), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 13 factoid took 420 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 583 reset in 160 ms.
Product exploration explored 100000 steps with 576 reset in 143 ms.
Built C files in :
/tmp/ltsmin3492426889811084415
[2025-06-08 04:50:55] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3492426889811084415
Running compilation step : cd /tmp/ltsmin3492426889811084415;'/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 417 ms.
Running link step : cd /tmp/ltsmin3492426889811084415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3492426889811084415;'/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/stateBased931707791331141912.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 170/170 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2025-06-08 04:51:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:51:11] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-08 04:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:51:11] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2025-06-08 04:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:12] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:12] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:12] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:12] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:12] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:12] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 170/290 variables, 120/141 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:14] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 142 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7321 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:19] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:19] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/290 variables, 120/144 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 169/313 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:20] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:23] [INFO ] Deduced a trap along path composed of 7 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:23] [INFO ] Deduced a trap along path composed of 11 places in 103 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:51:23] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/290 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 318 constraints, problems are : Problem set: 0 solved, 169 unsolved in 17041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 24390ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 24391ms
Finished structural reductions in LTL mode , in 1 iterations and 24674 ms. Remains : 120/120 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin10133870214612428531
[2025-06-08 04:51:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10133870214612428531
Running compilation step : cd /tmp/ltsmin10133870214612428531;'/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 269 ms.
Running link step : cd /tmp/ltsmin10133870214612428531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10133870214612428531;'/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/stateBased1468644761248974044.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 04:51:50] [INFO ] Flatten gal took : 9 ms
[2025-06-08 04:51:50] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:51:50] [INFO ] Time to serialize gal into /tmp/LTL2728495243503241297.gal : 19 ms
[2025-06-08 04:51:50] [INFO ] Time to serialize properties into /tmp/LTL10778290666069928464.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/LTL2728495243503241297.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16041739643445358488.hoa' '-atoms' '/tmp/LTL10778290666069928464.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10778290666069928464.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16041739643445358488.hoa
Detected timeout of ITS tools.
[2025-06-08 04:52:06] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:52:06] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:52:06] [INFO ] Time to serialize gal into /tmp/LTL5434636744788875488.gal : 2 ms
[2025-06-08 04:52:06] [INFO ] Time to serialize properties into /tmp/LTL7453436200652012186.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5434636744788875488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7453436200652012186.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(((p22==0)||(p148==1))||((p143==0)||(p30==1)))"))||(F(("((p215!=0)&&(p145!=1))")&&(X("((p215!=0)&&(p145!=1))"))))))
Formula 0 simplified : F!"(((p22==0)||(p148==1))||((p143==0)||(p30==1)))" & G(!"((p215!=0)&&(p145!=1))" | X!"((p215!=0)&&(p145!=1))")
Detected timeout of ITS tools.
[2025-06-08 04:52:21] [INFO ] Flatten gal took : 6 ms
[2025-06-08 04:52:21] [INFO ] Applying decomposition
[2025-06-08 04:52:21] [INFO ] Flatten gal took : 5 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/graph13537565863012047234.txt' '-o' '/tmp/graph13537565863012047234.bin' '-w' '/tmp/graph13537565863012047234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13537565863012047234.bin' '-l' '-1' '-v' '-w' '/tmp/graph13537565863012047234.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:52:21] [INFO ] Decomposing Gal with order
[2025-06-08 04:52:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:52:21] [INFO ] Removed a total of 219 redundant transitions.
[2025-06-08 04:52:21] [INFO ] Flatten gal took : 140 ms
[2025-06-08 04:52:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 14 ms.
[2025-06-08 04:52:21] [INFO ] Time to serialize gal into /tmp/LTL5747457579481791902.gal : 3 ms
[2025-06-08 04:52:21] [INFO ] Time to serialize properties into /tmp/LTL344735120956693438.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/LTL5747457579481791902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL344735120956693438.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((G("(((i2.u5.p22==0)||(i3.u8.p148==1))||((i1.u13.p143==0)||(i2.u6.p30==1)))"))||(F(("((i8.u21.p215!=0)&&(i6.u14.p145!=1))")&&(X("((...196
Formula 0 simplified : F!"(((i2.u5.p22==0)||(i3.u8.p148==1))||((i1.u13.p143==0)||(i2.u6.p30==1)))" & G(!"((i8.u21.p215!=0)&&(i6.u14.p145!=1))" | X!"((i8.u2...186
Reverse transition relation is NOT exact ! Due to transitions t24, t572, u12.t86, u12.t89, u12.t520, u17.t70, u17.t71, u17.t532, i1.u13.t80, i1.u13.t82, i1...594
7 unique states visited
5 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
154 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.56346,80484,1,0,142264,2319,2696,198898,385,10315,211480
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV0-PT-0909-LTLCardinality-00 finished in 117344 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))'
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 770/770 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 658
Ensure Unique test removed 1 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 35 place count 148 transition count 658
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 45 place count 138 transition count 380
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 57 place count 136 transition count 380
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 63 place count 130 transition count 206
Ensure Unique test removed 3 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 127 transition count 206
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 122 transition count 174
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 122 transition count 174
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 119 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 119 transition count 168
Applied a total of 88 rules in 11 ms. Remains 119 /166 variables (removed 47) and now considering 168/770 (removed 602) transitions.
// Phase 1: matrix 168 rows 119 cols
[2025-06-08 04:52:23] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:52:23] [INFO ] Implicit Places using invariants in 165 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/166 places, 168/770 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 118/166 places, 168/770 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 32 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0909-LTLCardinality-03 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(p1 U (G(p1)||(p1&&G(!p2)))))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 770/770 transitions.
Graph (trivial) has 125 edges and 166 vertex of which 6 / 166 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 162 transition count 746
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 142 transition count 746
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 41 place count 142 transition count 735
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 63 place count 131 transition count 735
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 78 place count 116 transition count 419
Ensure Unique test removed 1 places
Iterating global reduction 2 with 16 rules applied. Total rules applied 94 place count 115 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 115 transition count 417
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 96 place count 115 transition count 414
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 112 transition count 414
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 108 transition count 238
Ensure Unique test removed 2 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 106 transition count 238
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 103 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 103 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 102 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 102 transition count 156
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 208 place count 58 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 211 place count 55 transition count 98
Ensure Unique test removed 3 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 217 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 220 place count 49 transition count 84
Iterating global reduction 3 with 3 rules applied. Total rules applied 223 place count 49 transition count 84
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 233 place count 44 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 248 place count 44 transition count 80
Applied a total of 248 rules in 100 ms. Remains 44 /166 variables (removed 122) and now considering 80/770 (removed 690) transitions.
[2025-06-08 04:52:24] [INFO ] Flow matrix only has 58 transitions (discarded 22 similar events)
// Phase 1: matrix 58 rows 44 cols
[2025-06-08 04:52:24] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:52:24] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-08 04:52:24] [INFO ] Flow matrix only has 58 transitions (discarded 22 similar events)
[2025-06-08 04:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:52:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-08 04:52:24] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 04:52:24] [INFO ] Redundant transitions in 15 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-08 04:52:24] [INFO ] Flow matrix only has 58 transitions (discarded 22 similar events)
[2025-06-08 04:52:24] [INFO ] Invariant cache hit.
[2025-06-08 04:52:24] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 57/101 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/102 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 79 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 57/101 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 78/156 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 157 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2312 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4031ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 4032ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/166 places, 80/770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4319 ms. Remains : 44/166 places, 80/770 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLCardinality-05
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLCardinality-05 finished in 4425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||G(p2))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 770/770 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 151 transition count 660
Ensure Unique test removed 1 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 31 place count 150 transition count 660
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 39 place count 142 transition count 384
Ensure Unique test removed 2 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 49 place count 140 transition count 384
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 55 place count 134 transition count 210
Ensure Unique test removed 3 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 131 transition count 210
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 127 transition count 180
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 127 transition count 180
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 124 transition count 174
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 124 transition count 174
Applied a total of 78 rules in 15 ms. Remains 124 /166 variables (removed 42) and now considering 174/770 (removed 596) transitions.
// Phase 1: matrix 174 rows 124 cols
[2025-06-08 04:52:28] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:52:28] [INFO ] Implicit Places using invariants in 79 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/166 places, 174/770 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 123/166 places, 174/770 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 154 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/123 stabilizing places and 23/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (AND p0 p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 154 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/7 properties
BEST_FIRST walk for 27209 steps (5 resets) in 37 ms. (716 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (AND p0 p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F p2), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 16 factoid took 467 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 174/174 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 123 cols
[2025-06-08 04:52:30] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:52:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-08 04:52:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:52:30] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-08 04:52:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:31] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:31] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:31] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:31] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:31] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:32] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:32] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/297 variables, 123/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 146 constraints, problems are : Problem set: 0 solved, 173 unsolved in 7497 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/297 variables, 123/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 173/319 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:39] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:39] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:42] [INFO ] Deduced a trap along path composed of 8 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:42] [INFO ] Deduced a trap along path composed of 11 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:52:42] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 325 constraints, problems are : Problem set: 0 solved, 173 unsolved in 20333 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 27855ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 27856ms
Finished structural reductions in LTL mode , in 1 iterations and 28002 ms. Remains : 123/123 places, 174/174 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/123 stabilizing places and 23/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 156 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/7 properties
BEST_FIRST walk for 25511 steps (5 resets) in 42 ms. (593 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F p2), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 16 factoid took 443 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 162 ms.
Product exploration explored 100000 steps with 0 reset in 192 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 174/174 transitions.
Graph (trivial) has 97 edges and 123 vertex of which 6 / 123 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 120 transition count 171
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 11 place count 120 transition count 185
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 120 transition count 185
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 116 transition count 181
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 116 transition count 181
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 74 place count 116 transition count 183
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 92 place count 98 transition count 145
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 110 place count 98 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 98 transition count 142
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 95 transition count 139
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 95 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 128 place count 95 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 94 transition count 175
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 94 transition count 175
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 169 place count 94 transition count 136
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 178 place count 85 transition count 127
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 187 place count 85 transition count 127
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 187 rules in 51 ms. Remains 85 /123 variables (removed 38) and now considering 127/174 (removed 47) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 04:52:59] [INFO ] Redundant transitions in 2 ms returned []
Running 125 sub problems to find dead transitions.
[2025-06-08 04:52:59] [INFO ] Flow matrix only has 110 transitions (discarded 17 similar events)
// Phase 1: matrix 110 rows 85 cols
[2025-06-08 04:52:59] [INFO ] Computed 15 invariants in 0 ms
[2025-06-08 04:52:59] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:01] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:01] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 15/30 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/115 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 26/141 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/141 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/195 variables, 1/142 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/142 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/142 constraints. Problems are: Problem set: 61 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 142 constraints, problems are : Problem set: 61 solved, 64 unsolved in 3336 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 85/85 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 61 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 43/85 variables, 15/15 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 15/30 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/115 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 26/141 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 64/205 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/205 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 1/195 variables, 1/206 constraints. Problems are: Problem set: 61 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:05] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/207 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/207 constraints. Problems are: Problem set: 61 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/207 constraints. Problems are: Problem set: 61 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 207 constraints, problems are : Problem set: 61 solved, 64 unsolved in 4889 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 85/85 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 64/125 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8276ms problems are : Problem set: 61 solved, 64 unsolved
Search for dead transitions found 61 dead transitions in 8277ms
Found 61 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 61 transitions
Dead transitions reduction (with SMT) removed 61 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 85/123 places, 66/174 transitions.
Graph (complete) has 304 edges and 85 vertex of which 43 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 13 ms. Remains 43 /85 variables (removed 42) and now considering 80/66 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/123 places, 80/174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8350 ms. Remains : 43/123 places, 80/174 transitions.
Built C files in :
/tmp/ltsmin771759934757557574
[2025-06-08 04:53:08] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin771759934757557574
Running compilation step : cd /tmp/ltsmin771759934757557574;'/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 265 ms.
Running link step : cd /tmp/ltsmin771759934757557574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin771759934757557574;'/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/stateBased8699156772117907909.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 123 cols
[2025-06-08 04:53:23] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:53:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-08 04:53:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:53:23] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-08 04:53:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:24] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:24] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:24] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:25] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:25] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:25] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:25] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:25] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/297 variables, 123/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 146 constraints, problems are : Problem set: 0 solved, 173 unsolved in 7552 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/297 variables, 123/146 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 173/319 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:33] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:33] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:33] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:35] [INFO ] Deduced a trap along path composed of 8 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:35] [INFO ] Deduced a trap along path composed of 11 places in 40 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:53:35] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 325 constraints, problems are : Problem set: 0 solved, 173 unsolved in 19441 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 27015ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 27016ms
Finished structural reductions in LTL mode , in 1 iterations and 27209 ms. Remains : 123/123 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin2896789040518261535
[2025-06-08 04:53:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2896789040518261535
Running compilation step : cd /tmp/ltsmin2896789040518261535;'/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 287 ms.
Running link step : cd /tmp/ltsmin2896789040518261535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2896789040518261535;'/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/stateBased11042984223123269336.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 04:54:05] [INFO ] Flatten gal took : 6 ms
[2025-06-08 04:54:05] [INFO ] Flatten gal took : 6 ms
[2025-06-08 04:54:05] [INFO ] Time to serialize gal into /tmp/LTL2613366933451153775.gal : 2 ms
[2025-06-08 04:54:05] [INFO ] Time to serialize properties into /tmp/LTL16610142889693550214.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/LTL2613366933451153775.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2803307915826199006.hoa' '-atoms' '/tmp/LTL16610142889693550214.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/LTL16610142889693550214.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2803307915826199006.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t17, t19, t21, t24, t52, t57, t62, t67, t70, t71, t75, t76, t80, t81, t82, t86, t88, t89,...386
Detected timeout of ITS tools.
[2025-06-08 04:54:20] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:54:20] [INFO ] Flatten gal took : 5 ms
[2025-06-08 04:54:20] [INFO ] Time to serialize gal into /tmp/LTL18013686552610185179.gal : 1 ms
[2025-06-08 04:54:20] [INFO ] Time to serialize properties into /tmp/LTL11280708828086894269.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/LTL18013686552610185179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11280708828086894269.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(p49==0)")||(X(("(p142==0)")||(G("((p118==0)&&(p224==1))")))))))
Formula 0 simplified : F(!"(p49==0)" & X(!"(p142==0)" & F!"((p118==0)&&(p224==1))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t17, t19, t21, t24, t52, t57, t62, t67, t70, t71, t75, t76, t80, t81, t82, t86, t88, t89,...386
Detected timeout of ITS tools.
[2025-06-08 04:54:36] [INFO ] Flatten gal took : 6 ms
[2025-06-08 04:54:36] [INFO ] Applying decomposition
[2025-06-08 04:54:36] [INFO ] Flatten gal took : 6 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/graph8142111830510870746.txt' '-o' '/tmp/graph8142111830510870746.bin' '-w' '/tmp/graph8142111830510870746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8142111830510870746.bin' '-l' '-1' '-v' '-w' '/tmp/graph8142111830510870746.weights' '-q' '0' '-e' '0.001'
[2025-06-08 04:54:36] [INFO ] Decomposing Gal with order
[2025-06-08 04:54:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 04:54:36] [INFO ] Removed a total of 210 redundant transitions.
[2025-06-08 04:54:36] [INFO ] Flatten gal took : 20 ms
[2025-06-08 04:54:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2025-06-08 04:54:36] [INFO ] Time to serialize gal into /tmp/LTL6089941239466363307.gal : 6 ms
[2025-06-08 04:54:36] [INFO ] Time to serialize properties into /tmp/LTL2991106748687237520.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/LTL6089941239466363307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2991106748687237520.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(i3.u6.p49==0)")||(X(("(u14.p142==0)")||(G("((i6.u12.p118==0)&&(i10.i1.u27.p224==1))")))))))
Formula 0 simplified : F(!"(i3.u6.p49==0)" & X(!"(u14.p142==0)" & F!"((i6.u12.p118==0)&&(i10.i1.u27.p224==1))"))
Reverse transition relation is NOT exact ! Due to transitions t24, u14.t80, u14.t81, u14.t82, u14.t530, u14.t531, u10.t93, u10.t96, u10.t528, u16.t70, u16....595
55 unique states visited
55 strongly connected components in search stack
56 transitions explored
55 items max in DFS search stack
67 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.716239,40132,1,0,51656,4473,2355,62279,392,22003,113718
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV0-PT-0909-LTLCardinality-06 finished in 128597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 770/770 transitions.
Graph (trivial) has 125 edges and 166 vertex of which 4 / 166 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 163 transition count 748
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 144 transition count 748
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 39 place count 144 transition count 736
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 63 place count 132 transition count 736
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 80 place count 115 transition count 418
Ensure Unique test removed 1 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 place count 114 transition count 418
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 114 transition count 416
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 100 place count 114 transition count 411
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 109 transition count 411
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 105 transition count 235
Ensure Unique test removed 2 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 103 transition count 235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 100 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 100 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 99 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 99 transition count 153
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 214 place count 56 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 219 place count 51 transition count 90
Ensure Unique test removed 4 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 228 place count 47 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 47 transition count 89
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 233 place count 43 transition count 74
Iterating global reduction 4 with 4 rules applied. Total rules applied 237 place count 43 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 42 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 249 place count 37 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 267 place count 37 transition count 62
Applied a total of 267 rules in 62 ms. Remains 37 /166 variables (removed 129) and now considering 62/770 (removed 708) transitions.
[2025-06-08 04:54:37] [INFO ] Flow matrix only has 41 transitions (discarded 21 similar events)
// Phase 1: matrix 41 rows 37 cols
[2025-06-08 04:54:37] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:54:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-08 04:54:37] [INFO ] Flow matrix only has 41 transitions (discarded 21 similar events)
[2025-06-08 04:54:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:54:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-08 04:54:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 04:54:37] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-08 04:54:37] [INFO ] Flow matrix only has 41 transitions (discarded 21 similar events)
[2025-06-08 04:54:37] [INFO ] Invariant cache hit.
[2025-06-08 04:54:37] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 40/77 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/78 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 62 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 37/37 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 40/77 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 122 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 37/37 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2975ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2975ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/166 places, 62/770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3267 ms. Remains : 37/166 places, 62/770 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLCardinality-09
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLCardinality-09 finished in 3331 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(G(p0))&&G(p1))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 770/770 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 152 transition count 661
Ensure Unique test removed 1 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 29 place count 151 transition count 661
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 38 place count 142 transition count 399
Ensure Unique test removed 1 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 141 transition count 399
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 136 transition count 243
Ensure Unique test removed 3 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 61 place count 133 transition count 243
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 65 place count 129 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 69 place count 129 transition count 185
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 72 place count 126 transition count 179
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 126 transition count 179
Applied a total of 75 rules in 18 ms. Remains 126 /166 variables (removed 40) and now considering 179/770 (removed 591) transitions.
// Phase 1: matrix 179 rows 126 cols
[2025-06-08 04:54:40] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:54:40] [INFO ] Implicit Places using invariants in 141 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/166 places, 179/770 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 125/166 places, 179/770 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 159 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 25711 steps (5 resets) in 49 ms. (514 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0909-LTLCardinality-10 finished in 1038 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 X(p1))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 770/770 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 151 transition count 660
Ensure Unique test removed 1 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 31 place count 150 transition count 660
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 41 place count 140 transition count 397
Ensure Unique test removed 1 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 139 transition count 397
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 133 transition count 239
Ensure Unique test removed 4 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 129 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 125 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 125 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 121 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 121 transition count 171
Applied a total of 84 rules in 12 ms. Remains 121 /166 variables (removed 45) and now considering 171/770 (removed 599) transitions.
// Phase 1: matrix 171 rows 121 cols
[2025-06-08 04:54:41] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:54:41] [INFO ] Implicit Places using invariants in 105 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/166 places, 171/770 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 120/166 places, 171/770 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 65 ms.
Product exploration explored 100000 steps with 33333 reset in 71 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0909-LTLCardinality-11 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 770/770 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 150 transition count 659
Ensure Unique test removed 1 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 33 place count 149 transition count 659
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 43 place count 139 transition count 396
Ensure Unique test removed 1 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 138 transition count 396
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 132 transition count 238
Ensure Unique test removed 4 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 128 transition count 238
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 123 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 123 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 120 transition count 170
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 120 transition count 170
Applied a total of 86 rules in 15 ms. Remains 120 /166 variables (removed 46) and now considering 170/770 (removed 600) transitions.
// Phase 1: matrix 170 rows 120 cols
[2025-06-08 04:54:41] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 04:54:41] [INFO ] Implicit Places using invariants in 57 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/166 places, 170/770 transitions.
Applied a total of 0 rules in 0 ms. Remains 119 /119 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 119/166 places, 170/770 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0909-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 52 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0909-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0909-LTLCardinality-15 finished in 209 ms.
All properties solved by simple procedures.
Total runtime 332735 ms.
BK_STOP 1749358482095
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV0-PT-0909"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-0909, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339600307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-0909.tgz
mv ErlangenMainframeV0-PT-0909 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;