About the Execution of ITS-Tools for PermAdmissibility-PT-10
| 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 | ?TFFFFFFF?TF??FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812700523.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-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812700523
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 465K 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 5.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 222K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 452K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 340K 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-10-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748910335019
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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 00:25:36] [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-03 00:25:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:25:36] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-03 00:25:36] [INFO ] Transformed 168 places.
[2025-06-03 00:25:36] [INFO ] Transformed 592 transitions.
[2025-06-03 00:25:36] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-PT-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 160 transition count 592
Applied a total of 8 rules in 24 ms. Remains 160 /168 variables (removed 8) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 160 cols
[2025-06-03 00:25:36] [INFO ] Computed 24 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:25:36] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-03 00:25:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:25:37] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2025-06-03 00:25: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/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) 17/120 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (OVERLAPS) 40/160 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (OVERLAPS) 592/752 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 9 (OVERLAPS) 0/752 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/752 variables, and 184 constraints, problems are : Problem set: 0 solved, 588 unsolved in 26224 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 160/160 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) 17/120 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (OVERLAPS) 40/160 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (OVERLAPS) 592/752 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 588/772 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/752 variables, and 772 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57077ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 57094ms
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57805 ms. Remains : 160/168 places, 592/592 transitions.
Support contains 123 out of 160 places after structural reductions.
[2025-06-03 00:26:34] [INFO ] Flatten gal took : 95 ms
[2025-06-03 00:26:34] [INFO ] Flatten gal took : 52 ms
[2025-06-03 00:26:34] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 122 out of 160 places (down from 123) after GAL structural reductions.
RANDOM walk for 40016 steps (224 resets) in 673 ms. (59 steps per ms) remains 3/38 properties
BEST_FIRST walk for 40004 steps (11 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 305 ms. (130 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
[2025-06-03 00:26:35] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 30/72 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 154/752 variables, and 22 constraints, problems are : Problem set: 3 solved, 0 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/160 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Computed a total of 160 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 160 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' '!(G((F(p0)&&F(p1))))'
Support contains 18 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Graph (complete) has 1535 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 99 transition count 384
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 99 transition count 384
Applied a total of 27 rules in 39 ms. Remains 99 /160 variables (removed 61) and now considering 384/592 (removed 208) transitions.
// Phase 1: matrix 384 rows 99 cols
[2025-06-03 00:26:36] [INFO ] Computed 17 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:36] [INFO ] Implicit Places using invariants in 155 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/160 places, 384/592 transitions.
Applied a total of 0 rules in 30 ms. Remains 98 /98 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 98/160 places, 384/592 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 3002 reset in 667 ms.
Product exploration explored 100000 steps with 2976 reset in 605 ms.
Computed a total of 98 stabilizing places and 384 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 384
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 624 steps (0 resets) in 10 ms. (56 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 384 rows 98 cols
[2025-06-03 00:26:38] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:26:38] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 12 ms returned sat
[2025-06-03 00:26:38] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-03 00:26:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:26:38] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 16 ms returned sat
[2025-06-03 00:26:39] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2025-06-03 00:26:39] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 352 transitions) in 57 ms.
[2025-06-03 00:26:39] [INFO ] Added : 14 causal constraints over 4 iterations in 209 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 18 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 98 /98 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-03 00:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:39] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-03 00:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:39] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:26:39] [INFO ] Redundant transitions in 21 ms returned []
Running 380 sub problems to find dead transitions.
[2025-06-03 00:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 9/98 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 384/482 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 114 constraints, problems are : Problem set: 0 solved, 380 unsolved in 10819 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 9/98 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 384/482 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 380/494 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 494 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41155ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 41157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41629 ms. Remains : 98/98 places, 384/384 transitions.
Computed a total of 98 stabilizing places and 384 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 384
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 639 steps (0 resets) in 8 ms. (71 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 213 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-03 00:27:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:27:22] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 21 ms returned sat
[2025-06-03 00:27:22] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-06-03 00:27:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:27:22] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 13 ms returned sat
[2025-06-03 00:27:22] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2025-06-03 00:27:22] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 352 transitions) in 63 ms.
[2025-06-03 00:27:22] [INFO ] Added : 18 causal constraints over 5 iterations in 222 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2995 reset in 570 ms.
Product exploration explored 100000 steps with 2991 reset in 574 ms.
Built C files in :
/tmp/ltsmin9772695658195485877
[2025-06-03 00:27:24] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2025-06-03 00:27:24] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:27:24] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2025-06-03 00:27:24] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:27:24] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2025-06-03 00:27:24] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:27:24] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9772695658195485877
Running compilation step : cd /tmp/ltsmin9772695658195485877;'/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 1000 ms.
Running link step : cd /tmp/ltsmin9772695658195485877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9772695658195485877;'/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/stateBased9843923247927271897.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 18 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 384/384 transitions.
Applied a total of 0 rules in 18 ms. Remains 98 /98 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-03 00:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:27:39] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-03 00:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:27:39] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:27:39] [INFO ] Redundant transitions in 8 ms returned []
Running 380 sub problems to find dead transitions.
[2025-06-03 00:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 9/98 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 384/482 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 114 constraints, problems are : Problem set: 0 solved, 380 unsolved in 10979 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 9/98 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 384/482 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 380/494 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 494 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41248ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 41249ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41582 ms. Remains : 98/98 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin14504279152954550505
[2025-06-03 00:28:20] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2025-06-03 00:28:20] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:28:20] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2025-06-03 00:28:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:28:20] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2025-06-03 00:28:20] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:28:20] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14504279152954550505
Running compilation step : cd /tmp/ltsmin14504279152954550505;'/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 936 ms.
Running link step : cd /tmp/ltsmin14504279152954550505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14504279152954550505;'/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/stateBased18350879420829462364.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:28:35] [INFO ] Flatten gal took : 25 ms
[2025-06-03 00:28:35] [INFO ] Flatten gal took : 23 ms
[2025-06-03 00:28:35] [INFO ] Time to serialize gal into /tmp/LTL12497773558035484159.gal : 6 ms
[2025-06-03 00:28:35] [INFO ] Time to serialize properties into /tmp/LTL5267582777246993348.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/LTL12497773558035484159.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12481940357913019576.hoa' '-atoms' '/tmp/LTL5267582777246993348.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/LTL5267582777246993348.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12481940357913019576.hoa
Detected timeout of ITS tools.
[2025-06-03 00:28:51] [INFO ] Flatten gal took : 20 ms
[2025-06-03 00:28:51] [INFO ] Flatten gal took : 20 ms
[2025-06-03 00:28:51] [INFO ] Time to serialize gal into /tmp/LTL9350977566538570023.gal : 5 ms
[2025-06-03 00:28:51] [INFO ] Time to serialize properties into /tmp/LTL18362729843911997088.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9350977566538570023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18362729843911997088.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))<=(in1_1+in1_0))"))&&(F("((((aux15_2+aux15_1)+(aux15_0+...213
Formula 0 simplified : F(G!"((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))<=(in1_1+in1_0))" | G!"((((aux15_2+aux15_1)+(aux15_0+aux1...205
Detected timeout of ITS tools.
[2025-06-03 00:29:06] [INFO ] Flatten gal took : 19 ms
[2025-06-03 00:29:06] [INFO ] Applying decomposition
[2025-06-03 00:29:06] [INFO ] Flatten gal took : 16 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/graph12427509795614392111.txt' '-o' '/tmp/graph12427509795614392111.bin' '-w' '/tmp/graph12427509795614392111.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12427509795614392111.bin' '-l' '-1' '-v' '-w' '/tmp/graph12427509795614392111.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:29:06] [INFO ] Decomposing Gal with order
[2025-06-03 00:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:29:06] [INFO ] Removed a total of 244 redundant transitions.
[2025-06-03 00:29:06] [INFO ] Flatten gal took : 95 ms
[2025-06-03 00:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 12 ms.
[2025-06-03 00:29:06] [INFO ] Time to serialize gal into /tmp/LTL7161160291456025193.gal : 6 ms
[2025-06-03 00:29:06] [INFO ] Time to serialize properties into /tmp/LTL6244358658155994007.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/LTL7161160291456025193.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6244358658155994007.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((((gu0.out8_1+gu0.out8_0)+(gu0.out8_3+gu0.out8_2))+((gu0.out8_6+gu0.out8_7)+(gu0.out8_4+gu0.out8_5)))<=(gu0.in1_1+gu0.in1_0)...285
Formula 0 simplified : F(G!"((((gu0.out8_1+gu0.out8_0)+(gu0.out8_3+gu0.out8_2))+((gu0.out8_6+gu0.out8_7)+(gu0.out8_4+gu0.out8_5)))<=(gu0.in1_1+gu0.in1_0))"...277
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-00 finished in 165497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Graph (complete) has 1535 edges and 160 vertex of which 12 are kept as prefixes of interest. Removing 148 places using SCC suffix rule.3 ms
Discarding 148 places :
Also discarding 576 output transitions
Drop transitions (Output transitions of discarded places.) removed 576 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 8 transition count 4
Ensure Unique test removed 2 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 6 transition count 4
Applied a total of 11 rules in 14 ms. Remains 6 /160 variables (removed 154) and now considering 4/592 (removed 588) transitions.
// Phase 1: matrix 4 rows 6 cols
[2025-06-03 00:29:21] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:21] [INFO ] Implicit Places using invariants in 27 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/160 places, 4/592 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 00:29:21] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:21] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-03 00:29:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:21] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/160 places, 2/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 2/160 places, 2/592 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 4761 reset in 133 ms.
Product exploration explored 100000 steps with 4761 reset in 174 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-10-LTLCardinality-01 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||G(F(p1))) U X(p2)))'
Support contains 14 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 112 transition count 592
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 67 place count 93 transition count 372
Iterating global reduction 1 with 19 rules applied. Total rules applied 86 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 96 place count 83 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 106 place count 83 transition count 262
Applied a total of 106 rules in 11 ms. Remains 83 /160 variables (removed 77) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 83 cols
[2025-06-03 00:29:21] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:22] [INFO ] Implicit Places using invariants in 75 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/160 places, 262/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 82/160 places, 262/592 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 1138 reset in 658 ms.
Product exploration explored 100000 steps with 1158 reset in 669 ms.
Computed a total of 82 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 262
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) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1577 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
RANDOM walk for 40015 steps (224 resets) in 110 ms. (360 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/2 properties
BEST_FIRST walk for 4899 steps (0 resets) in 13 ms. (349 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 15 factoid took 2894 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
// Phase 1: matrix 262 rows 82 cols
[2025-06-03 00:29:29] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:29:29] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 7 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p0), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 15 factoid took 3012 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-10-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-10-LTLCardinality-02 finished in 10630 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))||(G(p1) U p2)))'
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Graph (complete) has 1535 edges and 160 vertex of which 104 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.4 ms
Discarding 56 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 84 transition count 356
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 84 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 55 place count 70 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 69 place count 70 transition count 230
Applied a total of 69 rules in 24 ms. Remains 70 /160 variables (removed 90) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 70 cols
[2025-06-03 00:29:32] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:32] [INFO ] Implicit Places using invariants in 73 ms returned [0, 11, 25, 36]
[2025-06-03 00:29:32] [INFO ] Actually due to overlaps returned [0, 11, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/160 places, 230/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 67/160 places, 230/592 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-03
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-03 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Graph (complete) has 1535 edges and 160 vertex of which 12 are kept as prefixes of interest. Removing 148 places using SCC suffix rule.1 ms
Discarding 148 places :
Also discarding 576 output transitions
Drop transitions (Output transitions of discarded places.) removed 576 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 8 transition count 4
Ensure Unique test removed 2 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 6 transition count 4
Applied a total of 11 rules in 5 ms. Remains 6 /160 variables (removed 154) and now considering 4/592 (removed 588) transitions.
// Phase 1: matrix 4 rows 6 cols
[2025-06-03 00:29:32] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:33] [INFO ] Implicit Places using invariants in 170 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 172 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/160 places, 4/592 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 5 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 00:29:33] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:33] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-03 00:29:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:33] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/160 places, 2/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 2/160 places, 2/592 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-04
Stuttering criterion allowed to conclude after 114 steps with 12 reset in 0 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-04 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p1))) U ((p2 U p3)&&X(X(G(!p0))))))'
Support contains 27 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 68 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 88 place count 92 transition count 356
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 95 place count 85 transition count 244
Iterating global reduction 1 with 7 rules applied. Total rules applied 102 place count 85 transition count 244
Applied a total of 102 rules in 5 ms. Remains 85 /160 variables (removed 75) and now considering 244/592 (removed 348) transitions.
// Phase 1: matrix 244 rows 85 cols
[2025-06-03 00:29:33] [INFO ] Computed 17 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:33] [INFO ] Implicit Places using invariants in 84 ms returned [0, 5, 51]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/160 places, 244/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 82/160 places, 244/592 transitions.
Stuttering acceptance computed with spot in 819 ms :[(OR (NOT p3) p0), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, true, (NOT p3), p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), p0, (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p3)), p0, (AND (NOT p3) p2 p0 p1)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-05 finished in 949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !p1))'
Support contains 9 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Graph (complete) has 1535 edges and 160 vertex of which 104 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.5 ms
Discarding 56 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 85 transition count 372
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 49 place count 75 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 59 place count 75 transition count 262
Applied a total of 59 rules in 21 ms. Remains 75 /160 variables (removed 85) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 75 cols
[2025-06-03 00:29:34] [INFO ] Computed 16 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:34] [INFO ] Implicit Places using invariants in 68 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/160 places, 262/592 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 74/160 places, 262/592 transitions.
Stuttering acceptance computed with spot in 49 ms :[p1, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-07
Product exploration explored 100000 steps with 1757 reset in 618 ms.
Product exploration explored 100000 steps with 1763 reset in 637 ms.
Computed a total of 74 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p1, (NOT p0)]
RANDOM walk for 596 steps (0 resets) in 12 ms. (45 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 355 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[p1, (NOT p0)]
// Phase 1: matrix 262 rows 74 cols
[2025-06-03 00:29:36] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG p1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 9 factoid took 362 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-10-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-10-LTLCardinality-07 finished in 2741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 82 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 108 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 132 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 156 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 159 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 162 place count 51 transition count 84
Applied a total of 162 rules in 10 ms. Remains 51 /160 variables (removed 109) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2025-06-03 00:29:36] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:36] [INFO ] Implicit Places using invariants in 55 ms returned [0, 5, 18, 25]
[2025-06-03 00:29:36] [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/160 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 66 ms. Remains : 48/160 places, 84/592 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-08 finished in 203 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 U (G(p0)||(p0&&F(p1)&&X(X(p2))))))))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 80 place count 80 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 105 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 127 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 149 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 56 transition count 102
Applied a total of 153 rules in 9 ms. Remains 56 /160 variables (removed 104) and now considering 102/592 (removed 490) transitions.
// Phase 1: matrix 102 rows 56 cols
[2025-06-03 00:29:37] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:37] [INFO ] Implicit Places using invariants in 53 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/160 places, 102/592 transitions.
Applied a total of 0 rules in 0 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 64 ms. Remains : 55/160 places, 102/592 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 665 reset in 415 ms.
Product exploration explored 100000 steps with 670 reset in 358 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 p1 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (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 : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 625 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 14 states, 43 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 645 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
RANDOM walk for 40009 steps (224 resets) in 76 ms. (519 steps per ms) remains 3/14 properties
BEST_FIRST walk for 30480 steps (14 resets) in 134 ms. (225 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (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 : [(F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) p0))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) p0 p1))), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 11 factoid took 2955 ms. Reduced automaton from 14 states, 43 edges and 3 AP (stutter insensitive) to 14 states, 43 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 646 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 661 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 55 cols
[2025-06-03 00:29:43] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-03 00:29:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:44] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:29:44] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-06-03 00:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2074 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 19990 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22103ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 22105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22272 ms. Remains : 55/55 places, 102/102 transitions.
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 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (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 : []
Knowledge based reduction with 25 factoid took 707 ms. Reduced automaton from 14 states, 43 edges and 3 AP (stutter insensitive) to 14 states, 43 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 668 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
RANDOM walk for 40015 steps (224 resets) in 54 ms. (727 steps per ms) remains 1/14 properties
BEST_FIRST walk for 9324 steps (2 resets) in 12 ms. (717 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (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 : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 25 factoid took 2809 ms. Reduced automaton from 14 states, 43 edges and 3 AP (stutter insensitive) to 14 states, 43 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 640 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 630 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 657 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 666 reset in 341 ms.
Product exploration explored 100000 steps with 663 reset in 376 ms.
Built C files in :
/tmp/ltsmin11746664924828012014
[2025-06-03 00:30:13] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2025-06-03 00:30:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:13] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2025-06-03 00:30:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:13] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2025-06-03 00:30:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:13] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11746664924828012014
Running compilation step : cd /tmp/ltsmin11746664924828012014;'/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 249 ms.
Running link step : cd /tmp/ltsmin11746664924828012014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11746664924828012014;'/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/stateBased17161517265155878642.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-06-03 00:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:30:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-03 00:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:30:28] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:30:28] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-06-03 00:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2181 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/156 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 90/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 19902 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22108ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 22109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22279 ms. Remains : 55/55 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin15839846286764303813
[2025-06-03 00:30:50] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2025-06-03 00:30:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:50] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2025-06-03 00:30:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:50] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2025-06-03 00:30:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15839846286764303813
Running compilation step : cd /tmp/ltsmin15839846286764303813;'/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 256 ms.
Running link step : cd /tmp/ltsmin15839846286764303813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15839846286764303813;'/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/stateBased8696964060369509710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:31:05] [INFO ] Flatten gal took : 8 ms
[2025-06-03 00:31:05] [INFO ] Flatten gal took : 9 ms
[2025-06-03 00:31:05] [INFO ] Time to serialize gal into /tmp/LTL2502583717301946321.gal : 1 ms
[2025-06-03 00:31:05] [INFO ] Time to serialize properties into /tmp/LTL14822120606160506107.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/LTL2502583717301946321.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17205986218395308043.hoa' '-atoms' '/tmp/LTL14822120606160506107.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/LTL14822120606160506107.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17205986218395308043.hoa
Detected timeout of ITS tools.
[2025-06-03 00:31:20] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:31:20] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:31:20] [INFO ] Time to serialize gal into /tmp/LTL15283637390244330578.gal : 1 ms
[2025-06-03 00:31:20] [INFO ] Time to serialize properties into /tmp/LTL14933044834366057915.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/LTL15283637390244330578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14933044834366057915.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(c13<3)")U((G("(c13<3)"))||((("(c13<3)")&&(F("(aux10_7<3)")))&&(X(X("(out5_7>aux5_5)")))))))))
Formula 0 simplified : FG((G!"(aux10_7<3)" | XX!"(out5_7>aux5_5)") U !"(c13<3)")
Detected timeout of ITS tools.
[2025-06-03 00:31:35] [INFO ] Flatten gal took : 9 ms
[2025-06-03 00:31:35] [INFO ] Applying decomposition
[2025-06-03 00:31:35] [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/graph12978581643020999612.txt' '-o' '/tmp/graph12978581643020999612.bin' '-w' '/tmp/graph12978581643020999612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12978581643020999612.bin' '-l' '-1' '-v' '-w' '/tmp/graph12978581643020999612.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:31:35] [INFO ] Decomposing Gal with order
[2025-06-03 00:31:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:31:35] [INFO ] Removed a total of 87 redundant transitions.
[2025-06-03 00:31:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 00:31:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 2 ms.
[2025-06-03 00:31:35] [INFO ] Time to serialize gal into /tmp/LTL15611692737607043488.gal : 1 ms
[2025-06-03 00:31:35] [INFO ] Time to serialize properties into /tmp/LTL362960849552415411.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/LTL15611692737607043488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL362960849552415411.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gi0.gu2.c13<3)")U((G("(gi0.gu2.c13<3)"))||((("(gi0.gu2.c13<3)")&&(F("(gi0.gu3.aux10_7<3)")))&&(X(X("(gu5.out5_7>gu5.aux5_5)"...164
Formula 0 simplified : FG((G!"(gi0.gu3.aux10_7<3)" | XX!"(gu5.out5_7>gu5.aux5_5)") U !"(gi0.gu2.c13<3)")
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-09 finished in 133950 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 U p1))&&F(p0)))&&X(F(p2))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 106 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 78 place count 82 transition count 352
Iterating global reduction 1 with 24 rules applied. Total rules applied 102 place count 82 transition count 352
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 122 place count 62 transition count 132
Iterating global reduction 1 with 20 rules applied. Total rules applied 142 place count 62 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 61 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 61 transition count 124
Applied a total of 144 rules in 12 ms. Remains 61 /160 variables (removed 99) and now considering 124/592 (removed 468) transitions.
// Phase 1: matrix 124 rows 61 cols
[2025-06-03 00:31:50] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:51] [INFO ] Implicit Places using invariants in 72 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/160 places, 124/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 60/160 places, 124/592 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-12
Product exploration explored 100000 steps with 3957 reset in 447 ms.
Product exploration explored 100000 steps with 3969 reset in 456 ms.
Computed a total of 60 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 124
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 p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (X (X p0)), (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 12 factoid took 504 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 292 steps (0 resets) in 5 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (X (X p0)), (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 p2)]
Knowledge based reduction with 12 factoid took 666 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 78 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 124 rows 60 cols
[2025-06-03 00:31:53] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:31:53] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 00:31:53] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-03 00:31:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:31:53] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-03 00:31:53] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-03 00:31:53] [INFO ] Computed and/alt/rep : 29/183/29 causal constraints (skipped 91 transitions) in 10 ms.
[2025-06-03 00:31:53] [INFO ] Added : 19 causal constraints over 5 iterations in 62 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 60 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 : 60/60 places, 124/124 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2025-06-03 00:31:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:53] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-03 00:31:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:54] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:31:54] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-03 00:31:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 124/182 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 2/184 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 75 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3242 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 124/182 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 108/181 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 2/184 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 195 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33284ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 33285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33441 ms. Remains : 60/60 places, 124/124 transitions.
Computed a total of 60 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 124
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 p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 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 92 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 312 steps (0 resets) in 4 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 126 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 87 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
[2025-06-03 00:32:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:32:27] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-03 00:32:28] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-03 00:32:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:32:28] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 00:32:28] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-03 00:32:28] [INFO ] Computed and/alt/rep : 29/183/29 causal constraints (skipped 91 transitions) in 11 ms.
[2025-06-03 00:32:28] [INFO ] Added : 28 causal constraints over 7 iterations in 94 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 2064 reset in 464 ms.
Product exploration explored 100000 steps with 2054 reset in 543 ms.
Built C files in :
/tmp/ltsmin14206808876665177427
[2025-06-03 00:32:29] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2025-06-03 00:32:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:29] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2025-06-03 00:32:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:29] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2025-06-03 00:32:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:29] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14206808876665177427
Running compilation step : cd /tmp/ltsmin14206808876665177427;'/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 286 ms.
Running link step : cd /tmp/ltsmin14206808876665177427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14206808876665177427;'/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/stateBased3982242336086569347.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 124/124 transitions.
Graph (complete) has 297 edges and 60 vertex of which 39 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 33 transition count 58
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 33 transition count 58
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 29 transition count 40
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 29 transition count 40
Applied a total of 21 rules in 3 ms. Remains 29 /60 variables (removed 31) and now considering 40/124 (removed 84) transitions.
// Phase 1: matrix 40 rows 29 cols
[2025-06-03 00:32:44] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:32:44] [INFO ] Implicit Places using invariants in 49 ms returned [8, 12, 14]
[2025-06-03 00:32:44] [INFO ] Actually due to overlaps returned [12, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/60 places, 40/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56 ms. Remains : 27/60 places, 40/124 transitions.
Built C files in :
/tmp/ltsmin11890308407619209791
[2025-06-03 00:32:44] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2025-06-03 00:32:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:44] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2025-06-03 00:32:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:44] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2025-06-03 00:32:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11890308407619209791
Running compilation step : cd /tmp/ltsmin11890308407619209791;'/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 124 ms.
Running link step : cd /tmp/ltsmin11890308407619209791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11890308407619209791;'/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/stateBased9635695687323033664.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:32:59] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:32:59] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:32:59] [INFO ] Time to serialize gal into /tmp/LTL3961522209760633901.gal : 0 ms
[2025-06-03 00:32:59] [INFO ] Time to serialize properties into /tmp/LTL2935027310836416111.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/LTL3961522209760633901.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1458251962975113751.hoa' '-atoms' '/tmp/LTL2935027310836416111.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...317
Loading property file /tmp/LTL2935027310836416111.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1458251962975113751.hoa
Detected timeout of ITS tools.
[2025-06-03 00:33:14] [INFO ] Flatten gal took : 6 ms
[2025-06-03 00:33:14] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:33:14] [INFO ] Time to serialize gal into /tmp/LTL123788649479510025.gal : 1 ms
[2025-06-03 00:33:14] [INFO ] Time to serialize properties into /tmp/LTL15555229197341773041.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/LTL123788649479510025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15555229197341773041.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((X(("(c18<=out5_4)")U("(c12<=out7_0)")))&&(F("(c18<=out5_4)"))))&&(X(F("(c13>c5)")))))
Formula 0 simplified : G(X(!"(c18<=out5_4)" R !"(c12<=out7_0)") | G!"(c18<=out5_4)") | XG!"(c13>c5)"
Detected timeout of ITS tools.
[2025-06-03 00:33:29] [INFO ] Flatten gal took : 9 ms
[2025-06-03 00:33:29] [INFO ] Applying decomposition
[2025-06-03 00:33:29] [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/graph18255506260327727368.txt' '-o' '/tmp/graph18255506260327727368.bin' '-w' '/tmp/graph18255506260327727368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18255506260327727368.bin' '-l' '-1' '-v' '-w' '/tmp/graph18255506260327727368.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:33:29] [INFO ] Decomposing Gal with order
[2025-06-03 00:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:33:29] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-03 00:33:29] [INFO ] Flatten gal took : 12 ms
[2025-06-03 00:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 2 ms.
[2025-06-03 00:33:29] [INFO ] Time to serialize gal into /tmp/LTL8787461194884130138.gal : 1 ms
[2025-06-03 00:33:29] [INFO ] Time to serialize properties into /tmp/LTL3838121547667588698.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/LTL8787461194884130138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3838121547667588698.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((X(("(gu0.c18<=gu0.out5_4)")U("(gu1.c12<=gu1.out7_0)")))&&(F("(gu0.c18<=gu0.out5_4)"))))&&(X(F("(gu2.c13>gu2.c5)")))))
Formula 0 simplified : G(X(!"(gu0.c18<=gu0.out5_4)" R !"(gu1.c12<=gu1.out7_0)") | G!"(gu0.c18<=gu0.out5_4)") | XG!"(gu2.c13>gu2.c5)"
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-12 finished in 113970 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||G(F(p1))||G(p2)))))'
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Graph (complete) has 1535 edges and 160 vertex of which 105 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.3 ms
Discarding 55 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 348
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 58 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 58 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 96 place count 57 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 97 place count 57 transition count 110
Applied a total of 97 rules in 19 ms. Remains 57 /160 variables (removed 103) and now considering 110/592 (removed 482) transitions.
// Phase 1: matrix 110 rows 57 cols
[2025-06-03 00:33:44] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:33:45] [INFO ] Implicit Places using invariants in 54 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/160 places, 110/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 56/160 places, 110/592 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-13
Product exploration explored 100000 steps with 886 reset in 376 ms.
Product exploration explored 100000 steps with 892 reset in 394 ms.
Computed a total of 56 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 110
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 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (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 14 factoid took 728 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 883 steps (4 resets) in 5 ms. (147 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (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 p0), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 14 factoid took 1223 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 56 /56 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 56 cols
[2025-06-03 00:33:48] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:33:48] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 00:33:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:33:48] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:33:48] [INFO ] Redundant transitions in 0 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-03 00:33:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/165 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/166 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 71 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3082 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/165 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 98/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/166 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 177 constraints, problems are : Problem set: 0 solved, 106 unsolved in 18815 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21923ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 21923ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22077 ms. Remains : 56/56 places, 110/110 transitions.
Computed a total of 56 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 110
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 (NOT p1)), (X p2), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT 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 734 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 831 steps (4 resets) in 6 ms. (118 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT 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 p1), (F p0), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 14 factoid took 1218 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 893 reset in 380 ms.
Product exploration explored 100000 steps with 872 reset in 386 ms.
Built C files in :
/tmp/ltsmin11284516135367270942
[2025-06-03 00:34:13] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2025-06-03 00:34:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:34:13] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2025-06-03 00:34:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:34:13] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2025-06-03 00:34:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:34:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11284516135367270942
Running compilation step : cd /tmp/ltsmin11284516135367270942;'/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 245 ms.
Running link step : cd /tmp/ltsmin11284516135367270942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11284516135367270942;'/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/stateBased9196152548273889588.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 56 /56 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-06-03 00:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:34:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-03 00:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:34:28] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:34:28] [INFO ] Redundant transitions in 0 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-03 00:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/165 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/166 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 71 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3047 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 110/165 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 98/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/166 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 177 constraints, problems are : Problem set: 0 solved, 106 unsolved in 18778 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21848ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 21849ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22004 ms. Remains : 56/56 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin7131907595589874316
[2025-06-03 00:34:50] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2025-06-03 00:34:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:34:50] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2025-06-03 00:34:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:34:50] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2025-06-03 00:34:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:34:50] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7131907595589874316
Running compilation step : cd /tmp/ltsmin7131907595589874316;'/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 267 ms.
Running link step : cd /tmp/ltsmin7131907595589874316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7131907595589874316;'/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/stateBased9964544361583616559.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:35:05] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:35:05] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:35:05] [INFO ] Time to serialize gal into /tmp/LTL7949957221048910815.gal : 1 ms
[2025-06-03 00:35:05] [INFO ] Time to serialize properties into /tmp/LTL3230184780201633932.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/LTL7949957221048910815.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7309373211066340346.hoa' '-atoms' '/tmp/LTL3230184780201633932.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...317
Loading property file /tmp/LTL3230184780201633932.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7309373211066340346.hoa
Detected timeout of ITS tools.
[2025-06-03 00:35:20] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:35:20] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:35:20] [INFO ] Time to serialize gal into /tmp/LTL12359545781591109478.gal : 1 ms
[2025-06-03 00:35:20] [INFO ] Time to serialize properties into /tmp/LTL8189512878131482478.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/LTL12359545781591109478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8189512878131482478.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((("(in3_5<2)")||(G(F("(aux8_3>aux7_7)"))))||(G("(c5>out7_0)"))))))
Formula 0 simplified : G(F!"(c5>out7_0)" & FG(!"(aux8_3>aux7_7)" & !"(in3_5<2)"))
Detected timeout of ITS tools.
[2025-06-03 00:35:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 00:35:35] [INFO ] Applying decomposition
[2025-06-03 00:35:35] [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/graph16777033120592887689.txt' '-o' '/tmp/graph16777033120592887689.bin' '-w' '/tmp/graph16777033120592887689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16777033120592887689.bin' '-l' '-1' '-v' '-w' '/tmp/graph16777033120592887689.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:35:35] [INFO ] Decomposing Gal with order
[2025-06-03 00:35:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:35:35] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-03 00:35:35] [INFO ] Flatten gal took : 10 ms
[2025-06-03 00:35:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 1 ms.
[2025-06-03 00:35:35] [INFO ] Time to serialize gal into /tmp/LTL9555956640453080288.gal : 1 ms
[2025-06-03 00:35:35] [INFO ] Time to serialize properties into /tmp/LTL7407799862240736415.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/LTL9555956640453080288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7407799862240736415.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((("(gi1.gu4.in3_5<2)")||(G(F("(gu2.aux8_3>gu2.aux7_7)"))))||(G("(gu0.c5>gu0.out7_0)"))))))
Formula 0 simplified : G(F!"(gu0.c5>gu0.out7_0)" & FG(!"(gi1.gu4.in3_5<2)" & !"(gu2.aux8_3>gu2.aux7_7)"))
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-13 finished in 125948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))&&X((p2&&G(p3)))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 106 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 78 place count 82 transition count 348
Iterating global reduction 1 with 24 rules applied. Total rules applied 102 place count 82 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 124 place count 60 transition count 126
Iterating global reduction 1 with 22 rules applied. Total rules applied 146 place count 60 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 58 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 58 transition count 110
Applied a total of 150 rules in 11 ms. Remains 58 /160 variables (removed 102) and now considering 110/592 (removed 482) transitions.
// Phase 1: matrix 110 rows 58 cols
[2025-06-03 00:35:50] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:50] [INFO ] Implicit Places using invariants in 72 ms returned [0, 7, 22, 30]
[2025-06-03 00:35:50] [INFO ] Actually due to overlaps returned [0, 7, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/160 places, 110/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 55/160 places, 110/592 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-14 finished in 300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||(p2 U p3)))&&F(p0)))'
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Graph (complete) has 1535 edges and 160 vertex of which 105 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.2 ms
Discarding 55 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 346
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 58 transition count 124
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 56 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 56 transition count 108
Applied a total of 99 rules in 16 ms. Remains 56 /160 variables (removed 104) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2025-06-03 00:35:51] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:51] [INFO ] Implicit Places using invariants in 48 ms returned [0, 7, 20, 28]
[2025-06-03 00:35:51] [INFO ] Actually due to overlaps returned [0, 7, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/160 places, 108/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 53/160 places, 108/592 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-15
Stuttering criterion allowed to conclude after 597 steps with 8 reset in 7 ms.
FORMULA PermAdmissibility-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-10-LTLCardinality-15 finished in 251 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(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' '!(G(F((p0 U (G(p0)||(p0&&F(p1)&&X(X(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((X((p0 U p1))&&F(p0)))&&X(F(p2))))'
Found a Shortening insensitive property : PermAdmissibility-PT-10-LTLCardinality-12
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p0)]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 160/160 places, 592/592 transitions.
Graph (complete) has 1535 edges and 160 vertex of which 106 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.6 ms
Discarding 54 places :
Also discarding 0 output transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 82 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 82 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 69 place count 62 transition count 132
Iterating global reduction 0 with 20 rules applied. Total rules applied 89 place count 62 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 90 place count 61 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 91 place count 61 transition count 124
Applied a total of 91 rules in 19 ms. Remains 61 /160 variables (removed 99) and now considering 124/592 (removed 468) transitions.
// Phase 1: matrix 124 rows 61 cols
[2025-06-03 00:35:52] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:52] [INFO ] Implicit Places using invariants in 48 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/160 places, 124/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 70 ms. Remains : 60/160 places, 124/592 transitions.
Running random walk in product with property : PermAdmissibility-PT-10-LTLCardinality-12
Product exploration explored 100000 steps with 3967 reset in 450 ms.
Product exploration explored 100000 steps with 3909 reset in 470 ms.
Computed a total of 60 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 124
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 p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (X (X p0)), (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 12 factoid took 510 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 312 steps (0 resets) in 5 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (X (X p0)), (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 p2)]
Knowledge based reduction with 12 factoid took 660 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 67 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 124 rows 60 cols
[2025-06-03 00:35:54] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:35:54] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 00:35:54] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-03 00:35:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:35:54] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-03 00:35:54] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-03 00:35:54] [INFO ] Computed and/alt/rep : 29/183/29 causal constraints (skipped 91 transitions) in 8 ms.
[2025-06-03 00:35:54] [INFO ] Added : 19 causal constraints over 5 iterations in 58 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 60 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 : 60/60 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2025-06-03 00:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 00:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:35:54] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:35:54] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-03 00:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 124/182 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 2/184 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 75 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3180 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 124/182 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 108/181 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 2/184 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 195 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30009 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33214ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 33215ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33368 ms. Remains : 60/60 places, 124/124 transitions.
Computed a total of 60 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 124
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 p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 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 p2), (NOT p2)]
RANDOM walk for 293 steps (0 resets) in 4 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 139 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 84 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
[2025-06-03 00:36:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:36:28] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2025-06-03 00:36:28] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-03 00:36:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:36:28] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-03 00:36:28] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-03 00:36:28] [INFO ] Computed and/alt/rep : 29/183/29 causal constraints (skipped 91 transitions) in 7 ms.
[2025-06-03 00:36:28] [INFO ] Added : 28 causal constraints over 7 iterations in 88 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 2065 reset in 454 ms.
Product exploration explored 100000 steps with 2064 reset in 479 ms.
Built C files in :
/tmp/ltsmin6048792395367976674
[2025-06-03 00:36:29] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2025-06-03 00:36:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:36:29] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2025-06-03 00:36:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:36:29] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2025-06-03 00:36:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:36:29] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6048792395367976674
Running compilation step : cd /tmp/ltsmin6048792395367976674;'/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 285 ms.
Running link step : cd /tmp/ltsmin6048792395367976674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6048792395367976674;'/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/stateBased5746963462730432807.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 124/124 transitions.
Graph (complete) has 297 edges and 60 vertex of which 39 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 33 transition count 58
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 33 transition count 58
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 29 transition count 40
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 29 transition count 40
Applied a total of 21 rules in 8 ms. Remains 29 /60 variables (removed 31) and now considering 40/124 (removed 84) transitions.
// Phase 1: matrix 40 rows 29 cols
[2025-06-03 00:36:45] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:36:45] [INFO ] Implicit Places using invariants in 33 ms returned [8, 12, 14]
[2025-06-03 00:36:45] [INFO ] Actually due to overlaps returned [12, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/60 places, 40/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44 ms. Remains : 27/60 places, 40/124 transitions.
Built C files in :
/tmp/ltsmin95422556812661158
[2025-06-03 00:36:45] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2025-06-03 00:36:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:36:45] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2025-06-03 00:36:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:36:45] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2025-06-03 00:36:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:36:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin95422556812661158
Running compilation step : cd /tmp/ltsmin95422556812661158;'/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 118 ms.
Running link step : cd /tmp/ltsmin95422556812661158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin95422556812661158;'/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/stateBased14251912699918122984.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:37:00] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:37:00] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:37:00] [INFO ] Time to serialize gal into /tmp/LTL6717997571843710625.gal : 0 ms
[2025-06-03 00:37:00] [INFO ] Time to serialize properties into /tmp/LTL17668279121465876069.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/LTL6717997571843710625.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12523955502769379877.hoa' '-atoms' '/tmp/LTL17668279121465876069.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/LTL17668279121465876069.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12523955502769379877.hoa
Detected timeout of ITS tools.
[2025-06-03 00:37:15] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:37:15] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:37:15] [INFO ] Time to serialize gal into /tmp/LTL10385798290429964995.gal : 1 ms
[2025-06-03 00:37:15] [INFO ] Time to serialize properties into /tmp/LTL9505010038773353974.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/LTL10385798290429964995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9505010038773353974.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(("(c18<=out5_4)")U("(c12<=out7_0)")))&&(F("(c18<=out5_4)"))))&&(X(F("(c13>c5)")))))
Formula 0 simplified : G(X(!"(c18<=out5_4)" R !"(c12<=out7_0)") | G!"(c18<=out5_4)") | XG!"(c13>c5)"
Detected timeout of ITS tools.
[2025-06-03 00:37:30] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:37:30] [INFO ] Applying decomposition
[2025-06-03 00:37:30] [INFO ] Flatten gal took : 13 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/graph3811880126305752397.txt' '-o' '/tmp/graph3811880126305752397.bin' '-w' '/tmp/graph3811880126305752397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3811880126305752397.bin' '-l' '-1' '-v' '-w' '/tmp/graph3811880126305752397.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:37:30] [INFO ] Decomposing Gal with order
[2025-06-03 00:37:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:37:30] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-03 00:37:30] [INFO ] Flatten gal took : 12 ms
[2025-06-03 00:37:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 2 ms.
[2025-06-03 00:37:30] [INFO ] Time to serialize gal into /tmp/LTL10563269179722793785.gal : 1 ms
[2025-06-03 00:37:30] [INFO ] Time to serialize properties into /tmp/LTL6268547099924435559.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/LTL10563269179722793785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6268547099924435559.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(("(gu0.c18<=gu0.out5_4)")U("(gu1.c12<=gu1.out7_0)")))&&(F("(gu0.c18<=gu0.out5_4)"))))&&(X(F("(gu4.c13>gu4.c5)")))))
Formula 0 simplified : G(X(!"(gu0.c18<=gu0.out5_4)" R !"(gu1.c12<=gu1.out7_0)") | G!"(gu0.c18<=gu0.out5_4)") | XG!"(gu4.c13>gu4.c5)"
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-10-LTLCardinality-12 finished in 113789 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||G(F(p1))||G(p2)))))'
[2025-06-03 00:37:45] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9912100430093236286
[2025-06-03 00:37:45] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2025-06-03 00:37:45] [INFO ] Applying decomposition
[2025-06-03 00:37:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:37:45] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2025-06-03 00:37:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:37:45] [INFO ] Flatten gal took : 21 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/graph4303623634569984696.txt' '-o' '/tmp/graph4303623634569984696.bin' '-w' '/tmp/graph4303623634569984696.weights'
[2025-06-03 00:37:45] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4303623634569984696.bin' '-l' '-1' '-v' '-w' '/tmp/graph4303623634569984696.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:37:45] [INFO ] Decomposing Gal with order
[2025-06-03 00:37:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:37:45] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:37:45] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9912100430093236286
Running compilation step : cd /tmp/ltsmin9912100430093236286;'/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'
[2025-06-03 00:37:45] [INFO ] Removed a total of 1190 redundant transitions.
[2025-06-03 00:37:45] [INFO ] Flatten gal took : 83 ms
[2025-06-03 00:37:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 20 ms.
[2025-06-03 00:37:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality2313878912851984025.gal : 17 ms
[2025-06-03 00:37:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality3131521724022483264.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/LTLCardinality2313878912851984025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3131521724022483264.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...297
Read 4 LTL properties
Checking formula 0 : !((G((F("((((gu17.out8_1+gu17.out8_0)+(gu17.out8_3+gu17.out8_2))+((gu17.out8_6+gu17.out8_7)+(gu17.out8_4+gu17.out8_5)))<=(gu17.in1_1+g...295
Formula 0 simplified : F(G!"((((gu17.out8_1+gu17.out8_0)+(gu17.out8_3+gu17.out8_2))+((gu17.out8_6+gu17.out8_7)+(gu17.out8_4+gu17.out8_5)))<=(gu17.in1_1+gu1...287
Compilation finished in 1658 ms.
Running link step : cd /tmp/ltsmin9912100430093236286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9912100430093236286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9912100430093236286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9912100430093236286;'/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' '[](<>(((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true))&&X(X((LTLAPp4==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9912100430093236286;'/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' '[](<>(((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true))&&X(X((LTLAPp4==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9912100430093236286;'/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(((LTLAPp5==true) U (LTLAPp6==true)))&&<>((LTLAPp5==true))))&&X(<>((LTLAPp7==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9912100430093236286;'/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(((LTLAPp5==true) U (LTLAPp6==true)))&&<>((LTLAPp5==true))))&&X(<>((LTLAPp7==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9912100430093236286;'/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/ltsmin9912100430093236286;'/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/ltsmin9912100430093236286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 01:01:50] [INFO ] Flatten gal took : 62 ms
[2025-06-03 01:01:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality14570557731795067599.gal : 12 ms
[2025-06-03 01:01:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality7960719550021216976.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/LTLCardinality14570557731795067599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7960719550021216976.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 : !((G((F("((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))<=(in1_1+in1_0))"))&&(F("((((aux15_2+aux15_1)+(aux15_0+...213
Formula 0 simplified : F(G!"((((out8_1+out8_0)+(out8_3+out8_2))+((out8_6+out8_7)+(out8_4+out8_5)))<=(in1_1+in1_0))" | G!"((((aux15_2+aux15_1)+(aux15_0+aux1...205
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9912100430093236286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9912100430093236286;'/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' '[](<>(((LTLAPp2==true) U ([]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true))&&X(X((LTLAPp4==true))))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-10"
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-10, 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-174876812700523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-10.tgz
mv PermAdmissibility-PT-10 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 ;