About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T08
| 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 | ?FFFFFFFFFFTFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253800300.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 PolyORBLF-COL-S02J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253800300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748919003236
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-03 02:50:04] [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-03 02:50:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:50:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 02:50:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 02:50:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 720 ms
[2025-06-03 02:50:05] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-03 02:50:05] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2025-06-03 02:50:05] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 40000 steps (11 resets) in 1113 ms. (35 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40003 steps (12 resets) in 448 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (14 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (11 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
[2025-06-03 02:50:06] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 02:50:06] [INFO ] Computed 26 invariants in 9 ms
[2025-06-03 02:50:06] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/50 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 7 (OVERLAPS) 22/73 variables, 12/21 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:06] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:06] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:06] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:06] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 4/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/78 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/79 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/116 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 119 constraints, problems are : Problem set: 1 solved, 3 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 4/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/116 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 3/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/121 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 122 constraints, problems are : Problem set: 1 solved, 3 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1410ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 1510 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 30 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2025-06-03 02:50:09] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2025-06-03 02:50:09] [INFO ] Computed 25 invariants in 2 ms
[2025-06-03 02:50:09] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:09] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:09] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:09] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:09] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:09] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:09] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/92 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:10] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:10] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 4/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 104 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 8/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/96 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 42/146 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:12] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 2/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 148 constraints, problems are : Problem set: 2 solved, 42 unsolved in 2411 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4225ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 4226ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 41
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4271 ms. Remains : 59/81 places, 39/65 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
[2025-06-03 02:50:14] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2025-06-03 02:50:14] [INFO ] Flatten gal took : 28 ms
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 02:50:14] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 02:50:14] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 33 ms.
[2025-06-03 02:50:14] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 297 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Applied a total of 2 rules in 37 ms. Remains 688 /690 variables (removed 2) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2025-06-03 02:50:14] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 688 cols
[2025-06-03 02:50:14] [INFO ] Computed 52 invariants in 60 ms
[2025-06-03 02:50:14] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:30] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:33] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:33] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:33] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:33] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:33] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:33] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1978 variables, and 57 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/688 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:40] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:41] [INFO ] Deduced a trap composed of 175 places in 363 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:42] [INFO ] Deduced a trap composed of 298 places in 424 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:52] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:54] [INFO ] Deduced a trap composed of 327 places in 372 ms of which 125 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1978 variables, and 62 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/688 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41172ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 41179ms
[2025-06-03 02:50:55] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2025-06-03 02:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:50:56] [INFO ] Implicit Places using invariants in 602 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 610 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 680/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 12 ms. Remains 680 /680 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41847 ms. Remains : 680/690 places, 1306/1306 transitions.
Support contains 297 out of 680 places after structural reductions.
[2025-06-03 02:50:56] [INFO ] Flatten gal took : 102 ms
[2025-06-03 02:50:56] [INFO ] Flatten gal took : 91 ms
[2025-06-03 02:50:57] [INFO ] Input system was already deterministic with 1306 transitions.
Reduction of identical properties reduced properties to check from 27 to 22
RANDOM walk for 40000 steps (12 resets) in 484 ms. (82 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40001 steps (12 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
[2025-06-03 02:50:57] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 680 cols
[2025-06-03 02:50:57] [INFO ] Computed 44 invariants in 38 ms
[2025-06-03 02:50:57] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/552 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/586 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:57] [INFO ] Deduced a trap composed of 307 places in 299 ms of which 85 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 90/676 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:58] [INFO ] Deduced a trap composed of 74 places in 381 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:58] [INFO ] Deduced a trap composed of 74 places in 375 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:59] [INFO ] Deduced a trap composed of 74 places in 373 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:59] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:50:59] [INFO ] Deduced a trap composed of 74 places in 346 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:00] [INFO ] Deduced a trap composed of 74 places in 364 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:00] [INFO ] Deduced a trap composed of 344 places in 395 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:01] [INFO ] Deduced a trap composed of 328 places in 431 ms of which 154 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/678 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1290/1968 variables, 678/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1968 variables, 96/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1968/1970 variables, and 826 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 678/680 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/552 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/586 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 90/676 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/678 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1290/1968 variables, 678/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1968/1970 variables, and 826 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2567 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 678/680 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7645ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 680 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 304 place count 528 transition count 1154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 312 place count 520 transition count 1146
Iterating global reduction 2 with 8 rules applied. Total rules applied 320 place count 520 transition count 1146
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 448 place count 456 transition count 1082
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 464 place count 456 transition count 1066
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 480 place count 440 transition count 1066
Applied a total of 480 rules in 153 ms. Remains 440 /680 variables (removed 240) and now considering 1066/1306 (removed 240) transitions.
Running 1064 sub problems to find dead transitions.
[2025-06-03 02:51:05] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
// Phase 1: matrix 1050 rows 440 cols
[2025-06-03 02:51:05] [INFO ] Computed 44 invariants in 33 ms
[2025-06-03 02:51:05] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:14] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:14] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:14] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:14] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:14] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:14] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:14] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:15] [INFO ] Deduced a trap composed of 153 places in 288 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:15] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:17] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:17] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:19] [INFO ] Deduced a trap composed of 268 places in 247 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:25] [INFO ] Deduced a trap composed of 145 places in 250 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:25] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:26] [INFO ] Deduced a trap composed of 122 places in 217 ms of which 36 ms to minimize.
SMT process timed out in 20954ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 20957ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21114 ms. Remains : 440/680 places, 1066/1306 transitions.
RANDOM walk for 40000 steps (18 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 246081 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 246081 steps, saw 137176 distinct states, run finished after 3007 ms. (steps per millisecond=81 ) properties seen :0
[2025-06-03 02:51:29] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 02:51:29] [INFO ] Invariant cache hit.
[2025-06-03 02:51:29] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:29] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:29] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:29] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:30] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:30] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:30] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:30] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1490 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1490 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 587 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1974 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1050/1488 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1488 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1490 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1490 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1490 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1490 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 589 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1849 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3833ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 446 ms.
Support contains 16 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 23 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 440/440 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1066/1066 transitions.
Applied a total of 0 rules in 23 ms. Remains 440 /440 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2025-06-03 02:51:33] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 02:51:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:51:34] [INFO ] Implicit Places using invariants in 670 ms returned []
[2025-06-03 02:51:34] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 02:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:51:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:51:47] [INFO ] Implicit Places using invariants and state equation in 12747 ms returned []
Implicit Place search using SMT with State Equation took 13426 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:51:47] [INFO ] Redundant transitions in 58 ms returned []
Running 1064 sub problems to find dead transitions.
[2025-06-03 02:51:47] [INFO ] Flow matrix only has 1050 transitions (discarded 16 similar events)
[2025-06-03 02:51:47] [INFO ] Invariant cache hit.
[2025-06-03 02:51:47] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:56] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:56] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:56] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:56] [INFO ] Deduced a trap composed of 44 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-03 02:51:56] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:56] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:56] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:56] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:57] [INFO ] Deduced a trap composed of 153 places in 268 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:57] [INFO ] Deduced a trap composed of 160 places in 261 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:57] [INFO ] Deduced a trap composed of 145 places in 271 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:58] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:51:58] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:06] [INFO ] Deduced a trap composed of 122 places in 222 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:07] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:11] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:13] [INFO ] Deduced a trap composed of 268 places in 272 ms of which 68 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 9.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1064 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60831ms problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 60833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74355 ms. Remains : 440/440 places, 1066/1066 transitions.
Computed a total of 0 stabilizing places and 0 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' '!(F((p0&&G(F(p0)))))'
Support contains 8 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 680 transition count 1250
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 624 transition count 1250
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 624 transition count 1170
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 544 transition count 1170
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 480 transition count 1106
Applied a total of 400 rules in 58 ms. Remains 480 /680 variables (removed 200) and now considering 1106/1306 (removed 200) transitions.
Running 1104 sub problems to find dead transitions.
[2025-06-03 02:52:48] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 480 cols
[2025-06-03 02:52:48] [INFO ] Computed 44 invariants in 17 ms
[2025-06-03 02:52:48] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:58] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:59] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:59] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:59] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:59] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:59] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:59] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:59] [INFO ] Deduced a trap composed of 177 places in 258 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:52:59] [INFO ] Deduced a trap composed of 184 places in 262 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:00] [INFO ] Deduced a trap composed of 169 places in 253 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:00] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:01] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:03] [INFO ] Deduced a trap composed of 300 places in 243 ms of which 68 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 55 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:28] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:28] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 57 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40739ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 40741ms
[2025-06-03 02:53:29] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:53:29] [INFO ] Implicit Places using invariants in 755 ms returned []
[2025-06-03 02:53:29] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:53:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:53:35] [INFO ] Implicit Places using invariants and state equation in 5723 ms returned []
Implicit Place search using SMT with State Equation took 6480 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:53:35] [INFO ] Redundant transitions in 13 ms returned []
Running 1104 sub problems to find dead transitions.
[2025-06-03 02:53:35] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:53:35] [INFO ] Invariant cache hit.
[2025-06-03 02:53:35] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:46] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:46] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:46] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:46] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:46] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:46] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:46] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:47] [INFO ] Deduced a trap composed of 177 places in 286 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:47] [INFO ] Deduced a trap composed of 184 places in 296 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:50] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:51] [INFO ] Deduced a trap composed of 300 places in 284 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:59] [INFO ] Deduced a trap composed of 169 places in 235 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:53:59] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:54:00] [INFO ] Deduced a trap composed of 146 places in 240 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:54:00] [INFO ] Deduced a trap composed of 186 places in 249 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:54:01] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 58 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:54:29] [INFO ] Deduced a trap composed of 174 places in 246 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:54:31] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:54:31] [INFO ] Deduced a trap composed of 87 places in 252 ms of which 56 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 61 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60722ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 60725ms
Starting structural reductions in SI_LTL mode, iteration 1 : 480/680 places, 1106/1306 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108026 ms. Remains : 480/680 places, 1106/1306 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-00
Product exploration explored 100000 steps with 2130 reset in 427 ms.
Product exploration explored 100000 steps with 2135 reset in 369 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 215 steps (0 resets) in 5 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2025-06-03 02:54:37] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:54:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:54:38] [INFO ] [Real]Absence check using 15 positive place invariants in 113 ms returned sat
[2025-06-03 02:54:39] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 991 ms returned sat
[2025-06-03 02:54:52] [INFO ] [Real]Absence check using state equation in 12750 ms returned sat
[2025-06-03 02:54:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:54:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 23 ms returned sat
[2025-06-03 02:54:53] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 623 ms returned sat
[2025-06-03 02:54:56] [INFO ] [Nat]Absence check using state equation in 3477 ms returned sat
[2025-06-03 02:54:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:54:58] [INFO ] [Nat]Added 96 Read/Feed constraints in 1361 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:54:58] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:54:58] [INFO ] Deduced a trap composed of 49 places in 239 ms of which 45 ms to minimize.
[2025-06-03 02:54:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1267 ms
[2025-06-03 02:54:59] [INFO ] Computed and/alt/rep : 440/1549/432 causal constraints (skipped 656 transitions) in 78 ms.
[2025-06-03 02:55:02] [INFO ] Added : 10 causal constraints over 2 iterations in 3316 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 8 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 1106/1106 transitions.
Applied a total of 0 rules in 21 ms. Remains 480 /480 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Running 1104 sub problems to find dead transitions.
[2025-06-03 02:55:02] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:55:02] [INFO ] Invariant cache hit.
[2025-06-03 02:55:02] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:13] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:13] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:13] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:13] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:13] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:14] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:14] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:14] [INFO ] Deduced a trap composed of 177 places in 274 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:14] [INFO ] Deduced a trap composed of 184 places in 272 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:18] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:18] [INFO ] Deduced a trap composed of 300 places in 263 ms of which 83 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 53 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:55:39] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 54 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40788ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 40791ms
[2025-06-03 02:55:43] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:55:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:55:44] [INFO ] Implicit Places using invariants in 756 ms returned []
[2025-06-03 02:55:44] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:55:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:55:49] [INFO ] Implicit Places using invariants and state equation in 5707 ms returned []
Implicit Place search using SMT with State Equation took 6465 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:55:49] [INFO ] Redundant transitions in 55 ms returned []
Running 1104 sub problems to find dead transitions.
[2025-06-03 02:55:49] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:55:49] [INFO ] Invariant cache hit.
[2025-06-03 02:55:49] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:00] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:00] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:01] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:01] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:01] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:01] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:01] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:01] [INFO ] Deduced a trap composed of 177 places in 276 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:01] [INFO ] Deduced a trap composed of 184 places in 276 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:05] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:06] [INFO ] Deduced a trap composed of 300 places in 272 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:14] [INFO ] Deduced a trap composed of 169 places in 244 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:15] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:16] [INFO ] Deduced a trap composed of 146 places in 251 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:16] [INFO ] Deduced a trap composed of 186 places in 252 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:17] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 58 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:45] [INFO ] Deduced a trap composed of 174 places in 239 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:47] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:56:48] [INFO ] Deduced a trap composed of 87 places in 255 ms of which 56 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 61 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60718ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108066 ms. Remains : 480/480 places, 1106/1106 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 178 steps (0 resets) in 6 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2025-06-03 02:56:51] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:56:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:56:51] [INFO ] [Real]Absence check using 15 positive place invariants in 114 ms returned sat
[2025-06-03 02:56:52] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 984 ms returned sat
[2025-06-03 02:57:05] [INFO ] [Real]Absence check using state equation in 12644 ms returned sat
[2025-06-03 02:57:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:57:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 24 ms returned sat
[2025-06-03 02:57:06] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 618 ms returned sat
[2025-06-03 02:57:09] [INFO ] [Nat]Absence check using state equation in 3476 ms returned sat
[2025-06-03 02:57:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:57:11] [INFO ] [Nat]Added 96 Read/Feed constraints in 1358 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:11] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:12] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 43 ms to minimize.
[2025-06-03 02:57:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1209 ms
[2025-06-03 02:57:12] [INFO ] Computed and/alt/rep : 440/1549/432 causal constraints (skipped 656 transitions) in 71 ms.
[2025-06-03 02:57:15] [INFO ] Added : 10 causal constraints over 2 iterations in 2674 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2138 reset in 341 ms.
Product exploration explored 100000 steps with 2123 reset in 338 ms.
Built C files in :
/tmp/ltsmin354662977223539395
[2025-06-03 02:57:15] [INFO ] Computing symmetric may disable matrix : 1106 transitions.
[2025-06-03 02:57:15] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:57:15] [INFO ] Computing symmetric may enable matrix : 1106 transitions.
[2025-06-03 02:57:15] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:57:16] [INFO ] Computing Do-Not-Accords matrix : 1106 transitions.
[2025-06-03 02:57:16] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:57:16] [INFO ] Built C files in 301ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin354662977223539395
Running compilation step : cd /tmp/ltsmin354662977223539395;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin354662977223539395;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin354662977223539395;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 1106/1106 transitions.
Applied a total of 0 rules in 15 ms. Remains 480 /480 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Running 1104 sub problems to find dead transitions.
[2025-06-03 02:57:19] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:57:19] [INFO ] Invariant cache hit.
[2025-06-03 02:57:19] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:30] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:30] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:30] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:30] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:30] [INFO ] Deduced a trap composed of 49 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-03 02:57:30] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:30] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:30] [INFO ] Deduced a trap composed of 177 places in 266 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:31] [INFO ] Deduced a trap composed of 184 places in 265 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:35] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:35] [INFO ] Deduced a trap composed of 300 places in 260 ms of which 82 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 53 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:57:55] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 54 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40782ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 40784ms
[2025-06-03 02:58:00] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:58:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:58:00] [INFO ] Implicit Places using invariants in 773 ms returned []
[2025-06-03 02:58:00] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:58:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:58:01] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:58:06] [INFO ] Implicit Places using invariants and state equation in 5741 ms returned []
Implicit Place search using SMT with State Equation took 6525 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:58:06] [INFO ] Redundant transitions in 22 ms returned []
Running 1104 sub problems to find dead transitions.
[2025-06-03 02:58:06] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:58:06] [INFO ] Invariant cache hit.
[2025-06-03 02:58:06] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:17] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:17] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:17] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:17] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:17] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:17] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:17] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:18] [INFO ] Deduced a trap composed of 177 places in 271 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:18] [INFO ] Deduced a trap composed of 184 places in 268 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:22] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:22] [INFO ] Deduced a trap composed of 300 places in 256 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:31] [INFO ] Deduced a trap composed of 169 places in 244 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:31] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:32] [INFO ] Deduced a trap composed of 146 places in 248 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:33] [INFO ] Deduced a trap composed of 186 places in 250 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:58:33] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 58 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:59:02] [INFO ] Deduced a trap composed of 174 places in 246 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:59:04] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:59:04] [INFO ] Deduced a trap composed of 87 places in 262 ms of which 55 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 61 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60777ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 60779ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108140 ms. Remains : 480/480 places, 1106/1106 transitions.
Built C files in :
/tmp/ltsmin3286622101224355383
[2025-06-03 02:59:07] [INFO ] Computing symmetric may disable matrix : 1106 transitions.
[2025-06-03 02:59:07] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:59:07] [INFO ] Computing symmetric may enable matrix : 1106 transitions.
[2025-06-03 02:59:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:59:07] [INFO ] Computing Do-Not-Accords matrix : 1106 transitions.
[2025-06-03 02:59:07] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 02:59:07] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3286622101224355383
Running compilation step : cd /tmp/ltsmin3286622101224355383;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3286622101224355383;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3286622101224355383;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 02:59:10] [INFO ] Flatten gal took : 57 ms
[2025-06-03 02:59:10] [INFO ] Flatten gal took : 57 ms
[2025-06-03 02:59:10] [INFO ] Time to serialize gal into /tmp/LTL1145500184995974435.gal : 14 ms
[2025-06-03 02:59:10] [INFO ] Time to serialize properties into /tmp/LTL11753395024739339797.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/LTL1145500184995974435.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9188019501464161408.hoa' '-atoms' '/tmp/LTL11753395024739339797.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/LTL11753395024739339797.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9188019501464161408.hoa
Detected timeout of ITS tools.
[2025-06-03 02:59:26] [INFO ] Flatten gal took : 47 ms
[2025-06-03 02:59:26] [INFO ] Flatten gal took : 46 ms
[2025-06-03 02:59:26] [INFO ] Time to serialize gal into /tmp/LTL16723935733320616878.gal : 9 ms
[2025-06-03 02:59:26] [INFO ] Time to serialize properties into /tmp/LTL7675050442986334900.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/LTL16723935733320616878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7675050442986334900.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((((Perform_Work_E_0>=1)||(Perform_Work_E_1>=1))||((Perform_Work_E_2>=1)||(Perform_Work_E_3>=1)))||(((Perform_Work_E_4>=1)|...437
Formula 0 simplified : FG!"((((Perform_Work_E_0>=1)||(Perform_Work_E_1>=1))||((Perform_Work_E_2>=1)||(Perform_Work_E_3>=1)))||(((Perform_Work_E_4>=1)||(Per...224
Detected timeout of ITS tools.
[2025-06-03 02:59:41] [INFO ] Flatten gal took : 41 ms
[2025-06-03 02:59:41] [INFO ] Applying decomposition
[2025-06-03 02:59:41] [INFO ] Flatten gal took : 41 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/graph14323752707508504164.txt' '-o' '/tmp/graph14323752707508504164.bin' '-w' '/tmp/graph14323752707508504164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14323752707508504164.bin' '-l' '-1' '-v' '-w' '/tmp/graph14323752707508504164.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:59:41] [INFO ] Decomposing Gal with order
[2025-06-03 02:59:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:59:41] [INFO ] Removed a total of 938 redundant transitions.
[2025-06-03 02:59:41] [INFO ] Flatten gal took : 211 ms
[2025-06-03 02:59:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 535 labels/synchronizations in 42 ms.
[2025-06-03 02:59:41] [INFO ] Time to serialize gal into /tmp/LTL14448402092986307612.gal : 12 ms
[2025-06-03 02:59:41] [INFO ] Time to serialize properties into /tmp/LTL10322358847263822713.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/LTL14448402092986307612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10322358847263822713.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((((i10.u26.Perform_Work_E_0>=1)||(i10.u27.Perform_Work_E_1>=1))||((i10.u28.Perform_Work_E_2>=1)||(i10.u29.Perform_Work_E_3...565
Formula 0 simplified : FG!"((((i10.u26.Perform_Work_E_0>=1)||(i10.u27.Perform_Work_E_1>=1))||((i10.u28.Perform_Work_E_2>=1)||(i10.u29.Perform_Work_E_3>=1))...288
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-00 finished in 428636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X(X(p1)))||p0)) U (G(p2) U p3))))'
Support contains 33 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 672 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 664 transition count 1290
Applied a total of 32 rules in 32 ms. Remains 664 /680 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:59:56] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2025-06-03 02:59:57] [INFO ] Computed 44 invariants in 23 ms
[2025-06-03 02:59:57] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:15] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:15] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:15] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:17] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 44 ms to minimize.
SMT process timed out in 20990ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20992ms
[2025-06-03 03:00:17] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:00:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:00:18] [INFO ] Implicit Places using invariants in 713 ms returned []
[2025-06-03 03:00:18] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:00:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:00:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:00:28] [INFO ] Implicit Places using invariants and state equation in 10031 ms returned []
Implicit Place search using SMT with State Equation took 10746 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:00:28] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:00:28] [INFO ] Invariant cache hit.
[2025-06-03 03:00:28] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:46] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:49] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:49] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:49] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:49] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:49] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:50] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:50] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:50] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:55] [INFO ] Deduced a trap composed of 305 places in 361 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:55] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:00:59] [INFO ] Deduced a trap composed of 321 places in 348 ms of which 106 ms to minimize.
SMT process timed out in 30924ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 30928ms
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62709 ms. Remains : 664/680 places, 1290/1306 transitions.
Stuttering acceptance computed with spot in 611 ms :[(NOT p3), (NOT p3), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) p2 (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) p2 (NOT p1)), (NOT p2), (NOT p3)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-01 finished in 63368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (X(p2)||p1)))'
Support contains 90 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 672 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 664 transition count 1290
Applied a total of 32 rules in 21 ms. Remains 664 /680 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:01:00] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:01:00] [INFO ] Invariant cache hit.
[2025-06-03 03:01:00] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:18] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:20] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:20] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:20] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:21] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:21] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 42 ms to minimize.
SMT process timed out in 20895ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20897ms
[2025-06-03 03:01:21] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:01:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:01:22] [INFO ] Implicit Places using invariants in 787 ms returned []
[2025-06-03 03:01:22] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:01:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:01:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:01:32] [INFO ] Implicit Places using invariants and state equation in 10447 ms returned []
Implicit Place search using SMT with State Equation took 11236 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:01:32] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:01:32] [INFO ] Invariant cache hit.
[2025-06-03 03:01:32] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:50] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:52] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:53] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:53] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:53] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:53] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:53] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:53] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:53] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:58] [INFO ] Deduced a trap composed of 305 places in 351 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:01:59] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:03] [INFO ] Deduced a trap composed of 321 places in 359 ms of which 106 ms to minimize.
SMT process timed out in 30962ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 30965ms
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63137 ms. Remains : 664/680 places, 1290/1306 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, p0]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-02
Entered a terminal (fully accepting) state of product in 40475 steps with 9 reset in 193 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-02 finished in 63532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))&&(X(!p2) U (X(G(!p2))||(!p3&&X(!p2))))))'
Support contains 27 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 672 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 664 transition count 1290
Applied a total of 32 rules in 23 ms. Remains 664 /680 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:02:03] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:02:03] [INFO ] Invariant cache hit.
[2025-06-03 03:02:03] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:21] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:24] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:24] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:24] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:24] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 42 ms to minimize.
SMT process timed out in 20821ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20823ms
[2025-06-03 03:02:24] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:02:25] [INFO ] Implicit Places using invariants in 615 ms returned []
[2025-06-03 03:02:25] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:02:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:02:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:02:34] [INFO ] Implicit Places using invariants and state equation in 9498 ms returned []
Implicit Place search using SMT with State Equation took 10118 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:02:34] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:02:34] [INFO ] Invariant cache hit.
[2025-06-03 03:02:34] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:52] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:55] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:56] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:56] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:02:56] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:01] [INFO ] Deduced a trap composed of 305 places in 367 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:01] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:05] [INFO ] Deduced a trap composed of 321 places in 354 ms of which 106 ms to minimize.
SMT process timed out in 31010ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 31016ms
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61984 ms. Remains : 664/680 places, 1290/1306 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), p2, p2, true]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-03 finished in 62218 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((G(p1)||p0))))'
Support contains 26 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 680 transition count 1250
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 624 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 616 transition count 1242
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 128 place count 616 transition count 1170
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 272 place count 544 transition count 1170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 280 place count 536 transition count 1162
Iterating global reduction 3 with 8 rules applied. Total rules applied 288 place count 536 transition count 1162
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 368 place count 496 transition count 1122
Applied a total of 368 rules in 53 ms. Remains 496 /680 variables (removed 184) and now considering 1122/1306 (removed 184) transitions.
Running 1120 sub problems to find dead transitions.
[2025-06-03 03:03:06] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
// Phase 1: matrix 1106 rows 496 cols
[2025-06-03 03:03:06] [INFO ] Computed 44 invariants in 13 ms
[2025-06-03 03:03:06] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:18] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:18] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:18] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:18] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:18] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:18] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:19] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:21] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:24] [INFO ] Deduced a trap composed of 185 places in 270 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:03:25] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1602 variables, and 52 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1602 variables, and 52 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40826ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 40828ms
[2025-06-03 03:03:46] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:03:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:03:47] [INFO ] Implicit Places using invariants in 734 ms returned []
[2025-06-03 03:03:47] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:03:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:03:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:03:57] [INFO ] Implicit Places using invariants and state equation in 9410 ms returned []
Implicit Place search using SMT with State Equation took 10147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:03:57] [INFO ] Redundant transitions in 9 ms returned []
Running 1120 sub problems to find dead transitions.
[2025-06-03 03:03:57] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:03:57] [INFO ] Invariant cache hit.
[2025-06-03 03:03:57] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:08] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:08] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:08] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:08] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:08] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:09] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:09] [INFO ] Deduced a trap composed of 308 places in 286 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:11] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:11] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:16] [INFO ] Deduced a trap composed of 185 places in 266 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:16] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:04:22] [INFO ] Deduced a trap composed of 154 places in 232 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1602 variables, and 54 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1602 variables, and 54 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60729ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 60731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 496/680 places, 1122/1306 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111781 ms. Remains : 496/680 places, 1122/1306 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-05
Product exploration explored 100000 steps with 2429 reset in 475 ms.
Product exploration explored 100000 steps with 2401 reset in 425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 80 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 175 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 194 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-03 03:04:59] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:05:00] [INFO ] [Real]Absence check using 15 positive place invariants in 381 ms returned sat
[2025-06-03 03:05:01] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 1629 ms returned sat
[2025-06-03 03:05:03] [INFO ] [Real]Absence check using state equation in 1831 ms returned sat
[2025-06-03 03:05:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:05:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 104 ms returned sat
[2025-06-03 03:05:04] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 512 ms returned sat
[2025-06-03 03:05:09] [INFO ] [Nat]Absence check using state equation in 4960 ms returned sat
[2025-06-03 03:05:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:05:10] [INFO ] [Nat]Added 96 Read/Feed constraints in 522 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:10] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 27 ms to minimize.
[2025-06-03 03:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2025-06-03 03:05:10] [INFO ] Computed and/alt/rep : 472/1717/464 causal constraints (skipped 640 transitions) in 57 ms.
[2025-06-03 03:05:16] [INFO ] Added : 144 causal constraints over 29 iterations in 5305 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 26 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 1122/1122 transitions.
Applied a total of 0 rules in 19 ms. Remains 496 /496 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Running 1120 sub problems to find dead transitions.
[2025-06-03 03:05:16] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:05:16] [INFO ] Invariant cache hit.
[2025-06-03 03:05:16] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:27] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:27] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:27] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:27] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:27] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:27] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:28] [INFO ] Deduced a trap composed of 308 places in 274 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:29] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:30] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:35] [INFO ] Deduced a trap composed of 185 places in 272 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:05:35] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1602 variables, and 53 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1602 variables, and 53 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40835ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 40837ms
[2025-06-03 03:05:56] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:05:57] [INFO ] Implicit Places using invariants in 720 ms returned []
[2025-06-03 03:05:57] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:05:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:06:07] [INFO ] Implicit Places using invariants and state equation in 9537 ms returned []
Implicit Place search using SMT with State Equation took 10260 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:06:07] [INFO ] Redundant transitions in 15 ms returned []
Running 1120 sub problems to find dead transitions.
[2025-06-03 03:06:07] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:06:07] [INFO ] Invariant cache hit.
[2025-06-03 03:06:07] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:18] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:18] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:18] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:18] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:18] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:19] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:19] [INFO ] Deduced a trap composed of 308 places in 287 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:21] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:21] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:26] [INFO ] Deduced a trap composed of 185 places in 270 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:26] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:06:32] [INFO ] Deduced a trap composed of 154 places in 251 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1602 variables, and 54 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 9)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1602 variables, and 54 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60744ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 60746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111885 ms. Remains : 496/496 places, 1122/1122 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 144 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 221 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-03 03:07:08] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:07:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:07:09] [INFO ] [Real]Absence check using 15 positive place invariants in 386 ms returned sat
[2025-06-03 03:07:11] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 1634 ms returned sat
[2025-06-03 03:07:12] [INFO ] [Real]Absence check using state equation in 1838 ms returned sat
[2025-06-03 03:07:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:07:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 100 ms returned sat
[2025-06-03 03:07:14] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 499 ms returned sat
[2025-06-03 03:07:19] [INFO ] [Nat]Absence check using state equation in 4937 ms returned sat
[2025-06-03 03:07:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:07:19] [INFO ] [Nat]Added 96 Read/Feed constraints in 546 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:19] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 27 ms to minimize.
[2025-06-03 03:07:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2025-06-03 03:07:20] [INFO ] Computed and/alt/rep : 472/1717/464 causal constraints (skipped 640 transitions) in 51 ms.
[2025-06-03 03:07:25] [INFO ] Added : 144 causal constraints over 29 iterations in 5257 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2404 reset in 450 ms.
Product exploration explored 100000 steps with 2402 reset in 473 ms.
Built C files in :
/tmp/ltsmin11436980641386117311
[2025-06-03 03:07:26] [INFO ] Computing symmetric may disable matrix : 1122 transitions.
[2025-06-03 03:07:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:07:26] [INFO ] Computing symmetric may enable matrix : 1122 transitions.
[2025-06-03 03:07:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:07:26] [INFO ] Computing Do-Not-Accords matrix : 1122 transitions.
[2025-06-03 03:07:26] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:07:26] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11436980641386117311
Running compilation step : cd /tmp/ltsmin11436980641386117311;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11436980641386117311;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11436980641386117311;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 26 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 1122/1122 transitions.
Applied a total of 0 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Running 1120 sub problems to find dead transitions.
[2025-06-03 03:07:29] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:07:29] [INFO ] Invariant cache hit.
[2025-06-03 03:07:29] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:40] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:40] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:40] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:40] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:40] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:41] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:41] [INFO ] Deduced a trap composed of 308 places in 294 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:43] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:43] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:49] [INFO ] Deduced a trap composed of 185 places in 298 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:07:49] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1602 variables, and 53 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1602 variables, and 53 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40729ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 40730ms
[2025-06-03 03:08:10] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:08:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:08:11] [INFO ] Implicit Places using invariants in 767 ms returned []
[2025-06-03 03:08:11] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:08:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:08:11] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:08:20] [INFO ] Implicit Places using invariants and state equation in 9520 ms returned []
Implicit Place search using SMT with State Equation took 10289 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:08:20] [INFO ] Redundant transitions in 9 ms returned []
Running 1120 sub problems to find dead transitions.
[2025-06-03 03:08:20] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2025-06-03 03:08:20] [INFO ] Invariant cache hit.
[2025-06-03 03:08:20] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:31] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:31] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:32] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:32] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:32] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:32] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:32] [INFO ] Deduced a trap composed of 308 places in 289 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:34] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:34] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:40] [INFO ] Deduced a trap composed of 185 places in 293 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:40] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:08:46] [INFO ] Deduced a trap composed of 154 places in 263 ms of which 46 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1602 variables, and 54 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1602 variables, and 54 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60744ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 60746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111800 ms. Remains : 496/496 places, 1122/1122 transitions.
Built C files in :
/tmp/ltsmin9188499927192474241
[2025-06-03 03:09:21] [INFO ] Computing symmetric may disable matrix : 1122 transitions.
[2025-06-03 03:09:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:09:21] [INFO ] Computing symmetric may enable matrix : 1122 transitions.
[2025-06-03 03:09:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:09:21] [INFO ] Computing Do-Not-Accords matrix : 1122 transitions.
[2025-06-03 03:09:21] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:09:21] [INFO ] Built C files in 212ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9188499927192474241
Running compilation step : cd /tmp/ltsmin9188499927192474241;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9188499927192474241;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9188499927192474241;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 03:09:24] [INFO ] Flatten gal took : 38 ms
[2025-06-03 03:09:24] [INFO ] Flatten gal took : 37 ms
[2025-06-03 03:09:24] [INFO ] Time to serialize gal into /tmp/LTL8175290754441041077.gal : 7 ms
[2025-06-03 03:09:24] [INFO ] Time to serialize properties into /tmp/LTL17238656635537467288.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/LTL8175290754441041077.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15871916760107575410.hoa' '-atoms' '/tmp/LTL17238656635537467288.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/LTL17238656635537467288.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15871916760107575410.hoa
Detected timeout of ITS tools.
[2025-06-03 03:09:39] [INFO ] Flatten gal took : 34 ms
[2025-06-03 03:09:39] [INFO ] Flatten gal took : 34 ms
[2025-06-03 03:09:39] [INFO ] Time to serialize gal into /tmp/LTL6812833844985903589.gal : 5 ms
[2025-06-03 03:09:39] [INFO ] Time to serialize properties into /tmp/LTL18234961019440035941.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/LTL6812833844985903589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18234961019440035941.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(((((G("(((((Insert_Source_B_5>=1)||(Insert_Source_B_4>=1))||((Insert_Source_B_7>=1)||(Insert_Source_B_6>=1)))||(((Insert_Source...951
Formula 0 simplified : G(F!"(((((Insert_Source_B_5>=1)||(Insert_Source_B_4>=1))||((Insert_Source_B_7>=1)||(Insert_Source_B_6>=1)))||(((Insert_Source_B_1>=1...940
Detected timeout of ITS tools.
[2025-06-03 03:09:54] [INFO ] Flatten gal took : 44 ms
[2025-06-03 03:09:54] [INFO ] Applying decomposition
[2025-06-03 03:09:55] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16744895679590967.txt' '-o' '/tmp/graph16744895679590967.bin' '-w' '/tmp/graph16744895679590967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16744895679590967.bin' '-l' '-1' '-v' '-w' '/tmp/graph16744895679590967.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:09:55] [INFO ] Decomposing Gal with order
[2025-06-03 03:09:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:09:55] [INFO ] Removed a total of 911 redundant transitions.
[2025-06-03 03:09:55] [INFO ] Flatten gal took : 121 ms
[2025-06-03 03:09:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 531 labels/synchronizations in 27 ms.
[2025-06-03 03:09:55] [INFO ] Time to serialize gal into /tmp/LTL1479332870709042548.gal : 6 ms
[2025-06-03 03:09:55] [INFO ] Time to serialize properties into /tmp/LTL12373445688471565740.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/LTL1479332870709042548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12373445688471565740.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(((((G("(((((i4.u15.Insert_Source_B_5>=1)||(i4.u15.Insert_Source_B_4>=1))||((i4.u16.Insert_Source_B_7>=1)||(i4.u16.Insert_Source...1230
Formula 0 simplified : G(F!"(((((i4.u15.Insert_Source_B_5>=1)||(i4.u15.Insert_Source_B_4>=1))||((i4.u16.Insert_Source_B_7>=1)||(i4.u16.Insert_Source_B_6>=1...1219
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-05 finished in 424356 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((F((p0&&(F(p1) U !p2)))&&(X(p4)||p3)))))'
Support contains 42 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 672 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 664 transition count 1290
Applied a total of 32 rules in 29 ms. Remains 664 /680 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:10:10] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2025-06-03 03:10:10] [INFO ] Computed 44 invariants in 18 ms
[2025-06-03 03:10:10] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:28] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:28] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:28] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:10:31] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 43 ms to minimize.
SMT process timed out in 20794ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20796ms
[2025-06-03 03:10:31] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:10:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:10:32] [INFO ] Implicit Places using invariants in 874 ms returned []
[2025-06-03 03:10:32] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:10:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:10:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:10:42] [INFO ] Implicit Places using invariants and state equation in 10834 ms returned []
Implicit Place search using SMT with State Equation took 11714 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:10:42] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:10:42] [INFO ] Invariant cache hit.
[2025-06-03 03:10:42] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:01] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:03] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:03] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:04] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:04] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:04] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:04] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:04] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:04] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:09] [INFO ] Deduced a trap composed of 305 places in 366 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:10] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 30 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 9.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:16] [INFO ] Deduced a trap composed of 321 places in 484 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:17] [INFO ] Deduced a trap composed of 114 places in 297 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:17] [INFO ] Deduced a trap composed of 159 places in 331 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:18] [INFO ] Deduced a trap composed of 290 places in 341 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:18] [INFO ] Deduced a trap composed of 354 places in 360 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:19] [INFO ] Deduced a trap composed of 328 places in 441 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:11:35] [INFO ] Deduced a trap composed of 326 places in 342 ms of which 117 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60782ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60785ms
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93335 ms. Remains : 664/680 places, 1290/1306 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) p2 (AND (NOT p3) (NOT p4))), (OR (NOT p0) p2 (AND (NOT p3) (NOT p4))), (OR (NOT p0) p2 (AND (NOT p3) (NOT p4))), (OR (NOT p0) p2), (NOT p4), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p2, true]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-06
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-06 finished in 93722 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(F((X(F(p1))||p0)))))'
Support contains 16 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 672 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 664 transition count 1290
Applied a total of 32 rules in 31 ms. Remains 664 /680 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:11:44] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:11:44] [INFO ] Invariant cache hit.
[2025-06-03 03:11:44] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:02] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:04] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:05] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 42 ms to minimize.
SMT process timed out in 20863ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20865ms
[2025-06-03 03:12:05] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:12:05] [INFO ] Implicit Places using invariants in 763 ms returned []
[2025-06-03 03:12:05] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:12:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:12:15] [INFO ] Implicit Places using invariants and state equation in 9846 ms returned []
Implicit Place search using SMT with State Equation took 10614 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:12:15] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:12:15] [INFO ] Invariant cache hit.
[2025-06-03 03:12:15] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:34] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:36] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:36] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:36] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:37] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:37] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:37] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:37] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:37] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:42] [INFO ] Deduced a trap composed of 305 places in 363 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:42] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:49] [INFO ] Deduced a trap composed of 321 places in 489 ms of which 243 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:49] [INFO ] Deduced a trap composed of 114 places in 303 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:50] [INFO ] Deduced a trap composed of 159 places in 316 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:50] [INFO ] Deduced a trap composed of 290 places in 339 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:51] [INFO ] Deduced a trap composed of 354 places in 356 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:12:52] [INFO ] Deduced a trap composed of 328 places in 440 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:08] [INFO ] Deduced a trap composed of 326 places in 355 ms of which 119 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60739ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60741ms
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92255 ms. Remains : 664/680 places, 1290/1306 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-07
Stuttering criterion allowed to conclude after 36180 steps with 509 reset in 117 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-07 finished in 92550 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 57 out of 680 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 680 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 304 place count 528 transition count 1154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 312 place count 520 transition count 1146
Iterating global reduction 2 with 8 rules applied. Total rules applied 320 place count 520 transition count 1146
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 448 place count 456 transition count 1082
Applied a total of 448 rules in 47 ms. Remains 456 /680 variables (removed 224) and now considering 1082/1306 (removed 224) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:13:16] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2025-06-03 03:13:16] [INFO ] Computed 44 invariants in 13 ms
[2025-06-03 03:13:16] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:27] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:27] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:27] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:27] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:27] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:27] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:27] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:27] [INFO ] Deduced a trap composed of 161 places in 245 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:28] [INFO ] Deduced a trap composed of 168 places in 260 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:28] [INFO ] Deduced a trap composed of 153 places in 257 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:28] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:28] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:29] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:13:29] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 56 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 9)
(s171 0)
(s172 1)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 56 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40726ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 40728ms
[2025-06-03 03:13:57] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:13:58] [INFO ] Implicit Places using invariants in 628 ms returned []
[2025-06-03 03:13:58] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:13:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:13:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:14:04] [INFO ] Implicit Places using invariants and state equation in 6458 ms returned []
Implicit Place search using SMT with State Equation took 7089 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:14:04] [INFO ] Redundant transitions in 15 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-03 03:14:04] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 03:14:04] [INFO ] Invariant cache hit.
[2025-06-03 03:14:04] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:14] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:15] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:15] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:15] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:15] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:15] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:15] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:15] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:15] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:16] [INFO ] Deduced a trap composed of 168 places in 242 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:16] [INFO ] Deduced a trap composed of 153 places in 245 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:16] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:17] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:27] [INFO ] Deduced a trap composed of 122 places in 236 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:28] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:14:33] [INFO ] Deduced a trap composed of 284 places in 238 ms of which 60 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:05] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 64 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 59 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60752ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60754ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/680 places, 1082/1306 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108647 ms. Remains : 456/680 places, 1082/1306 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-08
Stuttering criterion allowed to conclude after 476 steps with 0 reset in 8 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-08 finished in 108714 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(p0)||p1) U p2)&&X(X(!p3))))))'
Support contains 40 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 672 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 664 transition count 1290
Applied a total of 32 rules in 27 ms. Remains 664 /680 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:15:05] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2025-06-03 03:15:05] [INFO ] Computed 44 invariants in 22 ms
[2025-06-03 03:15:05] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:23] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:23] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:23] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:25] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:26] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:26] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 48 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:30] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:30] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:31] [INFO ] Deduced a trap composed of 72 places in 286 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:31] [INFO ] Deduced a trap composed of 159 places in 316 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:15:40] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40802ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 40804ms
[2025-06-03 03:15:46] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:15:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:15:47] [INFO ] Implicit Places using invariants in 899 ms returned []
[2025-06-03 03:15:47] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:15:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:15:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:15:55] [INFO ] Implicit Places using invariants and state equation in 8338 ms returned []
Implicit Place search using SMT with State Equation took 9239 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:15:55] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:15:55] [INFO ] Invariant cache hit.
[2025-06-03 03:15:55] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:13] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:16] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:16] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:16] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:16] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:16] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:17] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:17] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:17] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:22] [INFO ] Deduced a trap composed of 305 places in 359 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:22] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:29] [INFO ] Deduced a trap composed of 321 places in 510 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:29] [INFO ] Deduced a trap composed of 114 places in 329 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:30] [INFO ] Deduced a trap composed of 159 places in 317 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:30] [INFO ] Deduced a trap composed of 290 places in 340 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:31] [INFO ] Deduced a trap composed of 354 places in 357 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:32] [INFO ] Deduced a trap composed of 328 places in 445 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:16:48] [INFO ] Deduced a trap composed of 326 places in 388 ms of which 120 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60819ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60821ms
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110902 ms. Remains : 664/680 places, 1290/1306 transitions.
Stuttering acceptance computed with spot in 675 ms :[(OR (NOT p0) (NOT p2) p3), (OR (NOT p0) (NOT p2) p3), (NOT p0), (NOT p2), p3, (AND (NOT p0) (NOT p2)), (AND (NOT p0) p3), p3, (AND (NOT p0) p3), (AND (NOT p2) p3), p3, (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) p3)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-10
Stuttering criterion allowed to conclude after 1982 steps with 7 reset in 9 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-10 finished in 111617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((p1&&F((p2&&F(G(p3)))))))||p0)))'
Support contains 25 out of 680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 680/680 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 672 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 664 transition count 1290
Applied a total of 32 rules in 27 ms. Remains 664 /680 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:16:57] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:16:57] [INFO ] Invariant cache hit.
[2025-06-03 03:16:57] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:14] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:16] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:17] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:17] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:17] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:17] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:17] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 29 ms to minimize.
SMT process timed out in 20889ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20891ms
[2025-06-03 03:17:17] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:17:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:17:18] [INFO ] Implicit Places using invariants in 925 ms returned []
[2025-06-03 03:17:18] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:17:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:17:30] [INFO ] Implicit Places using invariants and state equation in 11517 ms returned []
Implicit Place search using SMT with State Equation took 12443 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:17:30] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:17:30] [INFO ] Invariant cache hit.
[2025-06-03 03:17:30] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:49] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:51] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:51] [INFO ] Deduced a trap composed of 72 places in 236 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:51] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:51] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:52] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:52] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:52] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:52] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:57] [INFO ] Deduced a trap composed of 305 places in 356 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:17:57] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 31 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 9.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 6.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(timeout
s477 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:04] [INFO ] Deduced a trap composed of 321 places in 490 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:04] [INFO ] Deduced a trap composed of 114 places in 302 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:04] [INFO ] Deduced a trap composed of 159 places in 318 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:05] [INFO ] Deduced a trap composed of 290 places in 365 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:05] [INFO ] Deduced a trap composed of 354 places in 368 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:07] [INFO ] Deduced a trap composed of 328 places in 447 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:22] [INFO ] Deduced a trap composed of 326 places in 355 ms of which 119 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60768ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60771ms
Starting structural reductions in LTL mode, iteration 1 : 664/680 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94147 ms. Remains : 664/680 places, 1290/1306 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Product exploration explored 100000 steps with 1419 reset in 357 ms.
Product exploration explored 100000 steps with 1407 reset in 374 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p3))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 78 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 7
RANDOM walk for 40000 steps (11 resets) in 238 ms. (167 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 375 ms. (106 steps per ms) remains 1/1 properties
[2025-06-03 03:18:32] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:18:32] [INFO ] Invariant cache hit.
[2025-06-03 03:18:32] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 17/1938 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 0/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p3))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT p3)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 16 factoid took 297 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
[2025-06-03 03:18:33] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:18:33] [INFO ] [Real]Absence check using 15 positive place invariants in 101 ms returned sat
[2025-06-03 03:18:34] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 389 ms returned sat
[2025-06-03 03:18:37] [INFO ] [Real]Absence check using state equation in 2791 ms returned sat
[2025-06-03 03:18:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:18:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 311 ms returned sat
[2025-06-03 03:18:38] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 397 ms returned sat
[2025-06-03 03:18:43] [INFO ] [Nat]Absence check using state equation in 4798 ms returned sat
[2025-06-03 03:18:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:18:43] [INFO ] [Nat]Added 96 Read/Feed constraints in 383 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:43] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:18:43] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 3 ms to minimize.
[2025-06-03 03:18:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 609 ms
[2025-06-03 03:18:44] [INFO ] Computed and/alt/rep : 808/3133/800 causal constraints (skipped 472 transitions) in 87 ms.
[2025-06-03 03:18:52] [INFO ] Added : 265 causal constraints over 53 iterations in 7973 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 16 out of 664 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Applied a total of 0 rules in 14 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:18:52] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:18:52] [INFO ] Invariant cache hit.
[2025-06-03 03:18:52] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:11] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 43 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:15] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:15] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:15] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:15] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:15] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:15] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:16] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:16] [INFO ] Deduced a trap composed of 159 places in 299 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:28] [INFO ] Deduced a trap composed of 305 places in 422 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:28] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:19:29] [INFO ] Deduced a trap composed of 328 places in 404 ms of which 156 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 54 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40836ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 40839ms
[2025-06-03 03:19:32] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:19:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:19:33] [INFO ] Implicit Places using invariants in 942 ms returned []
[2025-06-03 03:19:33] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:19:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:19:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:19:45] [INFO ] Implicit Places using invariants and state equation in 11366 ms returned []
Implicit Place search using SMT with State Equation took 12313 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 03:19:45] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:19:45] [INFO ] Invariant cache hit.
[2025-06-03 03:19:45] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:03] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:05] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:05] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:05] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:06] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:06] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:06] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:06] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:06] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:11] [INFO ] Deduced a trap composed of 305 places in 359 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:11] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:15] [INFO ] Deduced a trap composed of 321 places in 351 ms of which 107 ms to minimize.
SMT process timed out in 30721ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 30725ms
Finished structural reductions in LTL mode , in 1 iterations and 83900 ms. Remains : 664/664 places, 1290/1290 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p3))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 269 steps (0 resets) in 9 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p3))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p3))), (F p1), (F (NOT p3)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 7 factoid took 290 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
[2025-06-03 03:20:16] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 03:20:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:20:17] [INFO ] [Real]Absence check using 15 positive place invariants in 101 ms returned sat
[2025-06-03 03:20:17] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 394 ms returned sat
[2025-06-03 03:20:20] [INFO ] [Real]Absence check using state equation in 2846 ms returned sat
[2025-06-03 03:20:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:20:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 311 ms returned sat
[2025-06-03 03:20:22] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 395 ms returned sat
[2025-06-03 03:20:26] [INFO ] [Nat]Absence check using state equation in 4820 ms returned sat
[2025-06-03 03:20:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 03:20:27] [INFO ] [Nat]Added 96 Read/Feed constraints in 379 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:27] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:27] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 3 ms to minimize.
[2025-06-03 03:20:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
[2025-06-03 03:20:27] [INFO ] Computed and/alt/rep : 808/3133/800 causal constraints (skipped 472 transitions) in 76 ms.
[2025-06-03 03:20:35] [INFO ] Added : 260 causal constraints over 52 iterations in 7968 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1396 reset in 352 ms.
Product exploration explored 100000 steps with 1424 reset in 366 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Support contains 16 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 664 transition count 1290
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 48 place count 664 transition count 1378
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 128 place count 664 transition count 1378
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 136 place count 656 transition count 1370
Deduced a syphon composed of 120 places in 3 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 144 place count 656 transition count 1370
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 192 place count 656 transition count 1370
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 216 place count 632 transition count 1346
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 240 place count 632 transition count 1346
Deduced a syphon composed of 152 places in 1 ms
Applied a total of 240 rules in 105 ms. Remains 632 /664 variables (removed 32) and now considering 1346/1290 (removed -56) transitions.
Running 1344 sub problems to find dead transitions.
[2025-06-03 03:20:37] [INFO ] Flow matrix only has 1330 transitions (discarded 16 similar events)
// Phase 1: matrix 1330 rows 632 cols
[2025-06-03 03:20:37] [INFO ] Computed 44 invariants in 17 ms
[2025-06-03 03:20:37] [INFO ] State equation strengthened by 128 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:54] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:54] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:55] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:55] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:55] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:55] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:55] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:20:55] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 2 ms to minimize.
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/1962 variables, and 50 constraints, problems are : Problem set: 16 solved, 1328 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/632 constraints, ReadFeed: 0/128 constraints, PredecessorRefiner: 1344/1344 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 1328 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 16/16 constraints. Problems are: Problem set: 16 solved, 1328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 23/39 constraints. Problems are: Problem set: 16 solved, 1328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 8/47 constraints. Problems are: Problem set: 16 solved, 1328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1962 variables, and 47 constraints, problems are : Problem set: 16 solved, 1328 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/632 constraints, ReadFeed: 0/128 constraints, PredecessorRefiner: 0/1344 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41050ms problems are : Problem set: 16 solved, 1328 unsolved
Search for dead transitions found 16 dead transitions in 41053ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 16 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:21:18] [INFO ] Redundant transitions in 17 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 632/664 places, 1330/1290 transitions.
Graph (complete) has 3434 edges and 632 vertex of which 616 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Discarding 16 places :
Also discarding 0 output transitions
Deduced a syphon composed of 136 places in 1 ms
Applied a total of 1 rules in 28 ms. Remains 616 /632 variables (removed 16) and now considering 1330/1330 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 616/664 places, 1330/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41220 ms. Remains : 616/664 places, 1330/1290 transitions.
Built C files in :
/tmp/ltsmin8230253081956302929
[2025-06-03 03:21:18] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8230253081956302929
Running compilation step : cd /tmp/ltsmin8230253081956302929;'/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 2363 ms.
Running link step : cd /tmp/ltsmin8230253081956302929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin8230253081956302929;'/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/stateBased4333245324173347222.hoa' '--buchi-type=spotba'
LTSmin run took 545 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 264317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(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((G(p1)||p0))))'
[2025-06-03 03:21:21] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8878336956456051115
[2025-06-03 03:21:21] [INFO ] Computing symmetric may disable matrix : 1306 transitions.
[2025-06-03 03:21:21] [INFO ] Applying decomposition
[2025-06-03 03:21:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:21:21] [INFO ] Computing symmetric may enable matrix : 1306 transitions.
[2025-06-03 03:21:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:21:21] [INFO ] Flatten gal took : 41 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/graph10914904564290399774.txt' '-o' '/tmp/graph10914904564290399774.bin' '-w' '/tmp/graph10914904564290399774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10914904564290399774.bin' '-l' '-1' '-v' '-w' '/tmp/graph10914904564290399774.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:21:21] [INFO ] Decomposing Gal with order
[2025-06-03 03:21:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:21:21] [INFO ] Removed a total of 1381 redundant transitions.
[2025-06-03 03:21:21] [INFO ] Flatten gal took : 91 ms
[2025-06-03 03:21:21] [INFO ] Computing Do-Not-Accords matrix : 1306 transitions.
[2025-06-03 03:21:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 18 ms.
[2025-06-03 03:21:21] [INFO ] Time to serialize gal into /tmp/LTLFireability13532342452891180153.gal : 10 ms
[2025-06-03 03:21:21] [INFO ] Time to serialize properties into /tmp/LTLFireability6855650313096106110.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/LTLFireability13532342452891180153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6855650313096106110.ltl' '-c' '-stutter-deadlock'
[2025-06-03 03:21:21] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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 2 LTL properties
[2025-06-03 03:21:21] [INFO ] Built C files in 357ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8878336956456051115
Running compilation step : cd /tmp/ltsmin8878336956456051115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Checking formula 0 : !((F(("((((i2.i3.u94.Perform_Work_E_0>=1)||(i13.u95.Perform_Work_E_1>=1))||((i9.u96.Perform_Work_E_2>=1)||(i12.u100.Perform_Work_E_3>=...579
Formula 0 simplified : FG!"((((i2.i3.u94.Perform_Work_E_0>=1)||(i13.u95.Perform_Work_E_1>=1))||((i9.u96.Perform_Work_E_2>=1)||(i12.u100.Perform_Work_E_3>=1...295
Compilation finished in 4643 ms.
Running link step : cd /tmp/ltsmin8878336956456051115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin8878336956456051115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8878336956456051115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8878336956456051115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 44535 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin8878336956456051115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T08"
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 PolyORBLF-COL-S02J06T08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253800300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 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 ;