About the Execution of ITS-Tools for PermAdmissibility-PT-05
| 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?FT?TFTTF??FFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812700515.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 PermAdmissibility-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812700515
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 252K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 654K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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 336K 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 PermAdmissibility-PT-05-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748906222750
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 23:17:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 23:17:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 23:17:04] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-06-02 23:17:04] [INFO ] Transformed 168 places.
[2025-06-02 23:17:04] [INFO ] Transformed 592 transitions.
[2025-06-02 23:17:04] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-PT-05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 592
Applied a total of 24 rules in 25 ms. Remains 144 /168 variables (removed 24) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 144 cols
[2025-06-02 23:17:04] [INFO ] Computed 21 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:17:04] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-06-02 23:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:17:05] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2025-06-02 23:17:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 25/128 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 16/144 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (OVERLAPS) 592/736 variables, 144/165 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (OVERLAPS) 0/736 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 736/736 variables, and 165 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 25/128 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:39] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:40] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:40] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:40] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:40] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:40] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:40] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:40] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:41] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:43] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:43] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:43] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:46] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:46] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:46] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:46] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:46] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:48] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:49] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:49] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:49] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:49] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:49] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:49] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:49] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:50] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:50] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:52] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:52] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:52] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:52] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:55] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:55] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:55] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:57] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:57] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:58] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:58] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:17:58] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:00] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:00] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:18:00] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 12 (OVERLAPS) 16/144 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 144/736 variables, and 63 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/144 constraints, PredecessorRefiner: 0/588 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60939ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 60972ms
Starting structural reductions in LTL mode, iteration 1 : 144/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61806 ms. Remains : 144/168 places, 592/592 transitions.
Support contains 97 out of 144 places after structural reductions.
[2025-06-02 23:18:06] [INFO ] Flatten gal took : 79 ms
[2025-06-02 23:18:06] [INFO ] Flatten gal took : 50 ms
[2025-06-02 23:18:06] [INFO ] Input system was already deterministic with 592 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 24017 steps (247 resets) in 342 ms. (70 steps per ms) remains 0/34 properties
FORMULA PermAdmissibility-PT-05-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-PT-05-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 144 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 592
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' '!((F((X(p0)&&F(!p0))) U X(X((p1 U p2)))))'
Support contains 7 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 66 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 92 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 116 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 140 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 52 transition count 92
Applied a total of 144 rules in 17 ms. Remains 52 /144 variables (removed 92) and now considering 92/592 (removed 500) transitions.
// Phase 1: matrix 92 rows 52 cols
[2025-06-02 23:18:07] [INFO ] Computed 16 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:18:07] [INFO ] Implicit Places using invariants in 54 ms returned [0, 5, 19, 26]
[2025-06-02 23:18:07] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/144 places, 92/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 49/144 places, 92/592 transitions.
Stuttering acceptance computed with spot in 546 ms :[(NOT p0), p0, (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-02
Product exploration explored 100000 steps with 2234 reset in 582 ms.
Product exploration explored 100000 steps with 2234 reset in 403 ms.
Computed a total of 49 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 92
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) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1148 ms. Reduced automaton from 10 states, 22 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[p0, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 21348 steps (219 resets) in 186 ms. (114 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0)]
Knowledge based reduction with 14 factoid took 2755 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[p0, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 359 ms :[p0, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 92 rows 49 cols
[2025-06-02 23:18:14] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:18:14] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2025-06-02 23:18:14] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 23:18:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:18:14] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2025-06-02 23:18:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 23:18:14] [INFO ] Computed and/alt/rep : 18/93/18 causal constraints (skipped 70 transitions) in 10 ms.
[2025-06-02 23:18:14] [INFO ] Added : 11 causal constraints over 3 iterations in 69 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2025-06-02 23:18:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:18:14] [INFO ] Implicit Places using invariants in 48 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/49 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 48/49 places, 92/92 transitions.
Computed a total of 48 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 92
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) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 497 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[p0, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 20845 steps (213 resets) in 62 ms. (330 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p2))), (F p0)]
Knowledge based reduction with 10 factoid took 2405 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[p0, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 375 ms :[p0, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 92 rows 48 cols
[2025-06-02 23:18:18] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:18:18] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2025-06-02 23:18:18] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 23:18:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:18:18] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 23:18:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 23:18:18] [INFO ] Computed and/alt/rep : 19/94/19 causal constraints (skipped 69 transitions) in 10 ms.
[2025-06-02 23:18:18] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 326 ms :[p0, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 2263 reset in 375 ms.
Product exploration explored 100000 steps with 2247 reset in 373 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 363 ms :[p0, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) p0), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 7 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 92/92 transitions.
Graph (complete) has 205 edges and 48 vertex of which 39 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 35 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 35 transition count 67
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 31 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 31 transition count 47
Applied a total of 17 rules in 15 ms. Remains 31 /48 variables (removed 17) and now considering 47/92 (removed 45) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:18:20] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 47 rows 31 cols
[2025-06-02 23:18:20] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 47/78 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 41 constraints, problems are : Problem set: 0 solved, 43 unsolved in 546 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 47/78 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 43/84 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 84 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1512 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2070ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/48 places, 47/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2091 ms. Remains : 31/48 places, 47/92 transitions.
Built C files in :
/tmp/ltsmin7314653599577945248
[2025-06-02 23:18:22] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7314653599577945248
Running compilation step : cd /tmp/ltsmin7314653599577945248;'/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 312 ms.
Running link step : cd /tmp/ltsmin7314653599577945248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7314653599577945248;'/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/stateBased11663698194373139056.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 48 cols
[2025-06-02 23:18:37] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:18:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-02 23:18:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:18:37] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-02 23:18:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 92/140 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/140 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 60 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1334 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 92/140 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 88/148 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 148 constraints, problems are : Problem set: 0 solved, 88 unsolved in 8258 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9614ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 9616ms
Finished structural reductions in LTL mode , in 1 iterations and 9756 ms. Remains : 48/48 places, 92/92 transitions.
Built C files in :
/tmp/ltsmin5341086762896908374
[2025-06-02 23:18:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5341086762896908374
Running compilation step : cd /tmp/ltsmin5341086762896908374;'/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 203 ms.
Running link step : cd /tmp/ltsmin5341086762896908374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5341086762896908374;'/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/stateBased12119983479796545601.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:19:02] [INFO ] Flatten gal took : 7 ms
[2025-06-02 23:19:02] [INFO ] Flatten gal took : 6 ms
[2025-06-02 23:19:02] [INFO ] Time to serialize gal into /tmp/LTL6161269872568126460.gal : 2 ms
[2025-06-02 23:19:02] [INFO ] Time to serialize properties into /tmp/LTL13568920713539898.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6161269872568126460.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3731301676678070444.hoa' '-atoms' '/tmp/LTL13568920713539898.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...315
Loading property file /tmp/LTL13568920713539898.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3731301676678070444.hoa
Detected timeout of ITS tools.
[2025-06-02 23:19:17] [INFO ] Flatten gal took : 7 ms
[2025-06-02 23:19:17] [INFO ] Flatten gal took : 6 ms
[2025-06-02 23:19:17] [INFO ] Time to serialize gal into /tmp/LTL13601697890736314123.gal : 1 ms
[2025-06-02 23:19:17] [INFO ] Time to serialize properties into /tmp/LTL17546867778473047303.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/LTL13601697890736314123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17546867778473047303.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 : !(((F((X("(((aux8_7+aux8_3)+(aux8_6+aux8_2))>=2)"))&&(F("(((aux8_7+aux8_3)+(aux8_6+aux8_2))<2)"))))U(X(X(("(c15>=1)")U("((in2_2+in2_3)...168
Formula 0 simplified : G(X!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>=2)" | G!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))<2)") R XX(!"(c15>=1)" R !"((in2_2+in2_3)<=c15)"...156
Detected timeout of ITS tools.
[2025-06-02 23:19:32] [INFO ] Flatten gal took : 9 ms
[2025-06-02 23:19:32] [INFO ] Applying decomposition
[2025-06-02 23:19:32] [INFO ] Flatten gal took : 7 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/graph6931021462930039622.txt' '-o' '/tmp/graph6931021462930039622.bin' '-w' '/tmp/graph6931021462930039622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6931021462930039622.bin' '-l' '-1' '-v' '-w' '/tmp/graph6931021462930039622.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:19:32] [INFO ] Decomposing Gal with order
[2025-06-02 23:19:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:19:32] [INFO ] Removed a total of 115 redundant transitions.
[2025-06-02 23:19:32] [INFO ] Flatten gal took : 42 ms
[2025-06-02 23:19:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 5 ms.
[2025-06-02 23:19:32] [INFO ] Time to serialize gal into /tmp/LTL15932245997233335118.gal : 2 ms
[2025-06-02 23:19:32] [INFO ] Time to serialize properties into /tmp/LTL8017520122702119081.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/LTL15932245997233335118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8017520122702119081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F((X("(((gu1.aux8_7+gu1.aux8_3)+(gu1.aux8_6+gu1.aux8_2))>=2)"))&&(F("(((gu1.aux8_7+gu1.aux8_3)+(gu1.aux8_6+gu1.aux8_2))<2)"))))U(X...216
Formula 0 simplified : G(X!"(((gu1.aux8_7+gu1.aux8_3)+(gu1.aux8_6+gu1.aux8_2))>=2)" | G!"(((gu1.aux8_7+gu1.aux8_3)+(gu1.aux8_6+gu1.aux8_2))<2)") R XX(!"(gu...204
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-05-LTLCardinality-02 finished in 100804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||X(F((X(F(p3))&&p2))))))))'
Support contains 14 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 66 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 92 place count 78 transition count 344
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 111 place count 59 transition count 138
Iterating global reduction 1 with 19 rules applied. Total rules applied 130 place count 59 transition count 138
Applied a total of 130 rules in 14 ms. Remains 59 /144 variables (removed 85) and now considering 138/592 (removed 454) transitions.
// Phase 1: matrix 138 rows 59 cols
[2025-06-02 23:19:47] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:19:48] [INFO ] Implicit Places using invariants in 57 ms returned [0, 5, 19, 30]
[2025-06-02 23:19:48] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/144 places, 138/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 56/144 places, 138/592 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-03
Stuttering criterion allowed to conclude after 114 steps with 1 reset in 3 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-03 finished in 304 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(((X(p1)||p0) U p2)) U X(X(X(!p1)))))'
Support contains 23 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 120 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 38 place count 106 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 52 place count 106 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 66 place count 92 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 92 transition count 242
Applied a total of 80 rules in 14 ms. Remains 92 /144 variables (removed 52) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 92 cols
[2025-06-02 23:19:48] [INFO ] Computed 18 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:19:48] [INFO ] Implicit Places using invariants in 107 ms returned [0, 18, 47, 58]
[2025-06-02 23:19:48] [INFO ] Actually due to overlaps returned [0, 18, 47]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 109 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/144 places, 242/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 89/144 places, 242/592 transitions.
Stuttering acceptance computed with spot in 451 ms :[p1, false, p1, p1, p1, true, false, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 171 ms.
Product exploration explored 100000 steps with 25000 reset in 173 ms.
Computed a total of 89 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 89 transition count 242
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 p0 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 393 ms. Reduced automaton from 12 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[p1, p1, true, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
RANDOM walk for 40012 steps (412 resets) in 116 ms. (341 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
// Phase 1: matrix 242 rows 89 cols
[2025-06-02 23:19:50] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 23/331 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 (NOT p1) p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 10 factoid took 1030 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[p1, p1, true, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 318 ms :[p1, p1, true, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
Support contains 23 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-02 23:19:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:19:51] [INFO ] Implicit Places using invariants in 85 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/89 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 88/89 places, 242/242 transitions.
Computed a total of 88 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 242
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 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[p1, p1, true, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
RANDOM walk for 6437 steps (65 resets) in 25 ms. (247 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p2 p0))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 410 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[p1, p1, true, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 371 ms :[p1, p1, true, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 333 ms :[p1, p1, true, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 156 ms.
Product exploration explored 100000 steps with 25000 reset in 159 ms.
Applying partial POR strategy [false, false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 340 ms :[p1, p1, true, p1, p1, (NOT p1), (NOT p2), (NOT p2)]
Support contains 23 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 88 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 87 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 87 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 27 ms. Remains 87 /88 variables (removed 1) and now considering 241/242 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:19:54] [INFO ] Redundant transitions in 9 ms returned []
Running 237 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 87 cols
[2025-06-02 23:19:54] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 17/87 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Problem TDEAD176 is UNSAT
At refinement iteration 4 (OVERLAPS) 241/328 variables, 87/101 constraints. Problems are: Problem set: 1 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 101 constraints, problems are : Problem set: 1 solved, 236 unsolved in 5885 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 18/87 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 241/328 variables, 87/101 constraints. Problems are: Problem set: 1 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 236/337 constraints. Problems are: Problem set: 1 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 337 constraints, problems are : Problem set: 1 solved, 236 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 236/237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36049ms problems are : Problem set: 1 solved, 236 unsolved
Search for dead transitions found 1 dead transitions in 36050ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/88 places, 240/242 transitions.
Graph (complete) has 581 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 86 /87 variables (removed 1) and now considering 240/240 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/88 places, 240/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36104 ms. Remains : 86/88 places, 240/242 transitions.
Built C files in :
/tmp/ltsmin10568328856330002242
[2025-06-02 23:20:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10568328856330002242
Running compilation step : cd /tmp/ltsmin10568328856330002242;'/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 397 ms.
Running link step : cd /tmp/ltsmin10568328856330002242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10568328856330002242;'/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/stateBased4064849490271363166.hoa' '--buchi-type=spotba'
LTSmin run took 245 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-05-LTLCardinality-04 finished in 43280 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)&&F(((X(p1)&&F(p2))||G(p1)))))'
Support contains 26 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 112 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 98 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 74 place count 84 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 88 place count 84 transition count 242
Applied a total of 88 rules in 9 ms. Remains 84 /144 variables (removed 60) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 84 cols
[2025-06-02 23:20:31] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:20:31] [INFO ] Implicit Places using invariants in 100 ms returned [0, 11, 39, 50]
[2025-06-02 23:20:31] [INFO ] Actually due to overlaps returned [0, 11, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 102 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/144 places, 242/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 81/144 places, 242/592 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-05
Product exploration explored 100000 steps with 3763 reset in 461 ms.
Product exploration explored 100000 steps with 3705 reset in 522 ms.
Computed a total of 81 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 242
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) p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 731 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 316 steps (0 resets) in 4 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 841 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 242 rows 81 cols
[2025-06-02 23:20:34] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:20:34] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-02 23:20:34] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-06-02 23:20:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:20:34] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-02 23:20:35] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 23:20:35] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 210 transitions) in 23 ms.
[2025-06-02 23:20:35] [INFO ] Added : 17 causal constraints over 4 iterations in 111 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 242/242 transitions.
Applied a total of 0 rules in 11 ms. Remains 81 /81 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-02 23:20:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:20:35] [INFO ] Implicit Places using invariants in 78 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/81 places, 242/242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 80 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 79 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 79 transition count 240
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 78 transition count 240
Applied a total of 4 rules in 19 ms. Remains 78 /80 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 78 cols
[2025-06-02 23:20:35] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:20:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 23:20:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:20:35] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/81 places, 240/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 78/81 places, 240/242 transitions.
Computed a total of 78 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 240
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 249 steps (0 resets) in 6 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
[2025-06-02 23:20:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:20:36] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 9 ms returned sat
[2025-06-02 23:20:36] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-02 23:20:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:20:36] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 18 ms returned sat
[2025-06-02 23:20:36] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-06-02 23:20:36] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 208 transitions) in 23 ms.
[2025-06-02 23:20:36] [INFO ] Added : 20 causal constraints over 5 iterations in 132 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2348 reset in 483 ms.
Product exploration explored 100000 steps with 2358 reset in 482 ms.
Built C files in :
/tmp/ltsmin8348573604737404904
[2025-06-02 23:20:37] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-02 23:20:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:20:37] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-02 23:20:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:20:37] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-02 23:20:37] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:20:37] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8348573604737404904
Running compilation step : cd /tmp/ltsmin8348573604737404904;'/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 519 ms.
Running link step : cd /tmp/ltsmin8348573604737404904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8348573604737404904;'/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/stateBased5369018010725635842.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 240/240 transitions.
Graph (complete) has 565 edges and 78 vertex of which 68 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 12 ms. Remains 68 /78 variables (removed 10) and now considering 224/240 (removed 16) transitions.
// Phase 1: matrix 224 rows 68 cols
[2025-06-02 23:20:52] [INFO ] Computed 12 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:20:52] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 23:20:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:20:52] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:20:52] [INFO ] Redundant transitions in 3 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-02 23:20:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 9/68 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 224/292 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 80 constraints, problems are : Problem set: 0 solved, 220 unsolved in 6279 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 9/68 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:00] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:00] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:00] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:00] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:00] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:00] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:21:01] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 224/292 variables, 68/91 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 220/311 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 311 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36394ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 36394ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/78 places, 224/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36664 ms. Remains : 68/78 places, 224/240 transitions.
Built C files in :
/tmp/ltsmin996580790458618868
[2025-06-02 23:21:29] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2025-06-02 23:21:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:21:29] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2025-06-02 23:21:29] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:21:29] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2025-06-02 23:21:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:21:29] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin996580790458618868
Running compilation step : cd /tmp/ltsmin996580790458618868;'/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 495 ms.
Running link step : cd /tmp/ltsmin996580790458618868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin996580790458618868;'/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/stateBased1794547195696013917.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:21:44] [INFO ] Flatten gal took : 15 ms
[2025-06-02 23:21:44] [INFO ] Flatten gal took : 14 ms
[2025-06-02 23:21:44] [INFO ] Time to serialize gal into /tmp/LTL353004553656152483.gal : 3 ms
[2025-06-02 23:21:44] [INFO ] Time to serialize properties into /tmp/LTL13925079899033131036.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/LTL353004553656152483.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13748904331556367571.hoa' '-atoms' '/tmp/LTL13925079899033131036.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/LTL13925079899033131036.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13748904331556367571.hoa
Detected timeout of ITS tools.
[2025-06-02 23:21:59] [INFO ] Flatten gal took : 14 ms
[2025-06-02 23:21:59] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:21:59] [INFO ] Time to serialize gal into /tmp/LTL3205715692765326965.gal : 4 ms
[2025-06-02 23:21:59] [INFO ] Time to serialize properties into /tmp/LTL10281348447262334108.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/LTL3205715692765326965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10281348447262334108.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4)))>((aux8_7+aux8_3)+(aux8_6+aux8_2)))"))&&(F((G("((in1_1+in...351
Formula 0 simplified : G!"((((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4)))>((aux8_7+aux8_3)+(aux8_6+aux8_2)))" | G(F!"((in1_1+in1_0)>...337
Detected timeout of ITS tools.
[2025-06-02 23:22:14] [INFO ] Flatten gal took : 14 ms
[2025-06-02 23:22:14] [INFO ] Applying decomposition
[2025-06-02 23:22:14] [INFO ] Flatten gal took : 10 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/graph8648160370340251691.txt' '-o' '/tmp/graph8648160370340251691.bin' '-w' '/tmp/graph8648160370340251691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8648160370340251691.bin' '-l' '-1' '-v' '-w' '/tmp/graph8648160370340251691.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:22:14] [INFO ] Decomposing Gal with order
[2025-06-02 23:22:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:22:14] [INFO ] Removed a total of 199 redundant transitions.
[2025-06-02 23:22:14] [INFO ] Flatten gal took : 36 ms
[2025-06-02 23:22:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 26 ms.
[2025-06-02 23:22:14] [INFO ] Time to serialize gal into /tmp/LTL4150074498941043385.gal : 3 ms
[2025-06-02 23:22:14] [INFO ] Time to serialize properties into /tmp/LTL12292915229970345920.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/LTL4150074498941043385.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12292915229970345920.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((((gu2.out4_0+gu2.out4_1)+(gu2.out4_7+gu2.out4_6))+((gu2.out4_3+gu2.out4_2)+(gu2.out4_5+gu2.out4_4)))>((gu2.aux8_7+gu2.aux8_3)...479
Formula 0 simplified : G!"((((gu2.out4_0+gu2.out4_1)+(gu2.out4_7+gu2.out4_6))+((gu2.out4_3+gu2.out4_2)+(gu2.out4_5+gu2.out4_4)))>((gu2.aux8_7+gu2.aux8_3)+(...465
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-05-LTLCardinality-05 finished in 118403 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||X((X(X(X(G(p1))))||(F(p2) U !p1))))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 66 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 92 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 116 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 140 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 51 transition count 84
Applied a total of 146 rules in 8 ms. Remains 51 /144 variables (removed 93) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2025-06-02 23:22:29] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:22:30] [INFO ] Implicit Places using invariants in 54 ms returned [0, 5, 18, 25]
[2025-06-02 23:22:30] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/144 places, 84/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 48/144 places, 84/592 transitions.
Stuttering acceptance computed with spot in 391 ms :[false, false, false, false, (AND (NOT p2) (NOT p1)), false, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 84
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 p1 (NOT p2)), (X p0), (X (X (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLCardinality-06 finished in 720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 18 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 120 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 0 output transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 108 transition count 400
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 108 transition count 400
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 35 place count 98 transition count 290
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 98 transition count 290
Applied a total of 45 rules in 23 ms. Remains 98 /144 variables (removed 46) and now considering 290/592 (removed 302) transitions.
// Phase 1: matrix 290 rows 98 cols
[2025-06-02 23:22:30] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:22:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 23:22:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:22:31] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:22:31] [INFO ] Redundant transitions in 3 ms returned []
Running 286 sub problems to find dead transitions.
[2025-06-02 23:22:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 17/98 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 290/388 variables, 98/116 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 116 constraints, problems are : Problem set: 0 solved, 286 unsolved in 7022 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 17/98 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:39] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:39] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:39] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:39] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:39] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:40] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:41] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:41] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:41] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:22:41] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 290/388 variables, 98/134 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 286/420 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 420 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37198ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 37199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/144 places, 290/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37604 ms. Remains : 98/144 places, 290/592 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-07
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-07 finished in 37734 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||X((X(G(!p0))&&(p0||F(p1)))))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 64 place count 80 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 89 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 111 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 133 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 56 transition count 102
Applied a total of 137 rules in 7 ms. Remains 56 /144 variables (removed 88) and now considering 102/592 (removed 490) transitions.
// Phase 1: matrix 102 rows 56 cols
[2025-06-02 23:23:08] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:08] [INFO ] Implicit Places using invariants in 56 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/144 places, 102/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 55/144 places, 102/592 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 55 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 102
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 p0), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 13 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLCardinality-09 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1 U (p0&&G(p2))))))'
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 104 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 65 place count 79 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 90 place count 79 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 111 place count 58 transition count 124
Iterating global reduction 1 with 21 rules applied. Total rules applied 132 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 56 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 56 transition count 108
Applied a total of 136 rules in 10 ms. Remains 56 /144 variables (removed 88) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2025-06-02 23:23:08] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:08] [INFO ] Implicit Places using invariants in 49 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/144 places, 108/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 55/144 places, 108/592 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (OR (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-10 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(G(p0)))) U p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 87 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.4 ms
Discarding 57 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 75 transition count 342
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 75 transition count 342
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 49 place count 51 transition count 106
Iterating global reduction 0 with 24 rules applied. Total rules applied 73 place count 51 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 49 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 49 transition count 90
Applied a total of 77 rules in 17 ms. Remains 49 /144 variables (removed 95) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 49 cols
[2025-06-02 23:23:09] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:09] [INFO ] Implicit Places using invariants in 42 ms returned [0, 15, 23]
[2025-06-02 23:23:09] [INFO ] Actually due to overlaps returned [0, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/144 places, 90/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 47/144 places, 90/592 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-11
Product exploration explored 100000 steps with 1408 reset in 341 ms.
Product exploration explored 100000 steps with 1408 reset in 323 ms.
Computed a total of 47 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 90
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), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 4
RANDOM walk for 40007 steps (468 resets) in 89 ms. (444 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (60 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (61 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
// Phase 1: matrix 90 rows 47 cols
[2025-06-02 23:23:10] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/47 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 90/137 variables, 47/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 59 constraints, problems are : Problem set: 1 solved, 1 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/47 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 90/137 variables, 47/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 1/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 60 constraints, problems are : Problem set: 1 solved, 1 unsolved in 100 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 9 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-02 23:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:23:11] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 23:23:11] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 23:23:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:23:11] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-02 23:23:11] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 23:23:11] [INFO ] Computed and/alt/rep : 26/154/26 causal constraints (skipped 60 transitions) in 10 ms.
[2025-06-02 23:23:11] [INFO ] Added : 12 causal constraints over 4 iterations in 64 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-06-02 23:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:11] [INFO ] Implicit Places using invariants in 49 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/47 places, 90/90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 45 transition count 88
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 4 place count 44 transition count 88
Applied a total of 4 rules in 4 ms. Remains 44 /46 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 44 cols
[2025-06-02 23:23:11] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-02 23:23:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:12] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/47 places, 88/90 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 44/47 places, 88/90 transitions.
Computed a total of 44 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 88
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 (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 335 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 4
RANDOM walk for 40008 steps (546 resets) in 57 ms. (689 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (65 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (67 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
[2025-06-02 23:23:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/44 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/132 variables, 44/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 55 constraints, problems are : Problem set: 1 solved, 1 unsolved in 57 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/44 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/132 variables, 44/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 56 constraints, problems are : Problem set: 1 solved, 1 unsolved in 177 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 252ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 476 ms. Reduced automaton from 4 states, 16 edges and 2 AP (stutter insensitive) to 4 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-02 23:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:23:13] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2025-06-02 23:23:13] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 23:23:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:23:13] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 2 ms returned sat
[2025-06-02 23:23:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 23:23:13] [INFO ] Computed and/alt/rep : 23/136/23 causal constraints (skipped 61 transitions) in 7 ms.
[2025-06-02 23:23:13] [INFO ] Added : 9 causal constraints over 3 iterations in 47 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1639 reset in 343 ms.
Product exploration explored 100000 steps with 1639 reset in 351 ms.
Built C files in :
/tmp/ltsmin16294514716392220032
[2025-06-02 23:23:14] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2025-06-02 23:23:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:23:14] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2025-06-02 23:23:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:23:14] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2025-06-02 23:23:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:23:14] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16294514716392220032
Running compilation step : cd /tmp/ltsmin16294514716392220032;'/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 205 ms.
Running link step : cd /tmp/ltsmin16294514716392220032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16294514716392220032;'/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/stateBased8916874048966098615.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2025-06-02 23:23:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-02 23:23:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:23:30] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:23:30] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-02 23:23:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/131 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 55 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1247 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/131 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 78/132 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 139 constraints, problems are : Problem set: 0 solved, 84 unsolved in 12605 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13877ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 13877ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14002 ms. Remains : 44/44 places, 88/88 transitions.
Built C files in :
/tmp/ltsmin17672366470156403457
[2025-06-02 23:23:44] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2025-06-02 23:23:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:23:44] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2025-06-02 23:23:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:23:44] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2025-06-02 23:23:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:23:44] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17672366470156403457
Running compilation step : cd /tmp/ltsmin17672366470156403457;'/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 198 ms.
Running link step : cd /tmp/ltsmin17672366470156403457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17672366470156403457;'/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/stateBased6832072853194255200.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:23:59] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:23:59] [INFO ] Flatten gal took : 5 ms
[2025-06-02 23:23:59] [INFO ] Time to serialize gal into /tmp/LTL14210999860391349040.gal : 1 ms
[2025-06-02 23:23:59] [INFO ] Time to serialize properties into /tmp/LTL7151880681369023020.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/LTL14210999860391349040.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7612868489257321849.hoa' '-atoms' '/tmp/LTL7151880681369023020.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/LTL7151880681369023020.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7612868489257321849.hoa
Detected timeout of ITS tools.
[2025-06-02 23:24:14] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:24:14] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:24:14] [INFO ] Time to serialize gal into /tmp/LTL15984442774846671211.gal : 1 ms
[2025-06-02 23:24:14] [INFO ] Time to serialize properties into /tmp/LTL11518924138141094290.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/LTL15984442774846671211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11518924138141094290.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 : !((F(G((X(X(X(G("(c5>=2)")))))U("((c5<2)||((out2_0>=1)&&(c9>=1)))")))))
Formula 0 simplified : GF(!"((c5<2)||((out2_0>=1)&&(c9>=1)))" & X(!"((c5<2)||((out2_0>=1)&&(c9>=1)))" W XXF!"(c5>=2)"))
Detected timeout of ITS tools.
[2025-06-02 23:24:29] [INFO ] Flatten gal took : 14 ms
[2025-06-02 23:24:29] [INFO ] Applying decomposition
[2025-06-02 23:24:29] [INFO ] Flatten gal took : 4 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/graph2261329496345881129.txt' '-o' '/tmp/graph2261329496345881129.bin' '-w' '/tmp/graph2261329496345881129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2261329496345881129.bin' '-l' '-1' '-v' '-w' '/tmp/graph2261329496345881129.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:24:29] [INFO ] Decomposing Gal with order
[2025-06-02 23:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:24:29] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-02 23:24:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 23:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 1 ms.
[2025-06-02 23:24:29] [INFO ] Time to serialize gal into /tmp/LTL6474676952933298073.gal : 2 ms
[2025-06-02 23:24:29] [INFO ] Time to serialize properties into /tmp/LTL8925388635340738825.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/LTL6474676952933298073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8925388635340738825.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 : !((F(G((X(X(X(G("(i1.u1.c5>=2)")))))U("((i1.u1.c5<2)||((u3.out2_0>=1)&&(u2.c9>=1)))")))))
Formula 0 simplified : GF(!"((i1.u1.c5<2)||((u3.out2_0>=1)&&(u2.c9>=1)))" & X(!"((i1.u1.c5<2)||((u3.out2_0>=1)&&(u2.c9>=1)))" W XXF!"(i1.u1.c5>=2)"))
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-05-LTLCardinality-11 finished in 95151 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)||(F(G(p1))&&G(p2)))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 86 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.6 ms
Discarding 58 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 73 transition count 340
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 73 transition count 340
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 53 place count 47 transition count 94
Iterating global reduction 0 with 26 rules applied. Total rules applied 79 place count 47 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 45 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 45 transition count 78
Applied a total of 83 rules in 13 ms. Remains 45 /144 variables (removed 99) and now considering 78/592 (removed 514) transitions.
// Phase 1: matrix 78 rows 45 cols
[2025-06-02 23:24:44] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:24:44] [INFO ] Implicit Places using invariants in 44 ms returned [0, 13, 20]
[2025-06-02 23:24:44] [INFO ] Actually due to overlaps returned [0, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/144 places, 78/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 43/144 places, 78/592 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-12
Product exploration explored 100000 steps with 1408 reset in 304 ms.
Product exploration explored 100000 steps with 1408 reset in 334 ms.
Computed a total of 43 stabilizing places and 78 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 78
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), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 28 factoid took 690 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
RANDOM walk for 35565 steps (416 resets) in 61 ms. (573 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 28 factoid took 2427 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 78 rows 43 cols
[2025-06-02 23:24:48] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:24:48] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 23:24:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 23:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:24:48] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2025-06-02 23:24:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 23:24:48] [INFO ] Computed and/alt/rep : 24/130/24 causal constraints (skipped 50 transitions) in 9 ms.
[2025-06-02 23:24:48] [INFO ] Added : 15 causal constraints over 4 iterations in 52 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2025-06-02 23:24:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:24:48] [INFO ] Implicit Places using invariants in 38 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/43 places, 78/78 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 42 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 41 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 41 transition count 76
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 4 place count 40 transition count 76
Applied a total of 4 rules in 2 ms. Remains 40 /42 variables (removed 2) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 40 cols
[2025-06-02 23:24:48] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:24:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-02 23:24:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:24:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/43 places, 76/78 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 40/43 places, 76/78 transitions.
Computed a total of 40 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 76
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), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 28 factoid took 685 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40008 steps (546 resets) in 87 ms. (454 steps per ms) remains 1/12 properties
BEST_FIRST walk for 1287 steps (0 resets) in 6 ms. (183 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 28 factoid took 2419 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
[2025-06-02 23:24:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:24:52] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 2 ms returned sat
[2025-06-02 23:24:52] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 23:24:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:24:52] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 3 ms returned sat
[2025-06-02 23:24:52] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 23:24:52] [INFO ] Computed and/alt/rep : 24/136/24 causal constraints (skipped 48 transitions) in 7 ms.
[2025-06-02 23:24:52] [INFO ] Added : 17 causal constraints over 5 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1639 reset in 324 ms.
Product exploration explored 100000 steps with 1639 reset in 358 ms.
Built C files in :
/tmp/ltsmin6163978384860910898
[2025-06-02 23:24:53] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2025-06-02 23:24:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:24:53] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2025-06-02 23:24:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:24:53] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2025-06-02 23:24:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:24:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6163978384860910898
Running compilation step : cd /tmp/ltsmin6163978384860910898;'/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 177 ms.
Running link step : cd /tmp/ltsmin6163978384860910898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6163978384860910898;'/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/stateBased731333169878356895.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2025-06-02 23:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:25:08] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 23:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:25:08] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:25:08] [INFO ] Redundant transitions in 0 ms returned []
Running 72 sub problems to find dead transitions.
[2025-06-02 23:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 76/116 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 51 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1163 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 76/116 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 72/123 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 123 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5148 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6330ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 6331ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6478 ms. Remains : 40/40 places, 76/76 transitions.
Built C files in :
/tmp/ltsmin13078069610566716993
[2025-06-02 23:25:14] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2025-06-02 23:25:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:25:14] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2025-06-02 23:25:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:25:14] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2025-06-02 23:25:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:25:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13078069610566716993
Running compilation step : cd /tmp/ltsmin13078069610566716993;'/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 174 ms.
Running link step : cd /tmp/ltsmin13078069610566716993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13078069610566716993;'/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/stateBased5376473415554659031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:25:30] [INFO ] Flatten gal took : 4 ms
[2025-06-02 23:25:30] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:25:30] [INFO ] Time to serialize gal into /tmp/LTL16257165925106109897.gal : 1 ms
[2025-06-02 23:25:30] [INFO ] Time to serialize properties into /tmp/LTL2769995602217186812.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16257165925106109897.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10532478723758444910.hoa' '-atoms' '/tmp/LTL2769995602217186812.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/LTL2769995602217186812.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10532478723758444910.hoa
Detected timeout of ITS tools.
[2025-06-02 23:25:45] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:25:45] [INFO ] Flatten gal took : 3 ms
[2025-06-02 23:25:45] [INFO ] Time to serialize gal into /tmp/LTL17046892026810665413.gal : 1 ms
[2025-06-02 23:25:45] [INFO ] Time to serialize properties into /tmp/LTL14238965934402454407.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/LTL17046892026810665413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14238965934402454407.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 : !((F((G("(c18>=1)"))||((F(G("(aux5_4<3)")))&&(G("(in3_5<=c14)"))))))
Formula 0 simplified : G(F!"(c18>=1)" & F(!"(in3_5<=c14)" | GF!"(aux5_4<3)"))
Detected timeout of ITS tools.
[2025-06-02 23:26:00] [INFO ] Flatten gal took : 7 ms
[2025-06-02 23:26:00] [INFO ] Applying decomposition
[2025-06-02 23:26:00] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17175186818575087130.txt' '-o' '/tmp/graph17175186818575087130.bin' '-w' '/tmp/graph17175186818575087130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17175186818575087130.bin' '-l' '-1' '-v' '-w' '/tmp/graph17175186818575087130.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:26:00] [INFO ] Decomposing Gal with order
[2025-06-02 23:26:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:26:00] [INFO ] Removed a total of 28 redundant transitions.
[2025-06-02 23:26:00] [INFO ] Flatten gal took : 6 ms
[2025-06-02 23:26:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 1 ms.
[2025-06-02 23:26:00] [INFO ] Time to serialize gal into /tmp/LTL11534070614102446220.gal : 1 ms
[2025-06-02 23:26:00] [INFO ] Time to serialize properties into /tmp/LTL7907059529725711707.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/LTL11534070614102446220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7907059529725711707.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(gi0.gu0.c18>=1)"))||((F(G("(gi0.gu1.aux5_4<3)")))&&(G("(gu2.in3_5<=gu2.c14)"))))))
Formula 0 simplified : G(F!"(gi0.gu0.c18>=1)" & F(!"(gu2.in3_5<=gu2.c14)" | GF!"(gi0.gu1.aux5_4<3)"))
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-05-LTLCardinality-12 finished in 90870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X(p0))) U ((p1&&X((p0 U X(p0))))||X(G((p0 U X(p0)))))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 64 place count 80 transition count 346
Iterating global reduction 1 with 25 rules applied. Total rules applied 89 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 111 place count 58 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 133 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 56 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 56 transition count 108
Applied a total of 137 rules in 9 ms. Remains 56 /144 variables (removed 88) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2025-06-02 23:26:15] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:26:15] [INFO ] Implicit Places using invariants in 51 ms returned [0, 5, 20, 28]
[2025-06-02 23:26:15] [INFO ] Actually due to overlaps returned [5, 0, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/144 places, 108/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 53/144 places, 108/592 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-14 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 105 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 63 place count 81 transition count 352
Iterating global reduction 1 with 24 rules applied. Total rules applied 87 place count 81 transition count 352
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 107 place count 61 transition count 136
Iterating global reduction 1 with 20 rules applied. Total rules applied 127 place count 61 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 60 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 60 transition count 128
Applied a total of 129 rules in 10 ms. Remains 60 /144 variables (removed 84) and now considering 128/592 (removed 464) transitions.
// Phase 1: matrix 128 rows 60 cols
[2025-06-02 23:26:15] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:26:15] [INFO ] Implicit Places using invariants in 46 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/144 places, 128/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 59 /59 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 59/144 places, 128/592 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLCardinality-15 finished in 192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&F(!p0))) U X(X((p1 U 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' '!((F(p0)&&F(((X(p1)&&F(p2))||G(p1)))))'
Found a Shortening insensitive property : PermAdmissibility-PT-05-LTLCardinality-05
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1))]
Support contains 26 out of 144 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 112 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 98 transition count 368
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 43 place count 84 transition count 242
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 84 transition count 242
Applied a total of 57 rules in 16 ms. Remains 84 /144 variables (removed 60) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 84 cols
[2025-06-02 23:26:16] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:26:16] [INFO ] Implicit Places using invariants in 101 ms returned [0, 11, 39, 50]
[2025-06-02 23:26:16] [INFO ] Actually due to overlaps returned [0, 11, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 81/144 places, 242/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 124 ms. Remains : 81/144 places, 242/592 transitions.
Running random walk in product with property : PermAdmissibility-PT-05-LTLCardinality-05
Product exploration explored 100000 steps with 3742 reset in 467 ms.
Product exploration explored 100000 steps with 3672 reset in 493 ms.
Computed a total of 81 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 242
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) p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 720 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 316 steps (0 resets) in 5 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 821 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 242 rows 81 cols
[2025-06-02 23:26:19] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:26:19] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 7 ms returned sat
[2025-06-02 23:26:19] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-06-02 23:26:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:26:19] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-02 23:26:19] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-02 23:26:19] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 210 transitions) in 22 ms.
[2025-06-02 23:26:19] [INFO ] Added : 17 causal constraints over 4 iterations in 107 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-02 23:26:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:26:19] [INFO ] Implicit Places using invariants in 69 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/81 places, 242/242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 80 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 79 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 79 transition count 240
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 4 place count 78 transition count 240
Applied a total of 4 rules in 9 ms. Remains 78 /80 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 78 cols
[2025-06-02 23:26:19] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:26:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-02 23:26:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:26:19] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/81 places, 240/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 78/81 places, 240/242 transitions.
Computed a total of 78 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 240
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 268 steps (0 resets) in 5 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2025-06-02 23:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:26:20] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 8 ms returned sat
[2025-06-02 23:26:20] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-02 23:26:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:26:20] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 17 ms returned sat
[2025-06-02 23:26:20] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-02 23:26:20] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 208 transitions) in 22 ms.
[2025-06-02 23:26:20] [INFO ] Added : 20 causal constraints over 5 iterations in 122 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2348 reset in 514 ms.
Product exploration explored 100000 steps with 2366 reset in 521 ms.
Built C files in :
/tmp/ltsmin17023649341745796498
[2025-06-02 23:26:21] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-02 23:26:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:26:21] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-02 23:26:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:26:21] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-02 23:26:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:26:21] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17023649341745796498
Running compilation step : cd /tmp/ltsmin17023649341745796498;'/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 517 ms.
Running link step : cd /tmp/ltsmin17023649341745796498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17023649341745796498;'/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/stateBased12163445623914490704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 240/240 transitions.
Graph (complete) has 565 edges and 78 vertex of which 68 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 8 ms. Remains 68 /78 variables (removed 10) and now considering 224/240 (removed 16) transitions.
// Phase 1: matrix 224 rows 68 cols
[2025-06-02 23:26:37] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:26:37] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 23:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:26:37] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:26:37] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-02 23:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 9/68 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 224/292 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 80 constraints, problems are : Problem set: 0 solved, 220 unsolved in 6156 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 9/68 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:44] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:44] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:44] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:44] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:44] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:45] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:45] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:45] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:45] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:45] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:45] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 224/292 variables, 68/91 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 220/311 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 311 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30009 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36336ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 36337ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/78 places, 224/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36551 ms. Remains : 68/78 places, 224/240 transitions.
Built C files in :
/tmp/ltsmin2966354992825565442
[2025-06-02 23:27:13] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2025-06-02 23:27:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:27:13] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2025-06-02 23:27:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:27:13] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2025-06-02 23:27:13] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:27:13] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2966354992825565442
Running compilation step : cd /tmp/ltsmin2966354992825565442;'/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 478 ms.
Running link step : cd /tmp/ltsmin2966354992825565442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2966354992825565442;'/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/stateBased13320993527091651301.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 23:27:28] [INFO ] Flatten gal took : 8 ms
[2025-06-02 23:27:28] [INFO ] Flatten gal took : 7 ms
[2025-06-02 23:27:28] [INFO ] Time to serialize gal into /tmp/LTL3132048547613815705.gal : 2 ms
[2025-06-02 23:27:28] [INFO ] Time to serialize properties into /tmp/LTL12915898865021267493.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/LTL3132048547613815705.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13618515179532484549.hoa' '-atoms' '/tmp/LTL12915898865021267493.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/LTL12915898865021267493.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13618515179532484549.hoa
Detected timeout of ITS tools.
[2025-06-02 23:27:43] [INFO ] Flatten gal took : 8 ms
[2025-06-02 23:27:43] [INFO ] Flatten gal took : 14 ms
[2025-06-02 23:27:43] [INFO ] Time to serialize gal into /tmp/LTL5990494946462170356.gal : 2 ms
[2025-06-02 23:27:43] [INFO ] Time to serialize properties into /tmp/LTL2643631801578593358.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/LTL5990494946462170356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2643631801578593358.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 : !(((F("((((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4)))>((aux8_7+aux8_3)+(aux8_6+aux8_2)))"))&&(F((G("((in1_1+in...351
Formula 0 simplified : G!"((((out4_0+out4_1)+(out4_7+out4_6))+((out4_3+out4_2)+(out4_5+out4_4)))>((aux8_7+aux8_3)+(aux8_6+aux8_2)))" | G(F!"((in1_1+in1_0)>...337
Detected timeout of ITS tools.
[2025-06-02 23:27:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 23:27:58] [INFO ] Applying decomposition
[2025-06-02 23:27:58] [INFO ] Flatten gal took : 8 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/graph7442302038699539429.txt' '-o' '/tmp/graph7442302038699539429.bin' '-w' '/tmp/graph7442302038699539429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7442302038699539429.bin' '-l' '-1' '-v' '-w' '/tmp/graph7442302038699539429.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:27:58] [INFO ] Decomposing Gal with order
[2025-06-02 23:27:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:27:58] [INFO ] Removed a total of 205 redundant transitions.
[2025-06-02 23:27:58] [INFO ] Flatten gal took : 31 ms
[2025-06-02 23:27:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 6 ms.
[2025-06-02 23:27:59] [INFO ] Time to serialize gal into /tmp/LTL14357228580797542965.gal : 2 ms
[2025-06-02 23:27:59] [INFO ] Time to serialize properties into /tmp/LTL9638448669904500808.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/LTL14357228580797542965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9638448669904500808.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((((gu2.out4_0+gu2.out4_1)+(gu2.out4_7+gu2.out4_6))+((gu2.out4_3+gu2.out4_2)+(gu2.out4_5+gu2.out4_4)))>((gu2.aux8_7+gu2.aux8_3)...479
Formula 0 simplified : G!"((((gu2.out4_0+gu2.out4_1)+(gu2.out4_7+gu2.out4_6))+((gu2.out4_3+gu2.out4_2)+(gu2.out4_5+gu2.out4_4)))>((gu2.aux8_7+gu2.aux8_3)+(...465
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-05-LTLCardinality-05 finished in 118172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(G(p0)))) 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' '!(F((G(p0)||(F(G(p1))&&G(p2)))))'
[2025-06-02 23:28:14] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18018231069131187845
[2025-06-02 23:28:14] [INFO ] Applying decomposition
[2025-06-02 23:28:14] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2025-06-02 23:28:14] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:28:14] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2025-06-02 23:28:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:28:14] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:28:14] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
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/graph1330303768730640923.txt' '-o' '/tmp/graph1330303768730640923.bin' '-w' '/tmp/graph1330303768730640923.weights'
[2025-06-02 23:28:14] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:28:14] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18018231069131187845
Running compilation step : cd /tmp/ltsmin18018231069131187845;'/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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1330303768730640923.bin' '-l' '-1' '-v' '-w' '/tmp/graph1330303768730640923.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:28:14] [INFO ] Decomposing Gal with order
[2025-06-02 23:28:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:28:14] [INFO ] Removed a total of 906 redundant transitions.
[2025-06-02 23:28:14] [INFO ] Flatten gal took : 92 ms
[2025-06-02 23:28:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 424 labels/synchronizations in 21 ms.
[2025-06-02 23:28:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality3768313772042757720.gal : 4 ms
[2025-06-02 23:28:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality14950809922887292077.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/LTLCardinality3768313772042757720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14950809922887292077.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !(((F((X("(((gu2.aux8_7+gu2.aux8_3)+(gu2.aux8_6+gu2.aux8_2))>=2)"))&&(F("(((gu2.aux8_7+gu2.aux8_3)+(gu2.aux8_6+gu2.aux8_2))<2)"))))U(X...216
Formula 0 simplified : G(X!"(((gu2.aux8_7+gu2.aux8_3)+(gu2.aux8_6+gu2.aux8_2))>=2)" | G!"(((gu2.aux8_7+gu2.aux8_3)+(gu2.aux8_6+gu2.aux8_2))<2)") R XX(!"(gu...204
Compilation finished in 1600 ms.
Running link step : cd /tmp/ltsmin18018231069131187845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin18018231069131187845;'/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))&&<>(!(LTLAPp0==true)))) U X(X(((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin18018231069131187845;'/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))&&<>(!(LTLAPp0==true)))) U X(X(((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18018231069131187845;'/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' '(<>((LTLAPp3==true))&&<>(((X((LTLAPp4==true))&&<>((LTLAPp5==true)))||[]((LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin18018231069131187845;'/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' '(<>((LTLAPp3==true))&&<>(((X((LTLAPp4==true))&&<>((LTLAPp5==true)))||[]((LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18018231069131187845;'/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(X([]((LTLAPp6==true))))) U (LTLAPp7==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin18018231069131187845;'/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(X([]((LTLAPp6==true))))) U (LTLAPp7==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18018231069131187845;'/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' '<>(([]((LTLAPp8==true))||(<>([]((LTLAPp9==true)))&&[]((LTLAPp10==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin18018231069131187845;'/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' '<>(([]((LTLAPp8==true))||(<>([]((LTLAPp9==true)))&&[]((LTLAPp10==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin18018231069131187845;'/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))&&<>(!(LTLAPp0==true)))) U X(X(((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-02 23:51:59] [INFO ] Flatten gal took : 118 ms
[2025-06-02 23:51:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality13571729519221267942.gal : 37 ms
[2025-06-02 23:51:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality11235440501113479277.ltl : 11 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/LTLCardinality13571729519221267942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11235440501113479277.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...299
Read 4 LTL properties
Checking formula 0 : !(((F((X("(((aux8_7+aux8_3)+(aux8_6+aux8_2))>=2)"))&&(F("(((aux8_7+aux8_3)+(aux8_6+aux8_2))<2)"))))U(X(X(("(c15>=1)")U("((in2_2+in2_3)...168
Formula 0 simplified : G(X!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>=2)" | G!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))<2)") R XX(!"(c15>=1)" R !"((in2_2+in2_3)<=c15)"...156
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin18018231069131187845;'/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))&&<>(!(LTLAPp0==true)))) U X(X(((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18018231069131187845;'/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' '(<>((LTLAPp3==true))&&<>(((X((LTLAPp4==true))&&<>((LTLAPp5==true)))||[]((LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 00:15:44] [INFO ] Flatten gal took : 94 ms
[2025-06-03 00:15:44] [INFO ] Input system was already deterministic with 592 transitions.
[2025-06-03 00:15:44] [INFO ] Transformed 144 places.
[2025-06-03 00:15:44] [INFO ] Transformed 592 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-03 00:15:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality10633148408097521420.gal : 11 ms
[2025-06-03 00:15:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality2458530877243668357.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/LTLCardinality10633148408097521420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2458530877243668357.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F((X("(((aux8_7+aux8_3)+(aux8_6+aux8_2))>=2)"))&&(F("(((aux8_7+aux8_3)+(aux8_6+aux8_2))<2)"))))U(X(X(("(c15>=1)")U("((in2_2+in2_3)...168
Formula 0 simplified : G(X!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>=2)" | G!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))<2)") R XX(!"(c15>=1)" R !"((in2_2+in2_3)<=c15)"...156
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812700515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-05.tgz
mv PermAdmissibility-PT-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;