About the Execution of ITS-Tools for FunctionPointer-PT-b008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FF?FFFFFFFF?F?FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007300076.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 FunctionPointer-PT-b008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007300076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748759212165
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 06:26:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 06:26:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 06:26:55] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2025-06-01 06:26:55] [INFO ] Transformed 306 places.
[2025-06-01 06:26:55] [INFO ] Transformed 840 transitions.
[2025-06-01 06:26:55] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 665 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 84 places in 12 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b008-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 30 place count 192 transition count 574
Iterating global reduction 1 with 20 rules applied. Total rules applied 50 place count 192 transition count 574
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 116 place count 192 transition count 508
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 126 place count 182 transition count 488
Iterating global reduction 2 with 10 rules applied. Total rules applied 136 place count 182 transition count 488
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 160 place count 182 transition count 464
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 165 place count 177 transition count 454
Iterating global reduction 3 with 5 rules applied. Total rules applied 170 place count 177 transition count 454
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 174 transition count 442
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 174 transition count 442
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 179 place count 171 transition count 436
Iterating global reduction 3 with 3 rules applied. Total rules applied 182 place count 171 transition count 436
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 170 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 170 transition count 432
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 169 transition count 428
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 169 transition count 428
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 168 transition count 426
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 168 transition count 426
Applied a total of 188 rules in 205 ms. Remains 168 /222 variables (removed 54) and now considering 426/648 (removed 222) transitions.
[2025-06-01 06:26:56] [INFO ] Flow matrix only has 288 transitions (discarded 138 similar events)
// Phase 1: matrix 288 rows 168 cols
[2025-06-01 06:26:56] [INFO ] Computed 2 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:26:56] [INFO ] Implicit Places using invariants in 660 ms returned []
[2025-06-01 06:26:56] [INFO ] Flow matrix only has 288 transitions (discarded 138 similar events)
[2025-06-01 06:26:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:26:57] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-01 06:26:57] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-06-01 06:26:57] [INFO ] Flow matrix only has 288 transitions (discarded 138 similar events)
[2025-06-01 06:26:57] [INFO ] Invariant cache hit.
[2025-06-01 06:26:57] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 288/456 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 59/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 229 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 288/456 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 59/229 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 424/653 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:27:49] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:27:49] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:27:49] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:27:52] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 657 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 61020ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 61058ms
Starting structural reductions in LTL mode, iteration 1 : 168/222 places, 426/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62679 ms. Remains : 168/222 places, 426/648 transitions.
Support contains 30 out of 168 places after structural reductions.
[2025-06-01 06:27:58] [INFO ] Flatten gal took : 122 ms
[2025-06-01 06:27:58] [INFO ] Flatten gal took : 74 ms
[2025-06-01 06:27:59] [INFO ] Input system was already deterministic with 426 transitions.
Support contains 29 out of 168 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 23
RANDOM walk for 40002 steps (39 resets) in 1710 ms. (23 steps per ms) remains 0/23 properties
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(G(p1))))&&p0))))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 390
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 390
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 147 transition count 362
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 147 transition count 362
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 142 transition count 348
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 137 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 137 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 133 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 133 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 129 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 129 transition count 310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 125 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 125 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 121 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 121 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 117 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 117 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 115 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 114 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 114 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 113 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 113 transition count 276
Applied a total of 118 rules in 52 ms. Remains 113 /168 variables (removed 55) and now considering 276/426 (removed 150) transitions.
[2025-06-01 06:28:00] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
// Phase 1: matrix 187 rows 113 cols
[2025-06-01 06:28:00] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:28:00] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-01 06:28:00] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
[2025-06-01 06:28:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:28:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-01 06:28:00] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-01 06:28:00] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
[2025-06-01 06:28:00] [INFO ] Invariant cache hit.
[2025-06-01 06:28:00] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 187/300 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 43/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 158 constraints, problems are : Problem set: 0 solved, 274 unsolved in 15531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 187/300 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 43/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 274/432 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:28:27] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:28:27] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 434 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45755ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 45757ms
Starting structural reductions in LTL mode, iteration 1 : 113/168 places, 276/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46550 ms. Remains : 113/168 places, 276/426 transitions.
Stuttering acceptance computed with spot in 620 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-00 finished in 47265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(!p0))) U (p1 U G(!p1))))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 390
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 390
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 147 transition count 362
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 147 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 140 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 140 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 133 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 133 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 128 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 128 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 118 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 123 place count 108 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 128 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 107 transition count 260
Applied a total of 130 rules in 66 ms. Remains 107 /168 variables (removed 61) and now considering 260/426 (removed 166) transitions.
[2025-06-01 06:28:47] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
// Phase 1: matrix 175 rows 107 cols
[2025-06-01 06:28:47] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:28:47] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-01 06:28:47] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
[2025-06-01 06:28:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:28:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:28:48] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-06-01 06:28:48] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
[2025-06-01 06:28:48] [INFO ] Invariant cache hit.
[2025-06-01 06:28:48] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 149 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13892 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 258/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:29:12] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:29:12] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:29:12] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 410 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44050ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 44052ms
Starting structural reductions in LTL mode, iteration 1 : 107/168 places, 260/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44852 ms. Remains : 107/168 places, 260/426 transitions.
Stuttering acceptance computed with spot in 593 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-02
Product exploration explored 100000 steps with 20054 reset in 596 ms.
Product exploration explored 100000 steps with 19964 reset in 381 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 12 states, 23 edges and 2 AP (stutter sensitive) to 12 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
RANDOM walk for 29047 steps (43 resets) in 216 ms. (133 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 12 states, 23 edges and 2 AP (stutter sensitive) to 12 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
Stuttering acceptance computed with spot in 564 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-01 06:29:35] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
[2025-06-01 06:29:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:29:35] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-01 06:29:35] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
[2025-06-01 06:29:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:29:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:29:36] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-06-01 06:29:36] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
[2025-06-01 06:29:36] [INFO ] Invariant cache hit.
[2025-06-01 06:29:36] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 149 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13888 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 258/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:30:00] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:30:00] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:30:00] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 410 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44003ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 44004ms
Finished structural reductions in LTL mode , in 1 iterations and 44682 ms. Remains : 107/107 places, 260/260 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 12 states, 23 edges and 2 AP (stutter sensitive) to 12 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
RANDOM walk for 33205 steps (24 resets) in 158 ms. (208 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 304 ms. Reduced automaton from 12 states, 23 edges and 2 AP (stutter sensitive) to 12 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 560 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
Stuttering acceptance computed with spot in 558 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
Stuttering acceptance computed with spot in 561 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
Product exploration explored 100000 steps with 20035 reset in 289 ms.
Product exploration explored 100000 steps with 19974 reset in 282 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 473 ms :[p1, (AND p0 p1), (AND p0 p1), p0, (AND p0 p1), p0, true, (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, p1]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 260/260 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 256
Applied a total of 4 rules in 77 ms. Remains 107 /107 variables (removed 0) and now considering 256/260 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:30:24] [INFO ] Redundant transitions in 24 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 06:30:24] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 107 cols
[2025-06-01 06:30:24] [INFO ] Computed 2 invariants in 3 ms
[2025-06-01 06:30:24] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 173/280 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 149 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13309 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 173/280 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/403 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:30:47] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:30:47] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:30:58] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 406 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43478ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/107 places, 256/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43590 ms. Remains : 107/107 places, 256/260 transitions.
Built C files in :
/tmp/ltsmin16433818509715734847
[2025-06-01 06:31:08] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16433818509715734847
Running compilation step : cd /tmp/ltsmin16433818509715734847;'/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 1157 ms.
Running link step : cd /tmp/ltsmin16433818509715734847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16433818509715734847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6410954837918158352.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-01 06:31:23] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
// Phase 1: matrix 175 rows 107 cols
[2025-06-01 06:31:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:31:23] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-01 06:31:23] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
[2025-06-01 06:31:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:31:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:31:23] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-06-01 06:31:23] [INFO ] Flow matrix only has 175 transitions (discarded 85 similar events)
[2025-06-01 06:31:23] [INFO ] Invariant cache hit.
[2025-06-01 06:31:23] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 149 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13591 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 258/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:31:47] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:31:47] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:31:47] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 410 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43710ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43712ms
Finished structural reductions in LTL mode , in 1 iterations and 44223 ms. Remains : 107/107 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin2000012267574170828
[2025-06-01 06:32:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2000012267574170828
Running compilation step : cd /tmp/ltsmin2000012267574170828;'/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 640 ms.
Running link step : cd /tmp/ltsmin2000012267574170828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2000012267574170828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4033021153386980636.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 06:32:22] [INFO ] Flatten gal took : 18 ms
[2025-06-01 06:32:22] [INFO ] Flatten gal took : 18 ms
[2025-06-01 06:32:22] [INFO ] Time to serialize gal into /tmp/LTL10919398028424878568.gal : 5 ms
[2025-06-01 06:32:22] [INFO ] Time to serialize properties into /tmp/LTL18118385894601259158.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/LTL10919398028424878568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12032299182691142937.hoa' '-atoms' '/tmp/LTL18118385894601259158.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18118385894601259158.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12032299182691142937.hoa
Detected timeout of ITS tools.
[2025-06-01 06:32:37] [INFO ] Flatten gal took : 16 ms
[2025-06-01 06:32:37] [INFO ] Flatten gal took : 17 ms
[2025-06-01 06:32:37] [INFO ] Time to serialize gal into /tmp/LTL3554454386776202366.gal : 3 ms
[2025-06-01 06:32:37] [INFO ] Time to serialize properties into /tmp/LTL14659593113781395522.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/LTL3554454386776202366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14659593113781395522.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(!("((s1>=1)&&(l182>=1))")))))U(("((s1>=1)&&(l230>=1))")U(G(!("((s1>=1)&&(l230>=1))"))))))
Formula 0 simplified : XXX"((s1>=1)&&(l182>=1))" R (!"((s1>=1)&&(l230>=1))" R F"((s1>=1)&&(l230>=1))")
Detected timeout of ITS tools.
[2025-06-01 06:32:53] [INFO ] Flatten gal took : 16 ms
[2025-06-01 06:32:53] [INFO ] Applying decomposition
[2025-06-01 06:32:53] [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/graph13581775195274465968.txt' '-o' '/tmp/graph13581775195274465968.bin' '-w' '/tmp/graph13581775195274465968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13581775195274465968.bin' '-l' '-1' '-v' '-w' '/tmp/graph13581775195274465968.weights' '-q' '0' '-e' '0.001'
[2025-06-01 06:32:53] [INFO ] Decomposing Gal with order
[2025-06-01 06:32:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 06:32:53] [INFO ] Removed a total of 429 redundant transitions.
[2025-06-01 06:32:53] [INFO ] Flatten gal took : 85 ms
[2025-06-01 06:32:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 18 ms.
[2025-06-01 06:32:53] [INFO ] Time to serialize gal into /tmp/LTL1789031848224988906.gal : 7 ms
[2025-06-01 06:32:53] [INFO ] Time to serialize properties into /tmp/LTL14464274515453658859.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/LTL1789031848224988906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14464274515453658859.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(!("((i1.u1.s1>=1)&&(i9.u23.l182>=1))")))))U(("((i1.u1.s1>=1)&&(i9.u21.l230>=1))")U(G(!("((i1.u1.s1>=1)&&(i9.u21.l230>=1))"))...159
Formula 0 simplified : XXX"((i1.u1.s1>=1)&&(i9.u23.l182>=1))" R (!"((i1.u1.s1>=1)&&(i9.u21.l230>=1))" R F"((i1.u1.s1>=1)&&(i9.u21.l230>=1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b008-LTLFireability-02 finished in 260974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(F(p0)))) U (G(p1) U p2))))'
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 157 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 157 transition count 394
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 157 transition count 386
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 149 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 149 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 144 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 144 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 139 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 139 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 135 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 135 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 131 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 131 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 127 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 127 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 123 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 123 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 119 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 119 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 117 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 117 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 116 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 116 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 115 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 115 transition count 282
Applied a total of 114 rules in 36 ms. Remains 115 /168 variables (removed 53) and now considering 282/426 (removed 144) transitions.
[2025-06-01 06:33:08] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
// Phase 1: matrix 191 rows 115 cols
[2025-06-01 06:33:08] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:33:08] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-01 06:33:08] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
[2025-06-01 06:33:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:33:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-01 06:33:08] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2025-06-01 06:33:08] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
[2025-06-01 06:33:08] [INFO ] Invariant cache hit.
[2025-06-01 06:33:09] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 191/306 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 160 constraints, problems are : Problem set: 0 solved, 280 unsolved in 15204 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 191/306 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 280/440 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:33:35] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:33:35] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:33:35] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 443 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 45337ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 45338ms
Starting structural reductions in LTL mode, iteration 1 : 115/168 places, 282/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45964 ms. Remains : 115/168 places, 282/426 transitions.
Stuttering acceptance computed with spot in 554 ms :[(NOT p2), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-03
Stuttering criterion allowed to conclude after 276 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-03 finished in 46550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 388
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 147 transition count 362
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 141 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 141 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 135 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 135 transition count 320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 130 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 130 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 125 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 115 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 110 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 109 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 109 transition count 262
Applied a total of 128 rules in 131 ms. Remains 109 /168 variables (removed 59) and now considering 262/426 (removed 164) transitions.
[2025-06-01 06:33:55] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 109 cols
[2025-06-01 06:33:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:33:55] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-01 06:33:55] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2025-06-01 06:33:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:33:55] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-01 06:33:55] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:33:55] [INFO ] Redundant transitions in 4 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-01 06:33:55] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2025-06-01 06:33:55] [INFO ] Invariant cache hit.
[2025-06-01 06:33:55] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 14351 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 260/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:34:21] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:34:21] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/288 variables, and 414 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44459ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 44460ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/168 places, 262/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45353 ms. Remains : 109/168 places, 262/426 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-05
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-05 finished in 45409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 155 transition count 386
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 155 transition count 386
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 155 transition count 380
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 145 transition count 358
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 145 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 139 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 139 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 133 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 133 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 128 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 123 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 118 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 121 place count 108 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 126 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 106 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 104 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 104 transition count 252
Applied a total of 136 rules in 62 ms. Remains 104 /168 variables (removed 64) and now considering 252/426 (removed 174) transitions.
[2025-06-01 06:34:40] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 104 cols
[2025-06-01 06:34:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:34:40] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-01 06:34:40] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2025-06-01 06:34:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:34:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:34:40] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:34:40] [INFO ] Redundant transitions in 4 ms returned []
Running 250 sub problems to find dead transitions.
[2025-06-01 06:34:40] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2025-06-01 06:34:40] [INFO ] Invariant cache hit.
[2025-06-01 06:34:40] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 146 constraints, problems are : Problem set: 0 solved, 250 unsolved in 8468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/275 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 250/396 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:34:58] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:34:58] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:34:58] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 399 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 38578ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 38579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/168 places, 252/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39158 ms. Remains : 104/168 places, 252/426 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-07
Product exploration explored 100000 steps with 399 reset in 731 ms.
Stack based approach found an accepted trace after 88406 steps with 366 reset with depth 311 and stack size 310 in 525 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-07 finished in 40484 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 X(p1))||X(X(G(p2)))))'
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 156 transition count 384
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 146 transition count 362
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 139 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 139 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 132 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 114 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 114 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 108 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 108 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 130 place count 102 transition count 248
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 100 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 98 transition count 240
Applied a total of 144 rules in 19 ms. Remains 98 /168 variables (removed 70) and now considering 240/426 (removed 186) transitions.
[2025-06-01 06:35:20] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2025-06-01 06:35:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:35:20] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-01 06:35:20] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2025-06-01 06:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:35:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 06:35:21] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2025-06-01 06:35:21] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2025-06-01 06:35:21] [INFO ] Invariant cache hit.
[2025-06-01 06:35:21] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 12550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:35:41] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:35:41] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 377 constraints, problems are : Problem set: 0 solved, 238 unsolved in 27952 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40570ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 40571ms
Starting structural reductions in LTL mode, iteration 1 : 98/168 places, 240/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41018 ms. Remains : 98/168 places, 240/426 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-08
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-08 finished in 41349 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(p3)||p2))))))'
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 157 transition count 392
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 157 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 30 place count 157 transition count 384
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 150 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 150 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 145 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 145 transition count 352
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 141 transition count 336
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 141 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 137 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 137 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 133 transition count 318
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 133 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 129 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 129 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 125 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 125 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 121 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 121 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 120 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 120 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 119 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 119 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 118 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 118 transition count 286
Applied a total of 108 rules in 20 ms. Remains 118 /168 variables (removed 50) and now considering 286/426 (removed 140) transitions.
[2025-06-01 06:36:02] [INFO ] Flow matrix only has 195 transitions (discarded 91 similar events)
// Phase 1: matrix 195 rows 118 cols
[2025-06-01 06:36:02] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:36:02] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-01 06:36:02] [INFO ] Flow matrix only has 195 transitions (discarded 91 similar events)
[2025-06-01 06:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:36:02] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-01 06:36:02] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-01 06:36:02] [INFO ] Flow matrix only has 195 transitions (discarded 91 similar events)
[2025-06-01 06:36:02] [INFO ] Invariant cache hit.
[2025-06-01 06:36:02] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 195/313 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 46/166 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 284 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/313 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 166 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 195/313 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 46/166 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 284/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:36:23] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:36:23] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:36:40] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 453 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41159ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 41160ms
Starting structural reductions in LTL mode, iteration 1 : 118/168 places, 286/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41695 ms. Remains : 118/168 places, 286/426 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p3))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-09
Entered a terminal (fully accepting) state of product in 442 steps with 1 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-09 finished in 41855 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((F(G(p1))&&p0))||X(F(!p1))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 156 transition count 384
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 146 transition count 362
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 139 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 139 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 132 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 114 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 114 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 108 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 108 transition count 260
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 130 place count 102 transition count 248
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 100 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 98 transition count 240
Applied a total of 144 rules in 20 ms. Remains 98 /168 variables (removed 70) and now considering 240/426 (removed 186) transitions.
[2025-06-01 06:36:44] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2025-06-01 06:36:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:36:44] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-01 06:36:44] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2025-06-01 06:36:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:36:44] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 06:36:44] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2025-06-01 06:36:44] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2025-06-01 06:36:44] [INFO ] Invariant cache hit.
[2025-06-01 06:36:44] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 8407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:37:00] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:37:00] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 377 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38505ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 38506ms
Starting structural reductions in LTL mode, iteration 1 : 98/168 places, 240/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39007 ms. Remains : 98/168 places, 240/426 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-10
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-10 finished in 39127 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 (p1||G(!p0))))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 155 transition count 386
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 155 transition count 386
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 155 transition count 380
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 145 transition count 358
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 145 transition count 358
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 138 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 138 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 127 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 122 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 117 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 117 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 112 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 112 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 123 place count 107 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 128 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 106 transition count 256
Applied a total of 134 rules in 59 ms. Remains 106 /168 variables (removed 62) and now considering 256/426 (removed 170) transitions.
[2025-06-01 06:37:23] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2025-06-01 06:37:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:37:23] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-01 06:37:23] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:37:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:37:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:37:23] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:37:23] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 06:37:23] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:37:23] [INFO ] Invariant cache hit.
[2025-06-01 06:37:23] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:37:45] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:37:49] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 404 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43497ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43497ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/168 places, 256/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44308 ms. Remains : 106/168 places, 256/426 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-11
Product exploration explored 100000 steps with 446 reset in 413 ms.
Product exploration explored 100000 steps with 444 reset in 431 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 14036 steps (31 resets) in 53 ms. (259 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 256/256 transitions.
Applied a total of 0 rules in 10 ms. Remains 106 /106 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2025-06-01 06:38:09] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:38:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:38:09] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-01 06:38:09] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:38:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:38:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:38:09] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:38:09] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 06:38:09] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:38:09] [INFO ] Invariant cache hit.
[2025-06-01 06:38:09] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:38:33] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:38:37] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 404 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43104ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43920 ms. Remains : 106/106 places, 256/256 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 30257 steps (47 resets) in 124 ms. (242 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 305 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 464 reset in 448 ms.
Product exploration explored 100000 steps with 440 reset in 484 ms.
Built C files in :
/tmp/ltsmin7882412245466338268
[2025-06-01 06:38:54] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2025-06-01 06:38:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:38:54] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2025-06-01 06:38:54] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:38:54] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2025-06-01 06:38:54] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:38:54] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7882412245466338268
Running compilation step : cd /tmp/ltsmin7882412245466338268;'/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 786 ms.
Running link step : cd /tmp/ltsmin7882412245466338268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7882412245466338268;'/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/stateBased9788472382203305337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2025-06-01 06:39:09] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:39:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:39:10] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-01 06:39:10] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:39:10] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:39:10] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:39:10] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 06:39:10] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:39:10] [INFO ] Invariant cache hit.
[2025-06-01 06:39:10] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13817 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:39:33] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:39:38] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 404 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43979ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43981ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44565 ms. Remains : 106/106 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin1183986067575615541
[2025-06-01 06:39:54] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2025-06-01 06:39:54] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:39:54] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2025-06-01 06:39:54] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:39:54] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2025-06-01 06:39:54] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:39:54] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1183986067575615541
Running compilation step : cd /tmp/ltsmin1183986067575615541;'/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 1015 ms.
Running link step : cd /tmp/ltsmin1183986067575615541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1183986067575615541;'/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/stateBased5596660244692037003.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 06:40:09] [INFO ] Flatten gal took : 15 ms
[2025-06-01 06:40:09] [INFO ] Flatten gal took : 15 ms
[2025-06-01 06:40:09] [INFO ] Time to serialize gal into /tmp/LTL11834296825321412419.gal : 4 ms
[2025-06-01 06:40:09] [INFO ] Time to serialize properties into /tmp/LTL16264125313762931924.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/LTL11834296825321412419.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8126231675806237135.hoa' '-atoms' '/tmp/LTL16264125313762931924.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/LTL16264125313762931924.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8126231675806237135.hoa
Detected timeout of ITS tools.
[2025-06-01 06:40:24] [INFO ] Flatten gal took : 14 ms
[2025-06-01 06:40:24] [INFO ] Flatten gal took : 14 ms
[2025-06-01 06:40:24] [INFO ] Time to serialize gal into /tmp/LTL10839661056288062947.gal : 4 ms
[2025-06-01 06:40:24] [INFO ] Time to serialize properties into /tmp/LTL3379182833294504294.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/LTL10839661056288062947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3379182833294504294.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((!("((s0>=1)&&(l238>=1))"))U((G(!("((s0>=1)&&(l238>=1))")))||("(((s3>=1)&&(l42>=1))&&(!((s0>=1)&&(l238>=1))))"))))))
Formula 0 simplified : FG("((s0>=1)&&(l238>=1))" M !"(((s3>=1)&&(l42>=1))&&(!((s0>=1)&&(l238>=1))))")
Detected timeout of ITS tools.
[2025-06-01 06:40:39] [INFO ] Flatten gal took : 12 ms
[2025-06-01 06:40:39] [INFO ] Applying decomposition
[2025-06-01 06:40:39] [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/graph1783871366447932953.txt' '-o' '/tmp/graph1783871366447932953.bin' '-w' '/tmp/graph1783871366447932953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1783871366447932953.bin' '-l' '-1' '-v' '-w' '/tmp/graph1783871366447932953.weights' '-q' '0' '-e' '0.001'
[2025-06-01 06:40:39] [INFO ] Decomposing Gal with order
[2025-06-01 06:40:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 06:40:39] [INFO ] Removed a total of 426 redundant transitions.
[2025-06-01 06:40:39] [INFO ] Flatten gal took : 39 ms
[2025-06-01 06:40:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 12 ms.
[2025-06-01 06:40:39] [INFO ] Time to serialize gal into /tmp/LTL12076007340459736723.gal : 3 ms
[2025-06-01 06:40:39] [INFO ] Time to serialize properties into /tmp/LTL1934585588698632295.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/LTL12076007340459736723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1934585588698632295.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i10.u0.s0>=1)&&(i11.i1.u29.l238>=1))"))U((G(!("((i10.u0.s0>=1)&&(i11.i1.u29.l238>=1))")))||("(((i0.u1.s3>=1)&&(i1.u3.l42>...210
Formula 0 simplified : FG("((i10.u0.s0>=1)&&(i11.i1.u29.l238>=1))" M !"(((i0.u1.s3>=1)&&(i1.u3.l42>=1))&&(!((i10.u0.s0>=1)&&(i11.i1.u29.l238>=1))))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b008-LTLFireability-11 finished in 211848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 390
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 390
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 147 transition count 362
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 141 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 141 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 135 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 135 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 130 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 130 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 125 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 119 place count 110 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 124 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 106 transition count 258
Applied a total of 132 rules in 20 ms. Remains 106 /168 variables (removed 62) and now considering 258/426 (removed 168) transitions.
[2025-06-01 06:40:54] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2025-06-01 06:40:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:40:55] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-01 06:40:55] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2025-06-01 06:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:40:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:40:55] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-01 06:40:55] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2025-06-01 06:40:55] [INFO ] Invariant cache hit.
[2025-06-01 06:40:55] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 256 unsolved in 13365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 256/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:41:18] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:41:19] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 406 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43472ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 43474ms
Starting structural reductions in LTL mode, iteration 1 : 106/168 places, 258/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43903 ms. Remains : 106/168 places, 258/426 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-12
Stuttering criterion allowed to conclude after 12069 steps with 55 reset in 59 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-12 finished in 44108 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 (p1||G(!p0))))))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 390
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 390
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 156 transition count 384
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 147 transition count 364
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 147 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 141 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 141 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 135 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 135 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 130 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 125 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 115 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 110 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 106 transition count 256
Applied a total of 134 rules in 57 ms. Remains 106 /168 variables (removed 62) and now considering 256/426 (removed 170) transitions.
[2025-06-01 06:41:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2025-06-01 06:41:39] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:41:39] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-01 06:41:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:41:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:41:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:41:39] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:41:39] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 06:41:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:41:39] [INFO ] Invariant cache hit.
[2025-06-01 06:41:39] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13508 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:42:03] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:42:03] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:42:03] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:42:05] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 406 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43650ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43651ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/168 places, 256/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44457 ms. Remains : 106/168 places, 256/426 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-13
Product exploration explored 100000 steps with 437 reset in 465 ms.
Product exploration explored 100000 steps with 447 reset in 371 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40001 steps (63 resets) in 123 ms. (322 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2025-06-01 06:42:25] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:42:25] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-01 06:42:25] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:42:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:42:25] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:42:25] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 06:42:25] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:42:25] [INFO ] Invariant cache hit.
[2025-06-01 06:42:25] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13871 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:42:48] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:42:48] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:42:48] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:42:50] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 406 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43979ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43980ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44478 ms. Remains : 106/106 places, 256/256 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40004 steps (72 resets) in 269 ms. (148 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 21805 steps (6 resets) in 70 ms. (307 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 457 reset in 446 ms.
Product exploration explored 100000 steps with 431 reset in 329 ms.
Built C files in :
/tmp/ltsmin2765787566863463658
[2025-06-01 06:43:11] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2025-06-01 06:43:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:43:11] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2025-06-01 06:43:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:43:11] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2025-06-01 06:43:11] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:43:11] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2765787566863463658
Running compilation step : cd /tmp/ltsmin2765787566863463658;'/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 956 ms.
Running link step : cd /tmp/ltsmin2765787566863463658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2765787566863463658;'/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/stateBased12546169871445632929.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2025-06-01 06:43:26] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:43:26] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-01 06:43:26] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:43:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:43:27] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:43:27] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 06:43:27] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2025-06-01 06:43:27] [INFO ] Invariant cache hit.
[2025-06-01 06:43:27] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:43:50] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:43:50] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:43:50] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:43:52] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 406 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43280ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43281ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43789 ms. Remains : 106/106 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin17726064995661110281
[2025-06-01 06:44:10] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2025-06-01 06:44:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:44:10] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2025-06-01 06:44:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:44:10] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2025-06-01 06:44:10] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:44:10] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17726064995661110281
Running compilation step : cd /tmp/ltsmin17726064995661110281;'/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 1033 ms.
Running link step : cd /tmp/ltsmin17726064995661110281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17726064995661110281;'/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/stateBased17462274140095230550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 06:44:25] [INFO ] Flatten gal took : 12 ms
[2025-06-01 06:44:25] [INFO ] Flatten gal took : 11 ms
[2025-06-01 06:44:25] [INFO ] Time to serialize gal into /tmp/LTL5722057927240977646.gal : 3 ms
[2025-06-01 06:44:25] [INFO ] Time to serialize properties into /tmp/LTL8599310058601543751.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/LTL5722057927240977646.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13830560566689919826.hoa' '-atoms' '/tmp/LTL8599310058601543751.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8599310058601543751.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13830560566689919826.hoa
Detected timeout of ITS tools.
[2025-06-01 06:44:40] [INFO ] Flatten gal took : 9 ms
[2025-06-01 06:44:40] [INFO ] Flatten gal took : 9 ms
[2025-06-01 06:44:40] [INFO ] Time to serialize gal into /tmp/LTL18345638937715793708.gal : 2 ms
[2025-06-01 06:44:40] [INFO ] Time to serialize properties into /tmp/LTL12832940080012403131.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/LTL18345638937715793708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12832940080012403131.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((!("((s0>=1)&&(l233>=1))"))U((G(!("((s0>=1)&&(l233>=1))")))||("((!((s0>=1)&&(l71>=1)))&&(!((s0>=1)&&(l233>=1))))"))))))
Formula 0 simplified : FG("((s0>=1)&&(l233>=1))" M !"((!((s0>=1)&&(l71>=1)))&&(!((s0>=1)&&(l233>=1))))")
Detected timeout of ITS tools.
[2025-06-01 06:44:55] [INFO ] Flatten gal took : 9 ms
[2025-06-01 06:44:55] [INFO ] Applying decomposition
[2025-06-01 06:44:55] [INFO ] Flatten gal took : 9 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/graph9885126554833832032.txt' '-o' '/tmp/graph9885126554833832032.bin' '-w' '/tmp/graph9885126554833832032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9885126554833832032.bin' '-l' '-1' '-v' '-w' '/tmp/graph9885126554833832032.weights' '-q' '0' '-e' '0.001'
[2025-06-01 06:44:55] [INFO ] Decomposing Gal with order
[2025-06-01 06:44:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 06:44:55] [INFO ] Removed a total of 427 redundant transitions.
[2025-06-01 06:44:55] [INFO ] Flatten gal took : 25 ms
[2025-06-01 06:44:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 12 ms.
[2025-06-01 06:44:55] [INFO ] Time to serialize gal into /tmp/LTL9830485621626755372.gal : 3 ms
[2025-06-01 06:44:55] [INFO ] Time to serialize properties into /tmp/LTL6096047692562890409.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/LTL9830485621626755372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6096047692562890409.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i8.u1.s0>=1)&&(i10.i0.u28.l233>=1))"))U((G(!("((i8.u1.s0>=1)&&(i10.i0.u28.l233>=1))")))||("((!((i8.u1.s0>=1)&&(u8.l71>=1)...207
Formula 0 simplified : FG("((i8.u1.s0>=1)&&(i10.i0.u28.l233>=1))" M !"((!((i8.u1.s0>=1)&&(u8.l71>=1)))&&(!((i8.u1.s0>=1)&&(i10.i0.u28.l233>=1))))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b008-LTLFireability-13 finished in 211773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p1)&&p0)))))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 388
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 147 transition count 364
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 147 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 141 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 141 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 135 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 135 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 130 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 130 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 125 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 115 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 110 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 107 transition count 262
Applied a total of 128 rules in 19 ms. Remains 107 /168 variables (removed 61) and now considering 262/426 (removed 164) transitions.
[2025-06-01 06:45:10] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2025-06-01 06:45:10] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:45:11] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-01 06:45:11] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2025-06-01 06:45:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:45:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:45:11] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2025-06-01 06:45:11] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2025-06-01 06:45:11] [INFO ] Invariant cache hit.
[2025-06-01 06:45:11] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 149 constraints, problems are : Problem set: 0 solved, 260 unsolved in 14233 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 260/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:45:35] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:45:35] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:45:36] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44390ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 44392ms
Starting structural reductions in LTL mode, iteration 1 : 107/168 places, 262/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44917 ms. Remains : 107/168 places, 262/426 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-14 finished in 45193 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 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 426/426 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 156 transition count 390
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 156 transition count 390
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 156 transition count 382
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 147 transition count 362
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 141 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 141 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 135 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 135 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 130 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 130 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 125 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 119 place count 110 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 124 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 106 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 136 place count 106 transition count 254
Applied a total of 136 rules in 62 ms. Remains 106 /168 variables (removed 62) and now considering 254/426 (removed 172) transitions.
[2025-06-01 06:45:56] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2025-06-01 06:45:56] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:45:56] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-01 06:45:56] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2025-06-01 06:45:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 06:45:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 06:45:56] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 06:45:56] [INFO ] Redundant transitions in 2 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-01 06:45:56] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2025-06-01 06:45:56] [INFO ] Invariant cache hit.
[2025-06-01 06:45:56] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 13598 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:46:20] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:46:20] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 06:46:20] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 403 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43737ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 43738ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/168 places, 254/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44543 ms. Remains : 106/168 places, 254/426 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-15
Stuttering criterion allowed to conclude after 547 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-15 finished in 44596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(!p0))) U (p1 U G(!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 (p1||G(!p0))))))'
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 (p1||G(!p0))))))'
[2025-06-01 06:46:41] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7646228378010135992
[2025-06-01 06:46:41] [INFO ] Computing symmetric may disable matrix : 426 transitions.
[2025-06-01 06:46:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:46:41] [INFO ] Applying decomposition
[2025-06-01 06:46:41] [INFO ] Computing symmetric may enable matrix : 426 transitions.
[2025-06-01 06:46:41] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 06:46:41] [INFO ] Flatten gal took : 25 ms
[2025-06-01 06:46:41] [INFO ] Computing Do-Not-Accords matrix : 426 transitions.
[2025-06-01 06:46:41] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12485939726679845880.txt' '-o' '/tmp/graph12485939726679845880.bin' '-w' '/tmp/graph12485939726679845880.weights'
[2025-06-01 06:46:41] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7646228378010135992
Running compilation step : cd /tmp/ltsmin7646228378010135992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12485939726679845880.bin' '-l' '-1' '-v' '-w' '/tmp/graph12485939726679845880.weights' '-q' '0' '-e' '0.001'
[2025-06-01 06:46:41] [INFO ] Decomposing Gal with order
[2025-06-01 06:46:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 06:46:41] [INFO ] Removed a total of 674 redundant transitions.
[2025-06-01 06:46:41] [INFO ] Flatten gal took : 59 ms
[2025-06-01 06:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 257 labels/synchronizations in 30 ms.
[2025-06-01 06:46:41] [INFO ] Time to serialize gal into /tmp/LTLFireability6152942980804256424.gal : 7 ms
[2025-06-01 06:46:41] [INFO ] Time to serialize properties into /tmp/LTLFireability15065072170124723617.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/LTLFireability6152942980804256424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15065072170124723617.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !(((X(X(X(!("((i0.u1.s1>=1)&&(i13.u0.l182>=1))")))))U(("((i0.u1.s1>=1)&&(i14.u43.l230>=1))")U(G(!("((i0.u1.s1>=1)&&(i14.u43.l230>=1))"...161
Formula 0 simplified : XXX"((i0.u1.s1>=1)&&(i13.u0.l182>=1))" R (!"((i0.u1.s1>=1)&&(i14.u43.l230>=1))" R F"((i0.u1.s1>=1)&&(i14.u43.l230>=1))")
Compilation finished in 1625 ms.
Running link step : cd /tmp/ltsmin7646228378010135992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7646228378010135992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X(!(LTLAPp0==true)))) U ((LTLAPp1==true) U [](!(LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.037: LTL layer: formula: (X(X(X(!(LTLAPp0==true)))) U ((LTLAPp1==true) U [](!(LTLAPp1==true))))
pins2lts-mc-linux64( 3/ 8), 0.037: "(X(X(X(!(LTLAPp0==true)))) U ((LTLAPp1==true) U [](!(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.101: There are 433 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.101: State length is 169, there are 451 groups
pins2lts-mc-linux64( 0/ 8), 0.101: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.101: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.101: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.102: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.156: [Blue] ~21 levels ~960 states ~2048 transitions
pins2lts-mc-linux64( 1/ 8), 0.205: [Blue] ~42 levels ~1920 states ~4360 transitions
pins2lts-mc-linux64( 1/ 8), 0.269: [Blue] ~73 levels ~3840 states ~9136 transitions
pins2lts-mc-linux64( 1/ 8), 0.399: [Blue] ~132 levels ~7680 states ~19768 transitions
pins2lts-mc-linux64( 1/ 8), 0.662: [Blue] ~270 levels ~15360 states ~41080 transitions
pins2lts-mc-linux64( 1/ 8), 1.200: [Blue] ~537 levels ~30720 states ~84160 transitions
pins2lts-mc-linux64( 1/ 8), 2.177: [Blue] ~1048 levels ~61440 states ~171368 transitions
pins2lts-mc-linux64( 5/ 8), 3.813: [Blue] ~1879 levels ~122880 states ~304736 transitions
pins2lts-mc-linux64( 4/ 8), 6.030: [Blue] ~4390 levels ~245760 states ~526880 transitions
pins2lts-mc-linux64( 4/ 8), 9.208: [Blue] ~8778 levels ~491520 states ~1053584 transitions
pins2lts-mc-linux64( 4/ 8), 14.392: [Blue] ~17555 levels ~983040 states ~2106848 transitions
pins2lts-mc-linux64( 4/ 8), 25.459: [Blue] ~35110 levels ~1966080 states ~4213280 transitions
pins2lts-mc-linux64( 4/ 8), 47.361: [Blue] ~70218 levels ~3932160 states ~8426384 transitions
pins2lts-mc-linux64( 6/ 8), 89.948: [Blue] ~982426 levels ~7864320 states ~50439144 transitions
pins2lts-mc-linux64( 6/ 8), 175.673: [Blue] ~1965466 levels ~15728640 states ~100901864 transitions
pins2lts-mc-linux64( 0/ 8), 254.218: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 254.530:
pins2lts-mc-linux64( 0/ 8), 254.530: Explored 21048927 states 62092580 transitions, fanout: 2.950
pins2lts-mc-linux64( 0/ 8), 254.530: Total exploration time 254.410 sec (254.110 sec minimum, 254.235 sec on average)
pins2lts-mc-linux64( 0/ 8), 254.530: States per second: 82736, Transitions per second: 244065
pins2lts-mc-linux64( 0/ 8), 254.530:
pins2lts-mc-linux64( 0/ 8), 254.530: State space has 58486591 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 254.530: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 254.530: blue states: 21048927 (35.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 254.530: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 254.530: all-red states: 16056004 (27.45%), bogus 3 (0.00%)
pins2lts-mc-linux64( 0/ 8), 254.530:
pins2lts-mc-linux64( 0/ 8), 254.530: Total memory used for local state coloring: 75.3MB
pins2lts-mc-linux64( 0/ 8), 254.530:
pins2lts-mc-linux64( 0/ 8), 254.530: Queue width: 8B, total height: 4931855, memory: 37.63MB
pins2lts-mc-linux64( 0/ 8), 254.530: Tree memory: 702.2MB, 12.6 B/state, compr.: 1.9%
pins2lts-mc-linux64( 0/ 8), 254.530: Tree fill ratio (roots/leafs): 43.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 254.530: Stored 481 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 254.530: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 254.530: Est. total memory use: 739.8MB (~1061.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7646228378010135992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X(!(LTLAPp0==true)))) U ((LTLAPp1==true) U [](!(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7646228378010135992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X(!(LTLAPp0==true)))) U ((LTLAPp1==true) U [](!(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 07:13:16] [INFO ] Flatten gal took : 15 ms
[2025-06-01 07:13:16] [INFO ] Time to serialize gal into /tmp/LTLFireability16072110020012445435.gal : 4 ms
[2025-06-01 07:13:16] [INFO ] Time to serialize properties into /tmp/LTLFireability2105015968493373708.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/LTLFireability16072110020012445435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2105015968493373708.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 3 LTL properties
Checking formula 0 : !(((X(X(X(!("((s1>=1)&&(l182>=1))")))))U(("((s1>=1)&&(l230>=1))")U(G(!("((s1>=1)&&(l230>=1))"))))))
Formula 0 simplified : XXX"((s1>=1)&&(l182>=1))" R (!"((s1>=1)&&(l230>=1))" R F"((s1>=1)&&(l230>=1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b008"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b008, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007300076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;