About the Execution of ITS-Tools for QuasiCertifProtocol-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ???FT?FFFFTTFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254700812.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 QuasiCertifProtocol-PT-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254700812
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 26K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 39K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 950K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 270K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 503K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749149268833
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 18:47:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 18:47:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:47:50] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-06-05 18:47:50] [INFO ] Transformed 1966 places.
[2025-06-05 18:47:50] [INFO ] Transformed 356 transitions.
[2025-06-05 18:47:50] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1366 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 81 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 18:47:50] [INFO ] Computed 1562 invariants in 82 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:47:51] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2025-06-05 18:47:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:47:53] [INFO ] Implicit Places using invariants and state equation in 1605 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 18:47:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/2272 variables, and 1562 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 0/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60608ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60622ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63663 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 1366 out of 1916 places after structural reductions.
[2025-06-05 18:48:54] [INFO ] Flatten gal took : 217 ms
[2025-06-05 18:48:54] [INFO ] Flatten gal took : 94 ms
[2025-06-05 18:48:54] [INFO ] Input system was already deterministic with 356 transitions.
Reduction of identical properties reduced properties to check from 30 to 26
RANDOM walk for 40000 steps (1485 resets) in 1805 ms. (22 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 246 ms. (16 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 196 ms. (20 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 100 ms. (39 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
[2025-06-05 18:48:55] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1297 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1297 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 152/1449 variables, 657/1163 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1449 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 399/1848 variables, 399/1562 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1848 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (OVERLAPS) 356/2204 variables, 1848/3410 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2204/2272 variables, and 3410 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1848/1916 constraints, PredecessorRefiner: 23/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1297 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1297 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 152/1449 variables, 657/1163 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1449 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 399/1848 variables, 399/1562 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1848 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 356/2204 variables, 1848/3410 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2204 variables, 11/3421 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2204/2272 variables, and 3421 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1848/1916 constraints, PredecessorRefiner: 19/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10090ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1297 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 43 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1916/1916 places, 356/356 transitions.
RANDOM walk for 40000 steps (1485 resets) in 965 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 78 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 89 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 535913 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 23
Probabilistic random walk after 535913 steps, saw 76005 distinct states, run finished after 3005 ms. (steps per millisecond=178 ) properties seen :0
[2025-06-05 18:49:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1297 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1297 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 152/1449 variables, 657/1163 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1449 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 399/1848 variables, 399/1562 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1848 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 356/2204 variables, 1848/3410 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2204 variables, 0/3410 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 8 (OVERLAPS) 68/2272 variables, 68/3478 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 2 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 2 solved, 21 unsolved in 15987 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 23/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 21 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1297 variables, 506/506 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1297 variables, 0/506 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 152/1449 variables, 657/1163 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1449 variables, 0/1163 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 399/1848 variables, 399/1562 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1848 variables, 0/1562 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 356/2204 variables, 1848/3410 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2204 variables, 11/3421 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2204 variables, 0/3421 constraints. Problems are: Problem set: 2 solved, 21 unsolved
SMT process timed out in 61045ms, After SMT, problems are : Problem set: 2 solved, 21 unsolved
Fused 21 Parikh solutions to 15 different solutions.
Finished Parikh walk after 167 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=41 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 21 properties in 809 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X((G(p1)||G(p2)))))))'
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 123 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 18:50:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:50:13] [INFO ] Implicit Places using invariants in 1540 ms returned []
[2025-06-05 18:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:50:16] [INFO ] Implicit Places using invariants and state equation in 3274 ms returned []
Implicit Place search using SMT with State Equation took 4819 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 18:50:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/2272 variables, and 1562 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 0/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in LTL mode , in 1 iterations and 65187 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 530 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-00
Product exploration explored 100000 steps with 3718 reset in 1401 ms.
Product exploration explored 100000 steps with 3716 reset in 1361 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 12 states, 33 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1484 resets) in 2175 ms. (18 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 192 ms. (20 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 486 ms. (8 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 1105 ms. (3 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 84 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 93 ms. (42 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 75 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 98 ms. (40 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 93 ms. (42 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 70 ms. (56 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 450045 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 23
Probabilistic random walk after 450045 steps, saw 63744 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2025-06-05 18:51:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 55/655 variables, 550/550 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 497/1152 variables, 484/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 742/2173 variables, 669/2855 constraints. Problems are: Problem set: 0 solved, 23 unsolved
SMT process timed out in 5088ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.12 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1892 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 1891 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1891 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1890 transition count 349
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 2 with 46 rules applied. Total rules applied 54 place count 1890 transition count 303
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 100 place count 1844 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 1843 transition count 302
Applied a total of 101 rules in 385 ms. Remains 1843 /1916 variables (removed 73) and now considering 302/356 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 1843/1916 places, 302/356 transitions.
RANDOM walk for 40000 steps (1438 resets) in 1825 ms. (21 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 506638 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 23
Probabilistic random walk after 506638 steps, saw 76662 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
// Phase 1: matrix 302 rows 1843 cols
[2025-06-05 18:51:35] [INFO ] Computed 1541 invariants in 29 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
Problem apf18 is UNSAT
At refinement iteration 6 (OVERLAPS) 691/2122 variables, 668/2854 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 484/3338 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 0/3338 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 23/2145 variables, 23/3361 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2145 variables, 23/3384 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2145 variables, 0/3384 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/2145 variables, 0/3384 constraints. Problems are: Problem set: 5 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2145/2145 variables, and 3384 constraints, problems are : Problem set: 5 solved, 18 unsolved in 25568 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 23/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 18 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 691/2122 variables, 668/2854 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 484/3338 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 1/3339 constraints. Problems are: Problem set: 5 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2122/2145 variables, and 3339 constraints, problems are : Problem set: 5 solved, 18 unsolved in 45019 ms.
Refiners :[Generalized P Invariants (flows): 1518/1541 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70675ms problems are : Problem set: 5 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 302/302 transitions.
Applied a total of 0 rules in 53 ms. Remains 1843 /1843 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1843/1843 places, 302/302 transitions.
RANDOM walk for 40000 steps (1440 resets) in 1617 ms. (24 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 472953 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 18
Probabilistic random walk after 472953 steps, saw 70973 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2025-06-05 18:52:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 691/2122 variables, 668/2854 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 484/3338 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 23/2145 variables, 23/3361 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2145 variables, 23/3384 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2145 variables, 0/3384 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/2145 variables, 0/3384 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2145/2145 variables, and 3384 constraints, problems are : Problem set: 0 solved, 18 unsolved in 16271 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 691/2122 variables, 668/2854 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 484/3338 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 1/3339 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2122 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SMT process timed out in 91342ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 302/302 transitions.
Applied a total of 0 rules in 46 ms. Remains 1843 /1843 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1843/1843 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 302/302 transitions.
Applied a total of 0 rules in 41 ms. Remains 1843 /1843 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2025-06-05 18:54:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:54:22] [INFO ] Implicit Places using invariants in 1543 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1545 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1842/1843 places, 302/302 transitions.
Applied a total of 0 rules in 34 ms. Remains 1842 /1842 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1621 ms. Remains : 1842/1843 places, 302/302 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0)), (G (OR p2 p0 p1)), (G (OR (NOT p2) p0 p1)), (G (OR p2 (NOT p0) p1)), (G (OR p0 p1)), (G (OR p2 p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 276 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 431 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 34 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 18:54:24] [INFO ] Computed 1562 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:54:25] [INFO ] Implicit Places using invariants in 1600 ms returned []
[2025-06-05 18:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:54:29] [INFO ] Implicit Places using invariants and state equation in 3584 ms returned []
Implicit Place search using SMT with State Equation took 5190 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 18:54: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/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/2272 variables, and 1562 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 0/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in LTL mode , in 1 iterations and 65424 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 p1 p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1482 resets) in 1052 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (84 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (67 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 731 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (90 resets) in 629 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (85 resets) in 602 ms. (66 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (90 resets) in 639 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (71 resets) in 651 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (71 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 779 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (67 resets) in 649 ms. (61 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 486994 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 10
Probabilistic random walk after 486994 steps, saw 68495 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2025-06-05 18:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 55/655 variables, 550/550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 497/1152 variables, 484/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 742/2173 variables, 669/2855 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2173 variables, 484/3339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2173 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 98/2271 variables, 94/3433 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2271 variables, 44/3477 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5008 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 55/655 variables, 550/550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 497/1152 variables, 484/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 742/2173 variables, 669/2855 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2173 variables, 484/3339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2173 variables, 1/3340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2173/2272 variables, and 3340 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5020 ms.
Refiners :[Generalized P Invariants (flows): 1518/1562 constraints, State Equation: 1821/1916 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10065ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1892 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 1891 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1891 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1890 transition count 349
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 2 with 46 rules applied. Total rules applied 54 place count 1890 transition count 303
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 100 place count 1844 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 1843 transition count 302
Applied a total of 101 rules in 148 ms. Remains 1843 /1916 variables (removed 73) and now considering 302/356 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 1843/1916 places, 302/356 transitions.
RANDOM walk for 40000 steps (1438 resets) in 1254 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 679 ms. (58 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (52 resets) in 636 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 610 ms. (65 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 675 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 667 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 797 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 648 ms. (61 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 487899 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 10
Probabilistic random walk after 487899 steps, saw 73515 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
// Phase 1: matrix 302 rows 1843 cols
[2025-06-05 18:55:49] [INFO ] Computed 1541 invariants in 7 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 691/2122 variables, 668/2854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 484/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 23/2145 variables, 23/3361 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2145 variables, 23/3384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2145 variables, 0/3384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/2145 variables, 0/3384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2145/2145 variables, and 3384 constraints, problems are : Problem set: 0 solved, 10 unsolved in 10105 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 691/2122 variables, 668/2854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 484/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 1/3339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2122 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 23/2145 variables, 23/3362 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2145 variables, 23/3385 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2145/2145 variables, and 3385 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45021 ms.
Refiners :[Generalized P Invariants (flows): 1541/1541 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55164ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 302/302 transitions.
Applied a total of 0 rules in 33 ms. Remains 1843 /1843 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1843/1843 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 302/302 transitions.
Applied a total of 0 rules in 29 ms. Remains 1843 /1843 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2025-06-05 18:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:56:46] [INFO ] Implicit Places using invariants in 1647 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1648 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1842/1843 places, 302/302 transitions.
Applied a total of 0 rules in 37 ms. Remains 1842 /1842 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1715 ms. Remains : 1842/1843 places, 302/302 transitions.
RANDOM walk for 40000 steps (1437 resets) in 1200 ms. (33 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 676 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (54 resets) in 632 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 610 ms. (65 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 656 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 681 ms. (58 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 792 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 647 ms. (61 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 506036 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 10
Probabilistic random walk after 506036 steps, saw 76564 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
// Phase 1: matrix 302 rows 1842 cols
[2025-06-05 18:56:51] [INFO ] Computed 1540 invariants in 7 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 690/2121 variables, 667/2853 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2121 variables, 484/3337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 23/2144 variables, 22/3359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2144 variables, 23/3382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2144 variables, 0/3382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/2144 variables, 0/3382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 3382 constraints, problems are : Problem set: 0 solved, 10 unsolved in 8664 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1842/1842 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 279/1431 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1431 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 690/2121 variables, 667/2853 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2121 variables, 484/3337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 1/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2121 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 23/2144 variables, 22/3360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2144 variables, 23/3383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2144 variables, 0/3383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2144 variables, 0/3383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2144/2144 variables, and 3383 constraints, problems are : Problem set: 0 solved, 10 unsolved in 72906 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1842/1842 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81609ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Finished Parikh walk after 94 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 402 ms.
Knowledge obtained : [(AND p2 p1 p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p2) p0))), (F (NOT p1)), (F (NOT (AND p2 p1 p0))), (F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 4 factoid took 395 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 407 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 401 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3716 reset in 914 ms.
Product exploration explored 100000 steps with 3714 reset in 938 ms.
Applying partial POR strategy [true, true, true, false, false, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 382 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.13 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1892 transition count 355
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 202 ms. Remains 1892 /1916 variables (removed 24) and now considering 355/356 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:58:17] [INFO ] Redundant transitions in 75 ms returned []
Running 331 sub problems to find dead transitions.
// Phase 1: matrix 355 rows 1892 cols
[2025-06-05 18:58:17] [INFO ] Computed 1540 invariants in 24 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1891 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1891 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Problem TDEAD193 is UNSAT
At refinement iteration 2 (OVERLAPS) 355/2246 variables, 1891/3431 constraints. Problems are: Problem set: 1 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2246/2247 variables, and 3431 constraints, problems are : Problem set: 1 solved, 330 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1892 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 330 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1891 variables, 1540/1540 constraints. Problems are: Problem set: 1 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1891 variables, 0/1540 constraints. Problems are: Problem set: 1 solved, 330 unsolved
Problem TDEAD291 is UNSAT
At refinement iteration 2 (OVERLAPS) 355/2246 variables, 1891/3431 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2246 variables, 329/3760 constraints. Problems are: Problem set: 2 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2246/2247 variables, and 3760 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1892 constraints, PredecessorRefiner: 329/331 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60243ms problems are : Problem set: 2 solved, 329 unsolved
Search for dead transitions found 2 dead transitions in 60245ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1916 places, 353/356 transitions.
Graph (complete) has 15735 edges and 1892 vertex of which 1891 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 51 ms. Remains 1891 /1892 variables (removed 1) and now considering 353/353 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1891/1916 places, 353/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60589 ms. Remains : 1891/1916 places, 353/356 transitions.
Built C files in :
/tmp/ltsmin3733101172757617816
[2025-06-05 18:59:18] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3733101172757617816
Running compilation step : cd /tmp/ltsmin3733101172757617816;'/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 1456 ms.
Running link step : cd /tmp/ltsmin3733101172757617816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3733101172757617816;'/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/stateBased13957029065822636836.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 30 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 18:59:33] [INFO ] Computed 1562 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:59:34] [INFO ] Implicit Places using invariants in 1701 ms returned []
[2025-06-05 18:59:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:59:38] [INFO ] Implicit Places using invariants and state equation in 3433 ms returned []
Implicit Place search using SMT with State Equation took 5138 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 18:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Finished structural reductions in LTL mode , in 1 iterations and 65398 ms. Remains : 1916/1916 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin2820970377047987023
[2025-06-05 19:00:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2820970377047987023
Running compilation step : cd /tmp/ltsmin2820970377047987023;'/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 1275 ms.
Running link step : cd /tmp/ltsmin2820970377047987023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2820970377047987023;'/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/stateBased17667866131615616552.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 19:00:53] [INFO ] Flatten gal took : 51 ms
[2025-06-05 19:00:54] [INFO ] Flatten gal took : 55 ms
[2025-06-05 19:00:54] [INFO ] Time to serialize gal into /tmp/LTL15059653853289642197.gal : 14 ms
[2025-06-05 19:00:54] [INFO ] Time to serialize properties into /tmp/LTL10886406600275549944.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15059653853289642197.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9647802735555407252.hoa' '-atoms' '/tmp/LTL10886406600275549944.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/LTL10886406600275549944.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9647802735555407252.hoa
Detected timeout of ITS tools.
[2025-06-05 19:01:09] [INFO ] Flatten gal took : 45 ms
[2025-06-05 19:01:09] [INFO ] Flatten gal took : 45 ms
[2025-06-05 19:01:09] [INFO ] Time to serialize gal into /tmp/LTL13600250043331182749.gal : 7 ms
[2025-06-05 19:01:09] [INFO ] Time to serialize properties into /tmp/LTL17402510441816653759.ltl : 4 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/LTL13600250043331182749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17402510441816653759.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((n7_7_16<1)||(n7_8_16<1))||((n7_9_16<1)||(n7_10_16<1)))||(((n7_3_16<1)||(n7_4_16<1))||((n7_5_16<1)||(n7_6_16<1))))|...9644
Formula 0 simplified : X(F!"(((((((((((n7_7_16<1)||(n7_8_16<1))||((n7_9_16<1)||(n7_10_16<1)))||(((n7_3_16<1)||(n7_4_16<1))||((n7_5_16<1)||(n7_6_16<1))))||(...9630
Detected timeout of ITS tools.
[2025-06-05 19:01:24] [INFO ] Flatten gal took : 42 ms
[2025-06-05 19:01:24] [INFO ] Applying decomposition
[2025-06-05 19:01:24] [INFO ] Flatten gal took : 42 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/graph10828911431177444989.txt' '-o' '/tmp/graph10828911431177444989.bin' '-w' '/tmp/graph10828911431177444989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10828911431177444989.bin' '-l' '-1' '-v' '-w' '/tmp/graph10828911431177444989.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:01:24] [INFO ] Decomposing Gal with order
[2025-06-05 19:01:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:01:24] [INFO ] Removed a total of 228 redundant transitions.
[2025-06-05 19:01:25] [INFO ] Flatten gal took : 258 ms
[2025-06-05 19:01:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 82 ms.
[2025-06-05 19:01:25] [INFO ] Time to serialize gal into /tmp/LTL2414724388257049726.gal : 28 ms
[2025-06-05 19:01:25] [INFO ] Time to serialize properties into /tmp/LTL10353410890289264910.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2414724388257049726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10353410890289264910.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((i39.i0.u41.n7_7_16<1)||(i21.u50.n7_8_16<1))||((i40.u95.n7_9_16<1)||(i19.i1.u97.n7_10_16<1)))||(((i43.i1.u34.n7_3_1...15766
Formula 0 simplified : X(F!"(((((((((((i39.i0.u41.n7_7_16<1)||(i21.u50.n7_8_16<1))||((i40.u95.n7_9_16<1)||(i19.i1.u97.n7_10_16<1)))||(((i43.i1.u34.n7_3_16<...15752
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-00 finished in 688700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U G((!p1||G(!p2)))))'
Support contains 94 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 56 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:01:42] [INFO ] Implicit Places using invariants in 2455 ms returned []
[2025-06-05 19:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:01:48] [INFO ] Implicit Places using invariants and state equation in 5045 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7504 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 54 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7615 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 367 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p2 p0), (AND p2 p0), p2, (AND p2 p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-01
Product exploration explored 100000 steps with 14102 reset in 767 ms.
Product exploration explored 100000 steps with 14017 reset in 810 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0))))]
Knowledge based reduction with 17 factoid took 695 ms. Reduced automaton from 11 states, 31 edges and 3 AP (stutter sensitive) to 11 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p2 p0), (AND p2 p0), p2, (AND p2 p1)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (1481 resets) in 192 ms. (207 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 149 ms. (266 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (32 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
// Phase 1: matrix 356 rows 1893 cols
[2025-06-05 19:01:51] [INFO ] Computed 1540 invariants in 189 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 304/2249 variables, and 116 constraints, problems are : Problem set: 2 solved, 0 unsolved in 76 ms.
Refiners :[Generalized P Invariants (flows): 22/1540 constraints, State Equation: 94/1893 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 280ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (G (OR (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F p1), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 19 factoid took 1086 ms. Reduced automaton from 11 states, 31 edges and 3 AP (stutter sensitive) to 11 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 366 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Support contains 94 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 51 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:01:56] [INFO ] Implicit Places using invariants in 2282 ms returned []
[2025-06-05 19:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:02:00] [INFO ] Implicit Places using invariants and state equation in 4359 ms returned []
Implicit Place search using SMT with State Equation took 6644 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 19:02:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in LTL mode , in 1 iterations and 66916 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 1331 ms. Reduced automaton from 11 states, 29 edges and 3 AP (stutter sensitive) to 11 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 421 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1483 resets) in 164 ms. (242 steps per ms) remains 3/9 properties
BEST_FIRST walk for 4544 steps (0 resets) in 26 ms. (168 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 15 factoid took 2583 ms. Reduced automaton from 11 states, 29 edges and 3 AP (stutter sensitive) to 11 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 437 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 463 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Product exploration explored 100000 steps with 14028 reset in 694 ms.
Product exploration explored 100000 steps with 13895 reset in 708 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 451 ms :[(AND p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p2), p0, true, (AND p1 p0 p2), (AND p0 p2), p2, (AND p2 p1)]
Support contains 94 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1869 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1869 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 128 ms. Remains 1869 /1893 variables (removed 24) and now considering 356/356 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:03:08] [INFO ] Redundant transitions in 20 ms returned []
Running 332 sub problems to find dead transitions.
// Phase 1: matrix 356 rows 1869 cols
[2025-06-05 19:03:09] [INFO ] Computed 1518 invariants in 183 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1868 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1868 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2224 variables, 1868/3386 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2224/2225 variables, and 3386 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1868/1869 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1868 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1868 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
At refinement iteration 2 (OVERLAPS) 356/2224 variables, 1868/3386 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2224 variables, 328/3714 constraints. Problems are: Problem set: 4 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2224/2225 variables, and 3714 constraints, problems are : Problem set: 4 solved, 328 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1868/1869 constraints, PredecessorRefiner: 328/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 4 solved, 328 unsolved
Search for dead transitions found 4 dead transitions in 60411ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1893 places, 352/356 transitions.
Graph (complete) has 15711 edges and 1869 vertex of which 1867 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 159 ms. Remains 1867 /1869 variables (removed 2) and now considering 352/352 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1867/1893 places, 352/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60724 ms. Remains : 1867/1893 places, 352/356 transitions.
Built C files in :
/tmp/ltsmin13436655921759161344
[2025-06-05 19:04:09] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13436655921759161344
Running compilation step : cd /tmp/ltsmin13436655921759161344;'/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 1269 ms.
Running link step : cd /tmp/ltsmin13436655921759161344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13436655921759161344;'/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/stateBased10967317923981148317.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 94 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2025-06-05 19:04:24] [INFO ] Computed 1540 invariants in 172 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:04:27] [INFO ] Implicit Places using invariants in 2482 ms returned []
[2025-06-05 19:04:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:04:31] [INFO ] Implicit Places using invariants and state equation in 4368 ms returned []
Implicit Place search using SMT with State Equation took 6852 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 19:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1892/2249 variables, and 1540 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 0/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Finished structural reductions in LTL mode , in 1 iterations and 67139 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin12634111865139058357
[2025-06-05 19:05:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12634111865139058357
Running compilation step : cd /tmp/ltsmin12634111865139058357;'/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 1273 ms.
Running link step : cd /tmp/ltsmin12634111865139058357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12634111865139058357;'/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/stateBased5937751773193935636.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 19:05:46] [INFO ] Flatten gal took : 41 ms
[2025-06-05 19:05:46] [INFO ] Flatten gal took : 54 ms
[2025-06-05 19:05:46] [INFO ] Time to serialize gal into /tmp/LTL1991925815097527752.gal : 6 ms
[2025-06-05 19:05:46] [INFO ] Time to serialize properties into /tmp/LTL4084586742914332548.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/LTL1991925815097527752.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14528134473940168171.hoa' '-atoms' '/tmp/LTL4084586742914332548.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/LTL4084586742914332548.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14528134473940168171.hoa
Detected timeout of ITS tools.
[2025-06-05 19:06:02] [INFO ] Flatten gal took : 38 ms
[2025-06-05 19:06:02] [INFO ] Flatten gal took : 39 ms
[2025-06-05 19:06:02] [INFO ] Time to serialize gal into /tmp/LTL11441962535358728678.gal : 5 ms
[2025-06-05 19:06:02] [INFO ] Time to serialize properties into /tmp/LTL7602037896444308085.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/LTL11441962535358728678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7602037896444308085.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(!("(((((((Sstart_2>=1)&&(n1_2>=1))||((Sstart_10>=1)&&(n1_10>=1)))||(((Sstart_7>=1)&&(n1_7>=1))||((Sstart_15>=1)&&(n1_15>=1))))...2047
Formula 0 simplified : XX"(((((((Sstart_2>=1)&&(n1_2>=1))||((Sstart_10>=1)&&(n1_10>=1)))||(((Sstart_7>=1)&&(n1_7>=1))||((Sstart_15>=1)&&(n1_15>=1))))||((((...2024
Detected timeout of ITS tools.
[2025-06-05 19:06:17] [INFO ] Flatten gal took : 37 ms
[2025-06-05 19:06:17] [INFO ] Applying decomposition
[2025-06-05 19:06:17] [INFO ] Flatten gal took : 36 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/graph6301268721876060966.txt' '-o' '/tmp/graph6301268721876060966.bin' '-w' '/tmp/graph6301268721876060966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6301268721876060966.bin' '-l' '-1' '-v' '-w' '/tmp/graph6301268721876060966.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:06:17] [INFO ] Decomposing Gal with order
[2025-06-05 19:06:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:06:17] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-05 19:06:17] [INFO ] Flatten gal took : 142 ms
[2025-06-05 19:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 61 ms.
[2025-06-05 19:06:17] [INFO ] Time to serialize gal into /tmp/LTL17831653546372704315.gal : 12 ms
[2025-06-05 19:06:17] [INFO ] Time to serialize properties into /tmp/LTL11549729509373822265.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/LTL17831653546372704315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11549729509373822265.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(X(!("(((((((i17.i1.u43.Sstart_2>=1)&&(i17.i1.u118.n1_2>=1))||((i28.i0.u111.Sstart_10>=1)&&(i28.i0.u49.n1_10>=1)))||(((i35.i1.u58...3174
Formula 0 simplified : XX"(((((((i17.i1.u43.Sstart_2>=1)&&(i17.i1.u118.n1_2>=1))||((i28.i0.u111.Sstart_10>=1)&&(i28.i0.u49.n1_10>=1)))||(((i35.i1.u58.Sstar...3151
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-01 finished in 292425 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((!(p1 U !p2)||p0))&&!(F(!p2) U p1)))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1889 transition count 351
Applied a total of 5 rules in 129 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2025-06-05 19:06:33] [INFO ] Computed 1540 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:06:35] [INFO ] Implicit Places using invariants in 2381 ms returned []
[2025-06-05 19:06:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:06:40] [INFO ] Implicit Places using invariants and state equation in 4842 ms returned [1152, 1153, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1178, 1180, 1181, 1182, 1183, 1848, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 7227 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/1916 places, 351/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7417 ms. Remains : 1843/1916 places, 351/356 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR p1 (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-02
Product exploration explored 100000 steps with 3477 reset in 641 ms.
Product exploration explored 100000 steps with 3474 reset in 614 ms.
Computed a total of 1843 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1843 transition count 351
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (OR (AND (NOT p2) (NOT p0)) p1)), (X (NOT (OR (AND (NOT p2) (NOT p0)) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (OR (AND (NOT p2) (NOT p0)) p1))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 1441 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR p1 (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1391 resets) in 481 ms. (82 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (68 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (47 resets) in 271 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
// Phase 1: matrix 351 rows 1843 cols
[2025-06-05 19:06:44] [INFO ] Computed 1496 invariants in 299 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 253/300 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2167 variables, 1771/1818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2167 variables, 1496/3314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 27/2194 variables, 25/3339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 2194/2194 variables, and 3339 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1705 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 253/300 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2167 variables, 1771/1818 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2167 variables, 1496/3314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 27/2194 variables, 25/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2194/2194 variables, and 3339 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1208 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3233ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 95 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0))), (G (AND (OR (NOT p1) p2) (OR p2 p0)))]
False Knowledge obtained : [(X (OR (AND (NOT p2) (NOT p0)) p1)), (X (NOT (OR (AND (NOT p2) (NOT p0)) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (OR (AND (NOT p2) (NOT p0)) p1))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (OR p2 p0)))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2))), (F p1)]
Knowledge based reduction with 13 factoid took 2578 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 47 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1843/1843 places, 351/351 transitions.
Applied a total of 0 rules in 64 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2025-06-05 19:06:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:06:52] [INFO ] Implicit Places using invariants in 2288 ms returned []
[2025-06-05 19:06:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:06:56] [INFO ] Implicit Places using invariants and state equation in 4383 ms returned []
Implicit Place search using SMT with State Equation took 6674 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:06:56] [INFO ] Redundant transitions in 24 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-05 19:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/2194 variables, and 3316 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30010 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2171 variables, 304/3620 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/2194 variables, and 3620 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66974 ms. Remains : 1843/1843 places, 351/351 transitions.
Computed a total of 1843 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1843 transition count 351
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 569 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[true, p1, (NOT p2), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (1384 resets) in 421 ms. (94 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
[2025-06-05 19:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 253/300 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2167 variables, 1771/1818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2167 variables, 1496/3314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 6 (OVERLAPS) 27/2194 variables, 25/3339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2194/2194 variables, and 3339 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2432 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 253/300 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2167 variables, 1771/1818 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2167 variables, 1496/3314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2167 variables, 0/3314 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 27/2194 variables, 25/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2194 variables, 0/3339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2194/2194 variables, and 3339 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1078 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1843/1843 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3528ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 95 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p1))), (F (G p2)), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 10 factoid took 918 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[true, p1, (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 3472 reset in 582 ms.
Product exploration explored 100000 steps with 3471 reset in 592 ms.
Built C files in :
/tmp/ltsmin6905671046247450573
[2025-06-05 19:08:04] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2025-06-05 19:08:04] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:08:04] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2025-06-05 19:08:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:08:04] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2025-06-05 19:08:04] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:08:04] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6905671046247450573
Running compilation step : cd /tmp/ltsmin6905671046247450573;'/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 1465 ms.
Running link step : cd /tmp/ltsmin6905671046247450573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6905671046247450573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7113264726478312282.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 47 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1843/1843 places, 351/351 transitions.
Applied a total of 0 rules in 86 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2025-06-05 19:08:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:08:21] [INFO ] Implicit Places using invariants in 2192 ms returned []
[2025-06-05 19:08:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:08:26] [INFO ] Implicit Places using invariants and state equation in 4603 ms returned []
Implicit Place search using SMT with State Equation took 6797 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:08:26] [INFO ] Redundant transitions in 27 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-05 19:08:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2171/2194 variables, and 3316 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 351/2171 variables, 1820/3316 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2171 variables, 304/3620 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2171/2194 variables, and 3620 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 1820/1843 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67122 ms. Remains : 1843/1843 places, 351/351 transitions.
Built C files in :
/tmp/ltsmin8420273851229119354
[2025-06-05 19:09:26] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2025-06-05 19:09:26] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:09:26] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2025-06-05 19:09:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:09:26] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2025-06-05 19:09:26] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:09:26] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8420273851229119354
Running compilation step : cd /tmp/ltsmin8420273851229119354;'/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 1484 ms.
Running link step : cd /tmp/ltsmin8420273851229119354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8420273851229119354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3004254882924713865.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 19:09:41] [INFO ] Flatten gal took : 35 ms
[2025-06-05 19:09:41] [INFO ] Flatten gal took : 33 ms
[2025-06-05 19:09:41] [INFO ] Time to serialize gal into /tmp/LTL4962938618611049257.gal : 5 ms
[2025-06-05 19:09:41] [INFO ] Time to serialize properties into /tmp/LTL12549486491769141068.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/LTL4962938618611049257.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18006588511044430227.hoa' '-atoms' '/tmp/LTL12549486491769141068.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/LTL12549486491769141068.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18006588511044430227.hoa
Detected timeout of ITS tools.
[2025-06-05 19:09:56] [INFO ] Flatten gal took : 35 ms
[2025-06-05 19:09:56] [INFO ] Flatten gal took : 34 ms
[2025-06-05 19:09:56] [INFO ] Time to serialize gal into /tmp/LTL5447015102926922953.gal : 5 ms
[2025-06-05 19:09:56] [INFO ] Time to serialize properties into /tmp/LTL15330204918752080613.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/LTL5447015102926922953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15330204918752080613.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G((((((!(("(((((((malicious_reservoir>=1)&&(s2_4>=1))||((malicious_reservoir>=1)&&(s2_5>=1)))||(((malicious_reservoir>=1)&&(s2_6>=...4760
Formula 0 simplified : (F!"(((((((malicious_reservoir<1)||(c1_21<1))&&((malicious_reservoir<1)||(c1_18<1)))&&(((malicious_reservoir<1)||(c1_20<1))&&((malic...4732
Detected timeout of ITS tools.
[2025-06-05 19:10:11] [INFO ] Flatten gal took : 45 ms
[2025-06-05 19:10:11] [INFO ] Applying decomposition
[2025-06-05 19:10:12] [INFO ] Flatten gal took : 34 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/graph13880035638478042921.txt' '-o' '/tmp/graph13880035638478042921.bin' '-w' '/tmp/graph13880035638478042921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13880035638478042921.bin' '-l' '-1' '-v' '-w' '/tmp/graph13880035638478042921.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:10:12] [INFO ] Decomposing Gal with order
[2025-06-05 19:10:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:10:12] [INFO ] Removed a total of 253 redundant transitions.
[2025-06-05 19:10:12] [INFO ] Flatten gal took : 105 ms
[2025-06-05 19:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 27 ms.
[2025-06-05 19:10:12] [INFO ] Time to serialize gal into /tmp/LTL17836581399043804487.gal : 10 ms
[2025-06-05 19:10:12] [INFO ] Time to serialize properties into /tmp/LTL10768406199282428960.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/LTL17836581399043804487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10768406199282428960.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G((((((!(("(((((((u0.malicious_reservoir>=1)&&(i44.u88.s2_4>=1))||((u0.malicious_reservoir>=1)&&(i45.u89.s2_5>=1)))||(((u0.malicio...6025
Formula 0 simplified : (F!"(((((((u0.malicious_reservoir<1)||(i24.u32.c1_21<1))&&((u0.malicious_reservoir<1)||(i38.u56.c1_18<1)))&&(((u0.malicious_reservoi...5997
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-02 finished in 234570 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 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.4 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
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 0 with 2 rules applied. Total rules applied 93 place count 1316 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1316 transition count 262
Applied a total of 94 rules in 174 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2025-06-05 19:10:27] [INFO ] Computed 1056 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:10:29] [INFO ] Implicit Places using invariants in 1543 ms returned []
[2025-06-05 19:10:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:10:33] [INFO ] Implicit Places using invariants and state equation in 4118 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 5663 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1270/1916 places, 262/356 transitions.
Applied a total of 0 rules in 54 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5892 ms. Remains : 1270/1916 places, 262/356 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-03
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-03 finished in 5944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(X(X(X(F(!p2))))&&p1)))))'
Support contains 72 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 79 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 19:10:33] [INFO ] Computed 1562 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:10:35] [INFO ] Implicit Places using invariants in 2490 ms returned []
[2025-06-05 19:10:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:10:40] [INFO ] Implicit Places using invariants and state equation in 4877 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7372 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 90 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7542 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2), true, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-05
Product exploration explored 100000 steps with 24952 reset in 373 ms.
Product exploration explored 100000 steps with 25023 reset in 384 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1481 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 879710 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 4
Probabilistic random walk after 879710 steps, saw 121861 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
// Phase 1: matrix 356 rows 1893 cols
[2025-06-05 19:10:45] [INFO ] Computed 1540 invariants in 163 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/71 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 233/304 variables, 71/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1317/1621 variables, 1198/1291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1621 variables, 968/2259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1621 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 529/2150 variables, 506/2765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2150 variables, 529/3294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2150 variables, 0/3294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 98/2248 variables, 94/3388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2248 variables, 44/3432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2248 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/2249 variables, 1/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2810 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/71 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 233/304 variables, 71/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1317/1621 variables, 1198/1291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1621 variables, 968/2259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1621 variables, 1/2260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1621 variables, 0/2260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 529/2150 variables, 506/2766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2150 variables, 529/3295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2150 variables, 0/3295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 98/2248 variables, 94/3389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2248 variables, 44/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2248 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/2249 variables, 1/3434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3434 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4789 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7779ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 4 properties in 37 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 48 out of 1893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 92 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:10:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:10:56] [INFO ] Implicit Places using invariants in 2171 ms returned []
[2025-06-05 19:10:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:11:01] [INFO ] Implicit Places using invariants and state equation in 5021 ms returned []
Implicit Place search using SMT with State Equation took 7195 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 19:11:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 30190ms
Finished structural reductions in LTL mode , in 1 iterations and 37480 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 140 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1483 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (88 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (71 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (73 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 895590 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 4
Probabilistic random walk after 895590 steps, saw 124578 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2025-06-05 19:11:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/71 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 233/304 variables, 71/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1317/1621 variables, 1198/1291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1621 variables, 968/2259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1621 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 529/2150 variables, 506/2765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2150 variables, 529/3294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2150 variables, 0/3294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 98/2248 variables, 94/3388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2248 variables, 44/3432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2248 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/2249 variables, 1/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2825 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/71 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 233/304 variables, 71/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1317/1621 variables, 1198/1291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1621 variables, 968/2259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1621 variables, 1/2260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1621 variables, 0/2260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 529/2150 variables, 506/2766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2150 variables, 529/3295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2150 variables, 0/3295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 98/2248 variables, 94/3389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2248 variables, 44/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2248 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/2249 variables, 1/3434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3434 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4764 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7604ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 4 properties in 37 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 276 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3719 reset in 480 ms.
Product exploration explored 100000 steps with 3714 reset in 494 ms.
Built C files in :
/tmp/ltsmin10230673600620375711
[2025-06-05 19:11:44] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10230673600620375711
Running compilation step : cd /tmp/ltsmin10230673600620375711;'/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 1232 ms.
Running link step : cd /tmp/ltsmin10230673600620375711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10230673600620375711;'/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/stateBased18003028598094689283.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 48 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 89 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:11:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:12:02] [INFO ] Implicit Places using invariants in 2247 ms returned []
[2025-06-05 19:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:12:07] [INFO ] Implicit Places using invariants and state equation in 4820 ms returned []
Implicit Place search using SMT with State Equation took 7069 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 19:12:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
SMT process timed out in 30176ms, After SMT, problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Finished structural reductions in LTL mode , in 1 iterations and 37339 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin16702810016405841192
[2025-06-05 19:12:37] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16702810016405841192
Running compilation step : cd /tmp/ltsmin16702810016405841192;'/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 1338 ms.
Running link step : cd /tmp/ltsmin16702810016405841192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16702810016405841192;'/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/stateBased5045920510783656540.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 19:12:52] [INFO ] Flatten gal took : 35 ms
[2025-06-05 19:12:52] [INFO ] Flatten gal took : 35 ms
[2025-06-05 19:12:52] [INFO ] Time to serialize gal into /tmp/LTL14156719545251950198.gal : 10 ms
[2025-06-05 19:12:52] [INFO ] Time to serialize properties into /tmp/LTL14955408630158205552.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/LTL14156719545251950198.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12002903278223377509.hoa' '-atoms' '/tmp/LTL14955408630158205552.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14955408630158205552.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12002903278223377509.hoa
Detected timeout of ITS tools.
[2025-06-05 19:13:07] [INFO ] Flatten gal took : 34 ms
[2025-06-05 19:13:07] [INFO ] Flatten gal took : 33 ms
[2025-06-05 19:13:07] [INFO ] Time to serialize gal into /tmp/LTL17290545048204764186.gal : 5 ms
[2025-06-05 19:13:07] [INFO ] Time to serialize properties into /tmp/LTL8105091561675560286.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/LTL17290545048204764186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8105091561675560286.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X("(((((((malicious_reservoir<1)||(s6_20<1))&&((malicious_reservoir<1)||(s6_6<1)))&&(((malicious_reservoir<1)||(s6_2<1))&&((ma...1589
Formula 0 simplified : XF(X!"(((((((malicious_reservoir<1)||(s6_20<1))&&((malicious_reservoir<1)||(s6_6<1)))&&(((malicious_reservoir<1)||(s6_2<1))&&((malic...1571
Detected timeout of ITS tools.
[2025-06-05 19:13:22] [INFO ] Flatten gal took : 33 ms
[2025-06-05 19:13:22] [INFO ] Applying decomposition
[2025-06-05 19:13:22] [INFO ] Flatten gal took : 33 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/graph17716751557094859906.txt' '-o' '/tmp/graph17716751557094859906.bin' '-w' '/tmp/graph17716751557094859906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17716751557094859906.bin' '-l' '-1' '-v' '-w' '/tmp/graph17716751557094859906.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:13:22] [INFO ] Decomposing Gal with order
[2025-06-05 19:13:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:13:22] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-05 19:13:22] [INFO ] Flatten gal took : 93 ms
[2025-06-05 19:13:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 27 ms.
[2025-06-05 19:13:23] [INFO ] Time to serialize gal into /tmp/LTL2576967254444255781.gal : 13 ms
[2025-06-05 19:13:23] [INFO ] Time to serialize properties into /tmp/LTL8661156273096437749.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/LTL2576967254444255781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8661156273096437749.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X("(((((((u0.malicious_reservoir<1)||(u22.s6_20<1))&&((u0.malicious_reservoir<1)||(u4.s6_6<1)))&&(((u0.malicious_reservoir<1)|...2273
Formula 0 simplified : XF(X!"(((((((u0.malicious_reservoir<1)||(u22.s6_20<1))&&((u0.malicious_reservoir<1)||(u4.s6_6<1)))&&(((u0.malicious_reservoir<1)||(u...2255
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-05 finished in 184708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1)) U !p2))'
Support contains 1128 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 20 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 19:13:38] [INFO ] Computed 1562 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:13:39] [INFO ] Implicit Places using invariants in 989 ms returned []
[2025-06-05 19:13:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:13:44] [INFO ] Implicit Places using invariants and state equation in 5077 ms returned []
Implicit Place search using SMT with State Equation took 6068 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2025-06-05 19:13:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in LTL mode , in 1 iterations and 66305 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 125 ms :[p2, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-06
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-06 finished in 66460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(F(p2))))'
Support contains 26 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 91 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:14:47] [INFO ] Implicit Places using invariants in 2397 ms returned []
[2025-06-05 19:14:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:14:51] [INFO ] Implicit Places using invariants and state equation in 4586 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6988 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 88 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7167 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-07
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-07 finished in 7295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p1&&(p2||G(F(p3))))))&&p0)))'
Support contains 31 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 196 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2025-06-05 19:14:52] [INFO ] Computed 1540 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:14:54] [INFO ] Implicit Places using invariants in 2244 ms returned []
[2025-06-05 19:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:14:58] [INFO ] Implicit Places using invariants and state equation in 4521 ms returned [1154, 1155, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1180, 1182, 1183, 1184, 1185, 1850, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6767 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1916 places, 353/356 transitions.
Applied a total of 0 rules in 89 ms. Remains 1845 /1845 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7053 ms. Remains : 1845/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-08
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-08 finished in 7337 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)&&G((X(p2)||p1))))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 83 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2025-06-05 19:14:59] [INFO ] Computed 1562 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:01] [INFO ] Implicit Places using invariants in 2457 ms returned []
[2025-06-05 19:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:09] [INFO ] Implicit Places using invariants and state equation in 7928 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1185, 1186]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 10394 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1916 places, 356/356 transitions.
Applied a total of 0 rules in 82 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10560 ms. Remains : 1894/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-09
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-09 finished in 10751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F((G(p1)||(p1&&F(p0)))))))))'
Support contains 48 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 88 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:15:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:12] [INFO ] Implicit Places using invariants in 2379 ms returned []
[2025-06-05 19:15:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:20] [INFO ] Implicit Places using invariants and state equation in 8094 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10477 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 83 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10650 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-11
Product exploration explored 100000 steps with 3720 reset in 239 ms.
Product exploration explored 100000 steps with 3704 reset in 263 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-11 finished in 11695 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&&F(G(p1))))&&(X(X(!p1)) U ((p0&&X(X(!p1)))||X(X(G(!p1)))))))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 91 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:15:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:24] [INFO ] Implicit Places using invariants in 2418 ms returned []
[2025-06-05 19:15:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:31] [INFO ] Implicit Places using invariants and state equation in 7697 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10119 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 85 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10296 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, true, true, (NOT p1), p1, p1, p1]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-12
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-12 finished in 10560 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((X(X(G(p1)))||G(p2))))) U X(p1)))'
Support contains 26 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 94 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:34] [INFO ] Implicit Places using invariants in 2322 ms returned []
[2025-06-05 19:15:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:43] [INFO ] Implicit Places using invariants and state equation in 8656 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 10983 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 82 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11160 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-13
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-13 finished in 11602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(G(p0) U (!p1 U (X(p2)||p3)))||F(p2)))))'
Support contains 51 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 99 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-06-05 19:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:46] [INFO ] Implicit Places using invariants in 2393 ms returned []
[2025-06-05 19:15:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:50] [INFO ] Implicit Places using invariants and state equation in 4454 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 6853 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1916 places, 356/356 transitions.
Applied a total of 0 rules in 84 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7036 ms. Remains : 1894/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 276 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND p0 (NOT p2) p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 369 ms.
Product exploration explored 100000 steps with 33333 reset in 377 ms.
Computed a total of 1894 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1894 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 19 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-15 finished in 8389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X((G(p1)||G(p2)))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-22-LTLFireability-00
Stuttering acceptance computed with spot in 420 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.9 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1890 transition count 352
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1890 transition count 352
Applied a total of 4 rules in 163 ms. Remains 1890 /1916 variables (removed 26) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2025-06-05 19:15:52] [INFO ] Computed 1540 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:54] [INFO ] Implicit Places using invariants in 1509 ms returned []
[2025-06-05 19:15:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:15:57] [INFO ] Implicit Places using invariants and state equation in 3392 ms returned [1849, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4906 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1867/1916 places, 352/356 transitions.
Applied a total of 0 rules in 51 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5120 ms. Remains : 1867/1916 places, 352/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-00
Product exploration explored 100000 steps with 3472 reset in 1358 ms.
Product exploration explored 100000 steps with 3473 reset in 1386 ms.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 142 ms. Reduced automaton from 12 states, 33 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1389 resets) in 1536 ms. (26 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 517835 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 23
Probabilistic random walk after 517835 steps, saw 73269 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
// Phase 1: matrix 352 rows 1867 cols
[2025-06-05 19:16:05] [INFO ] Computed 1518 invariants in 23 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 53/653 variables, 550/550 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 499/1152 variables, 484/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem apf1 is UNSAT
At refinement iteration 7 (OVERLAPS) 761/2193 variables, 691/2877 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SMT process timed out in 5092ms, After SMT, problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1867 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 1867 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 1866 transition count 349
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 1 with 46 rules applied. Total rules applied 50 place count 1866 transition count 303
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 96 place count 1820 transition count 303
Applied a total of 96 rules in 104 ms. Remains 1820 /1867 variables (removed 47) and now considering 303/352 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 1820/1867 places, 303/352 transitions.
RANDOM walk for 40000 steps (1442 resets) in 1365 ms. (29 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 431443 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 22
Probabilistic random walk after 431443 steps, saw 64422 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
// Phase 1: matrix 303 rows 1820 cols
[2025-06-05 19:16:14] [INFO ] Computed 1518 invariants in 9 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
Problem apf18 is UNSAT
At refinement iteration 6 (OVERLAPS) 691/2123 variables, 668/2854 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2123 variables, 484/3338 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2123 variables, 0/3338 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/2123 variables, 0/3338 constraints. Problems are: Problem set: 4 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2123/2123 variables, and 3338 constraints, problems are : Problem set: 4 solved, 18 unsolved in 15778 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 22/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 18 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 691/2123 variables, 668/2854 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2123 variables, 484/3338 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2123 variables, 1/3339 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2123 variables, 0/3339 constraints. Problems are: Problem set: 4 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2123/2123 variables, and 3339 constraints, problems are : Problem set: 4 solved, 18 unsolved in 45021 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60863ms problems are : Problem set: 4 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1820/1820 places, 303/303 transitions.
Applied a total of 0 rules in 48 ms. Remains 1820 /1820 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1820/1820 places, 303/303 transitions.
RANDOM walk for 40000 steps (1438 resets) in 1397 ms. (28 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 465764 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 18
Probabilistic random walk after 465764 steps, saw 69815 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-05 19:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 691/2123 variables, 668/2854 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2123 variables, 484/3338 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2123 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/2123 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2123/2123 variables, and 3338 constraints, problems are : Problem set: 0 solved, 18 unsolved in 15440 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 691/2123 variables, 668/2854 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2123 variables, 484/3338 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2123 variables, 1/3339 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2123 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/2123 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2123/2123 variables, and 3339 constraints, problems are : Problem set: 0 solved, 18 unsolved in 75014 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 18/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90515ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 3 different solutions.
Parikh walk visited 16 properties in 228 ms.
Support contains 600 out of 1820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1820/1820 places, 303/303 transitions.
Applied a total of 0 rules in 33 ms. Remains 1820 /1820 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1820/1820 places, 303/303 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0)), (F (G p2)), (F (G p1)), (F (G p0)), (G (OR p2 p1)), (G (OR p2 p0 p1)), (G (OR (NOT p2) p0 p1)), (G (OR p2 (NOT p0) p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0))), (F (NOT (AND p2 p0))), (F (NOT (AND p2 p0 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 1704 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 395 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 41 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 1867 cols
[2025-06-05 19:18:52] [INFO ] Computed 1518 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:18:53] [INFO ] Implicit Places using invariants in 1508 ms returned []
[2025-06-05 19:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:18:56] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 4083 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-05 19:18:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2196/2219 variables, and 3362 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2196 variables, 305/3667 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2196/2219 variables, and 3667 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Finished structural reductions in LTL mode , in 1 iterations and 64321 ms. Remains : 1867/1867 places, 352/352 transitions.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 p1 p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1390 resets) in 1117 ms. (35 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 657 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (51 resets) in 629 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 595 ms. (67 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 629 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 640 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 769 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 630 ms. (63 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 515541 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 10
Probabilistic random walk after 515541 steps, saw 72941 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2025-06-05 19:20:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 53/653 variables, 550/550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 499/1152 variables, 484/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 761/2193 variables, 691/2877 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2193 variables, 484/3361 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2193 variables, 0/3361 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 5036ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1867 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 1867 transition count 349
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 1866 transition count 349
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 1 with 46 rules applied. Total rules applied 50 place count 1866 transition count 303
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 96 place count 1820 transition count 303
Applied a total of 96 rules in 101 ms. Remains 1820 /1867 variables (removed 47) and now considering 303/352 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1820/1867 places, 303/352 transitions.
RANDOM walk for 40000 steps (1439 resets) in 869 ms. (45 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (53 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 659 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 617 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 593 ms. (67 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 652 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 647 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (48 resets) in 767 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 625 ms. (63 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 482940 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 10
Probabilistic random walk after 482940 steps, saw 72694 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
// Phase 1: matrix 303 rows 1820 cols
[2025-06-05 19:20:11] [INFO ] Computed 1518 invariants in 8 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 691/2123 variables, 668/2854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2123 variables, 484/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2123 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/2123 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2123/2123 variables, and 3338 constraints, problems are : Problem set: 0 solved, 10 unsolved in 11575 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 691/2123 variables, 668/2854 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2123 variables, 484/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2123 variables, 1/3339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2123 variables, 0/3339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2123/2123 variables, and 3339 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45019 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1820/1820 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56634ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 600 out of 1820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1820/1820 places, 303/303 transitions.
Applied a total of 0 rules in 38 ms. Remains 1820 /1820 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1820/1820 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1820/1820 places, 303/303 transitions.
Applied a total of 0 rules in 32 ms. Remains 1820 /1820 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2025-06-05 19:21:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:21:09] [INFO ] Implicit Places using invariants in 1682 ms returned []
[2025-06-05 19:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:21:12] [INFO ] Implicit Places using invariants and state equation in 2731 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4422 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1819/1820 places, 303/303 transitions.
Applied a total of 0 rules in 37 ms. Remains 1819 /1819 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4491 ms. Remains : 1819/1820 places, 303/303 transitions.
RANDOM walk for 40000 steps (1437 resets) in 927 ms. (43 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 654 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (55 resets) in 616 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (53 resets) in 585 ms. (68 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 625 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 635 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 763 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 625 ms. (63 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 535998 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 10
Probabilistic random walk after 535998 steps, saw 80491 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
// Phase 1: matrix 303 rows 1819 cols
[2025-06-05 19:21:17] [INFO ] Computed 1518 invariants in 8 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 690/2122 variables, 667/2853 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 484/3337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/2122 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2122/2122 variables, and 3337 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6938 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1819/1819 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 552/1152 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1152 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 280/1432 variables, 1152/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1432 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 690/2122 variables, 667/2853 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 484/3337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 1/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2122 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/2122 variables, 0/3338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2122/2122 variables, and 3338 constraints, problems are : Problem set: 0 solved, 10 unsolved in 74008 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1819/1819 constraints, PredecessorRefiner: 10/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 80988ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 6 different solutions.
Finished Parikh walk after 94 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 444 ms.
Knowledge obtained : [(AND p2 p1 p0), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p2) p0))), (F (NOT p1)), (F (NOT (AND p2 p1 p0))), (F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 4 factoid took 441 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 11 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 407 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 399 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3472 reset in 1025 ms.
Product exploration explored 100000 steps with 3473 reset in 1047 ms.
Applying partial POR strategy [true, true, true, false, false, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 402 ms :[true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 58 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:22:42] [INFO ] Redundant transitions in 23 ms returned []
Running 305 sub problems to find dead transitions.
// Phase 1: matrix 352 rows 1867 cols
[2025-06-05 19:22:42] [INFO ] Computed 1518 invariants in 15 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2196/2219 variables, and 3362 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2196 variables, 305/3667 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2196/2219 variables, and 3667 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60302 ms. Remains : 1867/1867 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin9619480381560316781
[2025-06-05 19:23:43] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9619480381560316781
Running compilation step : cd /tmp/ltsmin9619480381560316781;'/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 1315 ms.
Running link step : cd /tmp/ltsmin9619480381560316781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9619480381560316781;'/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/stateBased6484281864418482972.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 600 out of 1867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 39 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2025-06-05 19:23:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:23:59] [INFO ] Implicit Places using invariants in 1549 ms returned []
[2025-06-05 19:23:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:24:02] [INFO ] Implicit Places using invariants and state equation in 2796 ms returned []
Implicit Place search using SMT with State Equation took 4346 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2025-06-05 19:24:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2196/2219 variables, and 3362 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1844 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 352/2196 variables, 1844/3362 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2196 variables, 305/3667 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2196/2219 variables, and 3667 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1844/1867 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Finished structural reductions in LTL mode , in 1 iterations and 64616 ms. Remains : 1867/1867 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin15045751391426242648
[2025-06-05 19:25:02] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15045751391426242648
Running compilation step : cd /tmp/ltsmin15045751391426242648;'/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 1384 ms.
Running link step : cd /tmp/ltsmin15045751391426242648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15045751391426242648;'/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/stateBased6310760528531911172.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 19:25:17] [INFO ] Flatten gal took : 34 ms
[2025-06-05 19:25:18] [INFO ] Flatten gal took : 36 ms
[2025-06-05 19:25:18] [INFO ] Time to serialize gal into /tmp/LTL4798773984165944110.gal : 5 ms
[2025-06-05 19:25:18] [INFO ] Time to serialize properties into /tmp/LTL17243328846961416439.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/LTL4798773984165944110.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8290064172273922766.hoa' '-atoms' '/tmp/LTL17243328846961416439.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/LTL17243328846961416439.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8290064172273922766.hoa
Detected timeout of ITS tools.
[2025-06-05 19:25:33] [INFO ] Flatten gal took : 34 ms
[2025-06-05 19:25:33] [INFO ] Flatten gal took : 39 ms
[2025-06-05 19:25:33] [INFO ] Time to serialize gal into /tmp/LTL3409225777930044603.gal : 5 ms
[2025-06-05 19:25:33] [INFO ] Time to serialize properties into /tmp/LTL7597048641667089684.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3409225777930044603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7597048641667089684.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((n7_7_16<1)||(n7_8_16<1))||((n7_9_16<1)||(n7_10_16<1)))||(((n7_3_16<1)||(n7_4_16<1))||((n7_5_16<1)||(n7_6_16<1))))|...9644
Formula 0 simplified : X(F!"(((((((((((n7_7_16<1)||(n7_8_16<1))||((n7_9_16<1)||(n7_10_16<1)))||(((n7_3_16<1)||(n7_4_16<1))||((n7_5_16<1)||(n7_6_16<1))))||(...9630
Detected timeout of ITS tools.
[2025-06-05 19:25:48] [INFO ] Flatten gal took : 36 ms
[2025-06-05 19:25:48] [INFO ] Applying decomposition
[2025-06-05 19:25:48] [INFO ] Flatten gal took : 34 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/graph3601067298224614720.txt' '-o' '/tmp/graph3601067298224614720.bin' '-w' '/tmp/graph3601067298224614720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3601067298224614720.bin' '-l' '-1' '-v' '-w' '/tmp/graph3601067298224614720.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:25:48] [INFO ] Decomposing Gal with order
[2025-06-05 19:25:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:25:48] [INFO ] Removed a total of 253 redundant transitions.
[2025-06-05 19:25:48] [INFO ] Flatten gal took : 101 ms
[2025-06-05 19:25:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 31 ms.
[2025-06-05 19:25:48] [INFO ] Time to serialize gal into /tmp/LTL16534850371486205283.gal : 11 ms
[2025-06-05 19:25:48] [INFO ] Time to serialize properties into /tmp/LTL5593160781230498048.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/LTL16534850371486205283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5593160781230498048.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((i32.u44.n7_7_16<1)||(i31.u78.n7_8_16<1))||((i44.u41.n7_9_16<1)||(i38.u40.n7_10_16<1)))||(((i18.u37.n7_3_16<1)||(i3...14496
Formula 0 simplified : X(F!"(((((((((((i32.u44.n7_7_16<1)||(i31.u78.n7_8_16<1))||((i44.u41.n7_9_16<1)||(i38.u40.n7_10_16<1)))||(((i18.u37.n7_3_16<1)||(i36....14482
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-00 finished in 611559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U G((!p1||G(!p2)))))'
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((!(p1 U !p2)||p0))&&!(F(!p2) U p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(X(X(X(F(!p2))))&&p1)))))'
[2025-06-05 19:26:04] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4163749958488143570
[2025-06-05 19:26:04] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2025-06-05 19:26:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:26:04] [INFO ] Applying decomposition
[2025-06-05 19:26:04] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2025-06-05 19:26:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:26:04] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2025-06-05 19:26:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:26:04] [INFO ] Flatten gal took : 38 ms
[2025-06-05 19:26:04] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4163749958488143570
Running compilation step : cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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'
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/graph12323649360721059995.txt' '-o' '/tmp/graph12323649360721059995.bin' '-w' '/tmp/graph12323649360721059995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12323649360721059995.bin' '-l' '-1' '-v' '-w' '/tmp/graph12323649360721059995.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:26:04] [INFO ] Decomposing Gal with order
[2025-06-05 19:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:26:04] [INFO ] Removed a total of 228 redundant transitions.
[2025-06-05 19:26:04] [INFO ] Flatten gal took : 90 ms
[2025-06-05 19:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 51 ms.
[2025-06-05 19:26:04] [INFO ] Time to serialize gal into /tmp/LTLFireability9092354222750727566.gal : 12 ms
[2025-06-05 19:26:04] [INFO ] Time to serialize properties into /tmp/LTLFireability15150969943100736984.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9092354222750727566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15150969943100736984.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((X((G("(((((((((((i33.i0.u45.n7_7_16<1)||(i39.u160.n7_8_16<1))||((i12.i0.u41.n7_9_16<1)||(i21.i0.u40.n7_10_16<1)))||(((i40.u105.n7_3...15761
Formula 0 simplified : X(F!"(((((((((((i33.i0.u45.n7_7_16<1)||(i39.u160.n7_8_16<1))||((i12.i0.u41.n7_9_16<1)||(i21.i0.u40.n7_10_16<1)))||(((i40.u105.n7_3_1...15747
Compilation finished in 1603 ms.
Running link step : cd /tmp/ltsmin4163749958488143570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X(([]((LTLAPp1==true))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X(([]((LTLAPp1==true))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(!(LTLAPp3==true))) U []((!(LTLAPp4==true)||[](!(LTLAPp5==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(!(LTLAPp3==true))) U []((!(LTLAPp4==true)||[](!(LTLAPp5==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((!((LTLAPp4==true) U !(LTLAPp2==true))||(LTLAPp6==true)))&&!(<>(!(LTLAPp2==true)) U (LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((!((LTLAPp4==true) U !(LTLAPp2==true))||(LTLAPp6==true)))&&!(<>(!(LTLAPp2==true)) U (LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp7==true))||(X(X(X(<>(!(LTLAPp5==true)))))&&(LTLAPp8==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp7==true))||(X(X(X(<>(!(LTLAPp5==true)))))&&(LTLAPp8==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin4163749958488143570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X(([]((LTLAPp1==true))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-22, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254700812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;