About the Execution of ITS-Tools for JoinFreeModules-PT-0100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2986720.00 | 0.00 | 0.00 | FFFTFFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422700444.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 JoinFreeModules-PT-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422700444
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 304K 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 JoinFreeModules-PT-0100-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748842042252
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 05:27:23] [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-02 05:27:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:27:23] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-06-02 05:27:23] [INFO ] Transformed 501 places.
[2025-06-02 05:27:23] [INFO ] Transformed 801 transitions.
[2025-06-02 05:27:23] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Support contains 40 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 43 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
// Phase 1: matrix 801 rows 500 cols
[2025-06-02 05:27:24] [INFO ] Computed 100 invariants in 20 ms
[2025-06-02 05:27:24] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20265ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20287ms
[2025-06-02 05:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:27:44] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 05:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:27:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:27:44] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:27:44] [INFO ] Invariant cache hit.
[2025-06-02 05:27:44] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:36] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 3 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-02 05:28:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Finished structural reductions in LTL mode , in 1 iterations and 80952 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 40 out of 500 places after structural reductions.
[2025-06-02 05:28:45] [INFO ] Flatten gal took : 68 ms
[2025-06-02 05:28:45] [INFO ] Flatten gal took : 37 ms
[2025-06-02 05:28:45] [INFO ] Input system was already deterministic with 801 transitions.
RANDOM walk for 40100 steps (8 resets) in 754 ms. (53 steps per ms) remains 9/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
[2025-06-02 05:28:46] [INFO ] Invariant cache hit.
[2025-06-02 05:28:46] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/1301 variables, and 46 constraints, problems are : Problem set: 0 solved, 4 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 48/78 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/1301 variables, and 51 constraints, problems are : Problem set: 0 solved, 4 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 93 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=31 )
Parikh walk visited 4 properties in 8 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA JoinFreeModules-PT-0100-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((X((p0||X(p1))) U ((p2&&X((p0||X(p1))))||X(G((p0||X(p1))))))))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:28:47] [INFO ] Invariant cache hit.
[2025-06-02 05:28:47] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20093ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20094ms
[2025-06-02 05:29:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:29:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 05:29:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:29:07] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:29:08] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:29:08] [INFO ] Invariant cache hit.
[2025-06-02 05:29:08] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 92.0)
(s5 5.0)
(s6 2.0)
(s7 0.0)
(s8 4.0)
(s9 92.0)
(s10 5.0)
(s11 87.0)
(s12 0.0)
(s13 4.0)
(s14 7.0)
(s15 5.0)
(s16 2.0)
(s17 0.0)
(s18 4.0)
(s19 92.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 48.0)
(s24 48.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 86.0)
(s33 5.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s37 86.0)
(s38 5.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s52 86.0)
(s53 5.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 86.0)
(s58 5.0)
(s59 5.0)
(s60 5.0)
(s61 88.0)
(s62 0.0)
(s63 5.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 0.0)
(s73 4.0)
(s74 92.0)
(s75 5.0)
(s76 89.0)
(s77 0.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 87.0)
(s82 0.0)
(s83 4.0)
(s84 7.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 2.0)
(s92 0.0)
(s93 48.0)
(s94 48.0)
(s95 5.0)
(s96 2.0)
(s97 87.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 89.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 89.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s112 86.0)
(s113 5.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 87.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 0.0)
(s123 48.0)
(s124 48.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 89.0)
(s142 0.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 4.0)
(s149 92.0)
(s150 5.0)
(s151 2.0)
(s152 86.0)
(s153 5.0)
(s154 5.0)
(s155 5.0)
(s156 87.0)
(s157 0.0)
(s158 4.0)
(s159 7.0)
(s160 5.0)
(s161 2.0)
(s162 0.0)
(s163 4.0)
(s164 92.0)
(s165 5.0)
(s166 2.0)
(s167 0.0)
(s168 48.0)
(s169 48.0)
(s170 5.0)
(s171 89.0)
(s172 0.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 89.0)
(s177 0.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s182 0.0)
(s183 4.0)
(s184 92.0)
(s185 5.0)
(s186 89.0)
(s187 0.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 87.0)
(s192 0.0)
(s193 4.0)
(s194 7.0)
(s195 5.0)
(s196 2.0)
(s197 0.0)
(s198 4.0)
(s199 92.0)
(s200 5.0)
(s201 87.0)
(s202 0.0)
(s203 4.0)
(s204 7.0)
(s205 5.0)
(s206 2.0)
(s207 0.0)
(s208 4.0)
(s209 92.0)
(s210 5.0)
(s211 2.0)
(s212 0.0)
(s213 48.0)
(s214 48.0)
(s215 5.0)
(s216 2.0)
(s217 87.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 89.0)
(s222 0.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 89.0)
(s227 0.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 89.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s237 86.0)
(s238 5.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s242 87.0)
(s243 4.0)
(s244 5.0)
(s245 0.0)
(s246 98.0)
(s247 0.0)
(s248 4.0)
(s249 1.0)
(s250 5.0)
(s251 2.0)
(s252 0.0)
(s253 4.0)
(s254 92.0)
(s255 5.0)
(s256 2.0)
(s257 0.0)
(s258 4.0)
(s259 92.0)
(s260 5.0)
(s261 2.0)
(s262 87.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s267 86.0)
(s268 5.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 86.0)
(s273 5.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 0.0)
(s278 4.0)
(s279 92.0)
(s280 5.0)
(s281 89.0)
(s282 0.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s287 87.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 89.0)
(s292 0.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s297 0.0)
(s298 48.0)
(s299 48.0)
(s300 5.0)
(s301 89.0)
(s302 0.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s307 0.0)
(s308 4.0)
(s309 timeout
92.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 3 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-02 05:30:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:30:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:30:04] [INFO ] Deduced a trap composed of 3 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-02 05:30:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in LTL mode , in 1 iterations and 80599 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-00
Product exploration explored 100000 steps with 24884 reset in 1658 ms.
Product exploration explored 100000 steps with 25014 reset in 1657 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 p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
RANDOM walk for 40213 steps (8 resets) in 263 ms. (152 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
[2025-06-02 05:30:12] [INFO ] Invariant cache hit.
[2025-06-02 05:30:12] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/26 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/1301 variables, and 15 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 2/100 constraints, State Equation: 10/500 constraints, ReadFeed: 2/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/26 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/1301 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/100 constraints, State Equation: 10/500 constraints, ReadFeed: 2/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR p2 p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 366 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:30:13] [INFO ] Invariant cache hit.
[2025-06-02 05:30:13] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20078ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20079ms
[2025-06-02 05:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:30:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 05:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:30:34] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:30:34] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:30:34] [INFO ] Invariant cache hit.
[2025-06-02 05:30:34] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in LTL mode , in 1 iterations and 80592 ms. Remains : 500/500 places, 801/801 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 p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 103 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
RANDOM walk for 40192 steps (8 resets) in 279 ms. (143 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
[2025-06-02 05:31:34] [INFO ] Invariant cache hit.
[2025-06-02 05:31:34] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/26 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/1301 variables, and 15 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 2/100 constraints, State Equation: 10/500 constraints, ReadFeed: 2/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/26 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/1301 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/100 constraints, State Equation: 10/500 constraints, ReadFeed: 2/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR p2 p0))), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 349 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 25052 reset in 1511 ms.
Product exploration explored 100000 steps with 25149 reset in 1654 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 71 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:31:39] [INFO ] Invariant cache hit.
[2025-06-02 05:31:39] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20076ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20078ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:31:59] [INFO ] Redundant transitions in 46 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 05:31:59] [INFO ] Invariant cache hit.
[2025-06-02 05:31:59] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 3 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-02 05:32:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80344 ms. Remains : 500/500 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin15235680657864283281
[2025-06-02 05:33:00] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15235680657864283281
Running compilation step : cd /tmp/ltsmin15235680657864283281;'/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 1354 ms.
Running link step : cd /tmp/ltsmin15235680657864283281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15235680657864283281;'/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/stateBased8478618551518720305.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:33:15] [INFO ] Invariant cache hit.
[2025-06-02 05:33:15] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 92.0)
(s5 5.0)
(s6 2.0)
(s7 0.0)
(s8 4.0)
(s9 92.0)
(s10 5.0)
(s11 87.0)
(s12 0.0)
(s13 4.0)
(s14 7.0)
(s15 5.0)
(s16 2.0)
(s17 0.0)
(s18 4.0)
(s19 92.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 91.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 87.0)
(s33 4.0)
(s34 5.0)
(s35 92.0)
(s36 2.0)
(s37 0.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s52 87.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 91.0)
(s59 5.0)
(s60 5.0)
(s61 89.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 0.0)
(s73 4.0)
(s74 92.0)
(s75 92.0)
(s76 2.0)
(s77 0.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 87.0)
(s82 0.0)
(s83 4.0)
(s84 7.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 2.0)
(s92 0.0)
(s93 91.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s97 87.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 89.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 89.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 92.0)
(s111 2.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 0.0)
(s118 91.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 0.0)
(s123 91.0)
(s124 5.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 92.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 4.0)
(s149 92.0)
(s150 5.0)
(s151 2.0)
(s152 87.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 87.0)
(s157 0.0)
(s158 4.0)
(s159 7.0)
(s160 5.0)
(s161 2.0)
(s162 0.0)
(s163 4.0)
(s164 92.0)
(s165 5.0)
(s166 2.0)
(s167 0.0)
(s168 91.0)
(s169 5.0)
(s170 92.0)
(s171 2.0)
(s172 0.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s177 0.0)
(s178 91.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s182 0.0)
(s183 4.0)
(s184 92.0)
(s185 5.0)
(s186 89.0)
(s187 0.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 87.0)
(s192 0.0)
(s193 4.0)
(s194 7.0)
(s195 5.0)
(s196 2.0)
(s197 0.0)
(s198 4.0)
(s199 92.0)
(s200 5.0)
(s201 87.0)
(s202 0.0)
(s203 4.0)
(s204 7.0)
(s205 5.0)
(s206 2.0)
(s207 0.0)
(s208 4.0)
(s209 92.0)
(s210 5.0)
(s211 2.0)
(s212 0.0)
(s213 91.0)
(s214 5.0)
(s215 92.0)
(s216 2.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 89.0)
(s222 0.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 89.0)
(s227 0.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 89.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s237 87.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s242 87.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s247 0.0)
(s248 91.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s252 0.0)
(s253 4.0)
(s254 92.0)
(s255 5.0)
(s256 2.0)
(s257 0.0)
(s258 4.0)
(s259 92.0)
(s260 5.0)
(s261 2.0)
(s262 87.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s267 87.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 0.0)
(s273 91.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 0.0)
(s278 4.0)
(s279 92.0)
(s280 5.0)
(s281 89.0)
(s282 0.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s287 87.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 89.0)
(s292 0.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s297 0.0)
(s298 91.0)
(s299 5.0)
(s300 92.0)
(s301 2.0)
(s302 0.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s307 0.0)
(s308 4.0)
(s309 92.0)
(s310 5.0)
(s311 89.0)
(s312 0.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s317 87.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 89.0)
(s322 0.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s327 0.0)
(s328 timeout
4.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20086ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20086ms
[2025-06-02 05:33:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:33:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 05:33:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:33:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:33:35] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:33:35] [INFO ] Invariant cache hit.
[2025-06-02 05:33:35] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LTL mode , in 1 iterations and 80591 ms. Remains : 500/500 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin12331984694501152807
[2025-06-02 05:34:35] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12331984694501152807
Running compilation step : cd /tmp/ltsmin12331984694501152807;'/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 1083 ms.
Running link step : cd /tmp/ltsmin12331984694501152807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12331984694501152807;'/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/stateBased9340590077363744171.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 05:34:51] [INFO ] Flatten gal took : 30 ms
[2025-06-02 05:34:51] [INFO ] Flatten gal took : 26 ms
[2025-06-02 05:34:51] [INFO ] Time to serialize gal into /tmp/LTL14903046916397595966.gal : 7 ms
[2025-06-02 05:34:51] [INFO ] Time to serialize properties into /tmp/LTL11603656588225983283.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/LTL14903046916397595966.gal' '-t' 'CGAL' '-hoa' '/tmp/aut125539273985247172.hoa' '-atoms' '/tmp/LTL11603656588225983283.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/LTL11603656588225983283.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut125539273985247172.hoa
Detected timeout of ITS tools.
[2025-06-02 05:35:06] [INFO ] Flatten gal took : 35 ms
[2025-06-02 05:35:06] [INFO ] Flatten gal took : 34 ms
[2025-06-02 05:35:06] [INFO ] Time to serialize gal into /tmp/LTL10570959696708136568.gal : 5 ms
[2025-06-02 05:35:06] [INFO ] Time to serialize properties into /tmp/LTL16536722050028502606.ltl : 15 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/LTL10570959696708136568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16536722050028502606.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(("(p41<5)")||(X("((p111>=3)&&(p201>=3))"))))U((X(G(("(p41<5)")||(X("((p111>=3)&&(p201>=3))")))))||(("(p243<1)")&&(X(("(p41<5)"...194
Formula 0 simplified : X(X(!"(p41<5)" & X!"((p111>=3)&&(p201>=3))") R (XF(!"(p41<5)" & X!"((p111>=3)&&(p201>=3))") & (!"(p243<1)" | X(!"(p41<5)" & X!"((p11...177
Detected timeout of ITS tools.
[2025-06-02 05:35:21] [INFO ] Flatten gal took : 22 ms
[2025-06-02 05:35:21] [INFO ] Applying decomposition
[2025-06-02 05:35:21] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12036411169904411715.txt' '-o' '/tmp/graph12036411169904411715.bin' '-w' '/tmp/graph12036411169904411715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12036411169904411715.bin' '-l' '-1' '-v' '-w' '/tmp/graph12036411169904411715.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:35:21] [INFO ] Decomposing Gal with order
[2025-06-02 05:35:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:35:21] [INFO ] Flatten gal took : 59 ms
[2025-06-02 05:35:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-02 05:35:21] [INFO ] Time to serialize gal into /tmp/LTL10553848516397669777.gal : 5 ms
[2025-06-02 05:35:21] [INFO ] Time to serialize properties into /tmp/LTL14035919213228240817.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/LTL10553848516397669777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14035919213228240817.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((X(("(u8.p41<5)")||(X("((u22.p111>=3)&&(u40.p201>=3))"))))U((X(G(("(u8.p41<5)")||(X("((u22.p111>=3)&&(u40.p201>=3))")))))||(("(u4...231
Formula 0 simplified : X(X(!"(u8.p41<5)" & X!"((u22.p111>=3)&&(u40.p201>=3))") R (XF(!"(u8.p41<5)" & X!"((u22.p111>=3)&&(u40.p201>=3))") & (!"(u48.p243<1)"...214
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u0.t8, u1.t9, u1.t10, u1.t11, u1.t12, u1.t16, u2.t17, u2.t18, u2....5044
Detected timeout of ITS tools.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-00 finished in 409191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 28 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:35:36] [INFO ] Invariant cache hit.
[2025-06-02 05:35:36] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20100ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20101ms
[2025-06-02 05:35:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:56] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 05:35:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:57] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:35:57] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:35:57] [INFO ] Redundant transitions in 8 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 05:35:57] [INFO ] Invariant cache hit.
[2025-06-02 05:35:57] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 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 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:48] [INFO ] Deduced a trap composed of 3 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-02 05:36:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80646 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-01 finished in 80703 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(p1)))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:36:57] [INFO ] Invariant cache hit.
[2025-06-02 05:36:57] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20068ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20068ms
[2025-06-02 05:37:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:17] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 05:37:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:37:17] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:37:17] [INFO ] Redundant transitions in 5 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 05:37:17] [INFO ] Invariant cache hit.
[2025-06-02 05:37:17] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80580 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-02 finished in 80658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0 U p1))||G(p2)))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:38:18] [INFO ] Invariant cache hit.
[2025-06-02 05:38:18] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20078ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20079ms
[2025-06-02 05:38:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:38:38] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 05:38:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:38:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:38:38] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:38:38] [INFO ] Invariant cache hit.
[2025-06-02 05:38:38] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:30] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Finished structural reductions in LTL mode , in 1 iterations and 80568 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 1467 ms.
Product exploration explored 100000 steps with 25000 reset in 1630 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 p1 p0 (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40167 steps (8 resets) in 350 ms. (114 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
[2025-06-02 05:39:42] [INFO ] Invariant cache hit.
[2025-06-02 05:39:42] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/1301 variables, and 22 constraints, problems are : Problem set: 0 solved, 2 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/39 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/1301 variables, and 25 constraints, problems are : Problem set: 0 solved, 2 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 219ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 4391 steps, including 15 resets, run visited all 2 properties in 52 ms. (steps per millisecond=84 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 53 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1 (NOT p2)))), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 373 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:39:43] [INFO ] Invariant cache hit.
[2025-06-02 05:39:43] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20097ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20098ms
[2025-06-02 05:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:40:04] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 05:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:40:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:40:04] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:40:04] [INFO ] Invariant cache hit.
[2025-06-02 05:40:04] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:55] [INFO ] Deduced a trap composed of 3 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-02 05:40:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Finished structural reductions in LTL mode , in 1 iterations and 80615 ms. Remains : 500/500 places, 801/801 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 p0 p1 (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40127 steps (8 resets) in 299 ms. (133 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
[2025-06-02 05:41:05] [INFO ] Invariant cache hit.
[2025-06-02 05:41:05] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 24/39 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/1301 variables, and 21 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/1301 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 362 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1 (NOT p2)))), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 346 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 1446 ms.
Product exploration explored 100000 steps with 25000 reset in 1555 ms.
Applying partial POR strategy [true, true, false, true, true, false, false]
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:41:09] [INFO ] Invariant cache hit.
[2025-06-02 05:41:09] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20066ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20067ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:41:30] [INFO ] Redundant transitions in 8 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 05:41:30] [INFO ] Invariant cache hit.
[2025-06-02 05:41:30] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 92.0)
(s5 5.0)
(s6 2.0)
(s7 0.0)
(s8 4.0)
(s9 92.0)
(s10 5.0)
(s11 87.0)
(s12 0.0)
(s13 4.0)
(s14 7.0)
(s15 5.0)
(s16 2.0)
(s17 0.0)
(s18 4.0)
(s19 92.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 48.0)
(s24 48.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 86.0)
(s33 5.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s37 86.0)
(s38 5.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s52 86.0)
(s53 5.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 86.0)
(s58 5.0)
(s59 5.0)
(s60 5.0)
(s61 88.0)
(s62 0.0)
(s63 5.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 0.0)
(s73 4.0)
(s74 92.0)
(s75 5.0)
(s76 89.0)
(s77 0.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 87.0)
(s82 0.0)
(s83 4.0)
(s84 7.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 2.0)
(s92 0.0)
(s93 48.0)
(s94 48.0)
(s95 5.0)
(s96 2.0)
(s97 87.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 89.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 89.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s112 86.0)
(s113 5.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 87.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 0.0)
(s123 48.0)
(s124 48.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 89.0)
(s142 0.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 4.0)
(s149 92.0)
(s150 5.0)
(s151 2.0)
(s152 86.0)
(s153 5.0)
(s154 5.0)
(s155 5.0)
(s156 87.0)
(s157 0.0)
(s158 4.0)
(s159 7.0)
(s160 5.0)
(s161 2.0)
(s162 0.0)
(s163 4.0)
(s164 92.0)
(s165 5.0)
(s166 2.0)
(s167 0.0)
(s168 48.0)
(s169 48.0)
(s170 5.0)
(s171 89.0)
(s172 0.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 89.0)
(s177 0.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s182 0.0)
(s183 4.0)
(s184 92.0)
(s185 5.0)
(s186 89.0)
(s187 0.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 87.0)
(s192 0.0)
(s193 4.0)
(s194 7.0)
(s195 5.0)
(s196 2.0)
(s197 0.0)
(s198 4.0)
(s199 92.0)
(s200 5.0)
(s201 87.0)
(s202 0.0)
(s203 4.0)
(s204 7.0)
(s205 5.0)
(s206 2.0)
(s207 0.0)
(s208 4.0)
(s209 92.0)
(s210 5.0)
(s211 2.0)
(s212 0.0)
(s213 48.0)
(s214 48.0)
(s215 5.0)
(s216 2.0)
(s217 87.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 89.0)
(s222 0.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 89.0)
(s227 0.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 89.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s237 86.0)
(s238 5.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s242 87.0)
(s243 4.0)
(s244 5.0)
(s245 0.0)
(s246 98.0)
(s247 0.0)
(s248 4.0)
(s249 1.0)
(s250 5.0)
(s251 2.0)
(s252 0.0)
(s253 4.0)
(s254 92.0)
(s255 5.0)
(s256 2.0)
(s257 0.0)
(s258 4.0)
(s259 92.0)
(s260 5.0)
(s261 2.0)
(s262 87.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s267 86.0)
(s268 5.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 86.0)
(s273 5.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 0.0)
(s278 4.0)
(s279 92.0)
(s280 5.0)
(s281 89.0)
(s282 0.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s287 87.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 89.0)
(s292 0.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s297 0.0)
(s298 48.0)
(s299 48.0)
(s300 5.0)
(s301 89.0)
(s302 0.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s307 0.0)
(s308 4.0)
(s309 92.0)
(s310 5.0)
(s311 89.0)
(s312 0.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s317 87.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 89.0)
(s322 0.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s327 0.0)
(s328 4.0)
(s329 92.0)
(s330 5.0)
(s331 87.0)
(s332 0.0)
(s333 4.0)
(s334 7.0)
(s335 5.0)
(s336 2.0)
(s337 87.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s342 0.0)
(s343 4.0)
(s344 92.0)
(s345 5.0)
(s346 2.0)
(s347 87.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 89.0)
(s352 0.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s357 0.0)
(s358 48.0)
(s359 48.0)
(s360 5.0)
(s361 2.0)
(s362 0.0)
(s363 48.0)
(s364 48.0)
(s365 5.0)
(s366 2.0)
(s367 86.0)
(s368 5.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s372 0.0)
(s373 48.0)
(s374 48.0)
(s375 5.0)
(s376 2.0)
(s377 0.0)
(s378 48.0)
(s379 48.0)
(s380 5.0)
(s381 2.0)
(s382 86.0)
(s383 5.0)
(s384 5.0)
(s385 5.0)
(s386 88.0)
(s387 0.0)
(s388 5.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s392 0.0)
(s393 48.0)
(s394 48.0)
(s395 5.0)
(s396 2.0)
(s397 0.0)
(s398 4.0)
(s399 92.0)
(s400 5.0)
(s401 2.0)
(s402 0.0)
(s403 48.0)
(s404 48.0)
(s405 5.0)
(s406 2.0)
(s407 86.0)
(s408 5.0)
(s409 5.0)
(s410 5.0)
(s411 2.0)
(s412 86.0)
(s413 5.0)
(s414 5.0)
(s415 5.0)
(s416 2.0)
(s417 87.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s421 88.0)
(s422 0.0)
(s423 5.0)
(s424 5.0)
(s425 5.0)
(s426 2.0)
(s427 87.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s431 89.0)
(s432 0.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s437 86.0)
(s438 5.0)
(s439 5.0)
(s440 5.0)
(s441 89.0)
(s442 0.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s447 0.0)
(s448 4.0)
(s449 92.0)
(s450 5.0)
(s451 2.0)
(s452 0.0)
(s453 4.0)
(s454 92.0)
(s455 5.0)
(s456 2.0)
(s457 0.0)
(s458 4.0)
(s459 92.0)
(s460 5.0)
(s461 89.0)
(s462 0.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s467 0.0)
(s468 4.0)
(s469 92.0)
(s470 5.0)
(s471 88.0)
(s472 0.0)
(s473 5.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s477 0.0)
(s478 48.0)
(s479 48.0)
(s480 5.0)
(s481 2.0)
(s482 86.0)
(s483 5.0)
(s484 5.0)
(s485 5.0)
(s486 2.0)
(s487 timeout
86.0)
(s488 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:21] [INFO ] Deduced a trap composed of 3 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-02 05:42:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80205 ms. Remains : 500/500 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin12972219457833151495
[2025-06-02 05:42:30] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12972219457833151495
Running compilation step : cd /tmp/ltsmin12972219457833151495;'/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 1093 ms.
Running link step : cd /tmp/ltsmin12972219457833151495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12972219457833151495;'/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/stateBased33518056991544570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:42:45] [INFO ] Invariant cache hit.
[2025-06-02 05:42:45] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20066ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20066ms
[2025-06-02 05:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:05] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 05:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:43:05] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:43:05] [INFO ] Invariant cache hit.
[2025-06-02 05:43:05] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:56] [INFO ] Deduced a trap composed of 3 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-02 05:43:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in LTL mode , in 1 iterations and 80570 ms. Remains : 500/500 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin3634419953014009045
[2025-06-02 05:44:05] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3634419953014009045
Running compilation step : cd /tmp/ltsmin3634419953014009045;'/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 1093 ms.
Running link step : cd /tmp/ltsmin3634419953014009045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3634419953014009045;'/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/stateBased401265891715193931.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 05:44:21] [INFO ] Flatten gal took : 25 ms
[2025-06-02 05:44:21] [INFO ] Flatten gal took : 17 ms
[2025-06-02 05:44:21] [INFO ] Time to serialize gal into /tmp/LTL9353537555210423665.gal : 3 ms
[2025-06-02 05:44:21] [INFO ] Time to serialize properties into /tmp/LTL16947819784610720516.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/LTL9353537555210423665.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11575055286245629295.hoa' '-atoms' '/tmp/LTL16947819784610720516.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/LTL16947819784610720516.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11575055286245629295.hoa
Detected timeout of ITS tools.
[2025-06-02 05:44:36] [INFO ] Flatten gal took : 18 ms
[2025-06-02 05:44:36] [INFO ] Flatten gal took : 16 ms
[2025-06-02 05:44:36] [INFO ] Time to serialize gal into /tmp/LTL655988754046394553.gal : 6 ms
[2025-06-02 05:44:36] [INFO ] Time to serialize properties into /tmp/LTL3622011457769490915.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/LTL655988754046394553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3622011457769490915.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...274
Read 1 LTL properties
Checking formula 0 : !((X(X((X(("(p53>=1)")U("(p138>=1)")))||(G("(p406>=3)"))))))
Formula 0 simplified : XX(X(!"(p53>=1)" R !"(p138>=1)") & F!"(p406>=3)")
Detected timeout of ITS tools.
[2025-06-02 05:44:51] [INFO ] Flatten gal took : 18 ms
[2025-06-02 05:44:51] [INFO ] Applying decomposition
[2025-06-02 05:44:51] [INFO ] Flatten gal took : 15 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/graph5784443406779018228.txt' '-o' '/tmp/graph5784443406779018228.bin' '-w' '/tmp/graph5784443406779018228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5784443406779018228.bin' '-l' '-1' '-v' '-w' '/tmp/graph5784443406779018228.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:44:51] [INFO ] Decomposing Gal with order
[2025-06-02 05:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:44:51] [INFO ] Flatten gal took : 18 ms
[2025-06-02 05:44:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-02 05:44:51] [INFO ] Time to serialize gal into /tmp/LTL3238464344399641985.gal : 3 ms
[2025-06-02 05:44:51] [INFO ] Time to serialize properties into /tmp/LTL17831906489656828281.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/LTL3238464344399641985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17831906489656828281.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((X(("(u10.p53>=1)")U("(u27.p138>=1)")))||(G("(u81.p406>=3)"))))))
Formula 0 simplified : XX(X(!"(u10.p53>=1)" R !"(u27.p138>=1)") & F!"(u81.p406>=3)")
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u0.t8, u1.t9, u1.t10, u1.t11, u1.t12, u1.t16, u2.t17, u2.t18, u2....5044
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
236 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.41324,52116,1,0,100001,114133,3508,43207,1069,138032,90033
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0100-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property JoinFreeModules-PT-0100-LTLFireability-03 finished in 395855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p1)||p0)))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:44:53] [INFO ] Invariant cache hit.
[2025-06-02 05:44:53] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20075ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20076ms
[2025-06-02 05:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:45:14] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 05:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:45:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:45:14] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:45:14] [INFO ] Invariant cache hit.
[2025-06-02 05:45:14] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:46:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:46:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:46:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:46:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:46:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:46:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:46:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Finished structural reductions in LTL mode , in 1 iterations and 80566 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-04 finished in 80755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:46:14] [INFO ] Invariant cache hit.
[2025-06-02 05:46:14] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20073ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20074ms
[2025-06-02 05:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:46:34] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 05:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:46:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:46:35] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:46:35] [INFO ] Redundant transitions in 6 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 05:46:35] [INFO ] Invariant cache hit.
[2025-06-02 05:46:35] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:26] [INFO ] Deduced a trap composed of 3 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-02 05:47:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80613 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-05
Product exploration explored 100000 steps with 52 reset in 3396 ms.
Stack based approach found an accepted trace after 2074 steps with 1 reset with depth 1091 and stack size 1090 in 64 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-05 finished in 84150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (p1||(G(p0) U X(p2))))&&F(p3)))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:47:38] [INFO ] Invariant cache hit.
[2025-06-02 05:47:38] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20069ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20070ms
[2025-06-02 05:47:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:47:58] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 05:47:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:47:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:47:59] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:47:59] [INFO ] Invariant cache hit.
[2025-06-02 05:47:59] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in LTL mode , in 1 iterations and 80574 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-06 finished in 80799 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 (F(p1)||X(p2))) U p3)||X(G(p0)))))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:48:59] [INFO ] Invariant cache hit.
[2025-06-02 05:48:59] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20068ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20069ms
[2025-06-02 05:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:19] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 05:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:49:20] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:49:20] [INFO ] Invariant cache hit.
[2025-06-02 05:49:20] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:11] [INFO ] Deduced a trap composed of 3 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-02 05:50:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:15] [INFO ] Deduced a trap composed of 3 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-02 05:50:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in LTL mode , in 1 iterations and 80553 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-07
Product exploration explored 100000 steps with 201 reset in 2500 ms.
Product exploration explored 100000 steps with 204 reset in 2684 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 p3 (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p3 (NOT p1) p0 (NOT p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p3 (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0))))]
Knowledge based reduction with 18 factoid took 318 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 37400 steps (8 resets) in 230 ms. (161 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p3 (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p3 (NOT p1) p0 (NOT p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p3 (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2) p3))), (F p2), (F (NOT p3)), (F (NOT (OR p0 p3))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3)))]
Knowledge based reduction with 18 factoid took 710 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:50:28] [INFO ] Invariant cache hit.
[2025-06-02 05:50:28] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
(s157 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 92.0)
(s5 5.0)
(s6 2.0)
(s7 0.0)
(s8 4.0)
(s9 92.0)
(s10 5.0)
(s11 87.0)
(s12 0.0)
(s13 4.0)
(s14 7.0)
(s15 5.0)
(s16 2.0)
(s17 0.0)
(s18 4.0)
(s19 92.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 91.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 87.0)
(s33 4.0)
(s34 5.0)
(s35 92.0)
(s36 2.0)
(s37 0.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s52 87.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 91.0)
(s59 5.0)
(s60 5.0)
(s61 89.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 0.0)
(s73 4.0)
(s74 92.0)
(s75 92.0)
(s76 2.0)
(s77 0.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 87.0)
(s82 0.0)
(s83 4.0)
(s84 7.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 2.0)
(s92 0.0)
(s93 91.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s97 87.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 89.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 89.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 92.0)
(s111 2.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 0.0)
(s118 91.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 0.0)
(s123 91.0)
(s124 5.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 92.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 4.0)
(s149 92.0)
(s150 5.0)
(s151 2.0)
(s152 87.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 87.0)
(s157 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20069ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20070ms
[2025-06-02 05:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:50:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 05:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:50:48] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:50:48] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:50:48] [INFO ] Invariant cache hit.
[2025-06-02 05:50:48] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 3 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-02 05:51:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in LTL mode , in 1 iterations and 80575 ms. Remains : 500/500 places, 801/801 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 p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 18 factoid took 340 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40131 steps (8 resets) in 281 ms. (142 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 2/2 properties
[2025-06-02 05:51:50] [INFO ] Invariant cache hit.
[2025-06-02 05:51:50] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/1301 variables, and 23 constraints, problems are : Problem set: 0 solved, 2 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/1301 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 135 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=45 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT p3)), (F (NOT (OR p0 p3))), (F (NOT p0)), (F (NOT (OR p0 p3 p1)))]
Knowledge based reduction with 18 factoid took 774 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 192 reset in 2551 ms.
Product exploration explored 100000 steps with 193 reset in 2759 ms.
Applying partial POR strategy [false, true, false, false, true, true, false, true, false]
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:51:58] [INFO ] Invariant cache hit.
[2025-06-02 05:51:58] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20079ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20080ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:52:18] [INFO ] Redundant transitions in 6 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 05:52:18] [INFO ] Invariant cache hit.
[2025-06-02 05:52:18] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80211 ms. Remains : 500/500 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin11820904212633985177
[2025-06-02 05:53:18] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11820904212633985177
Running compilation step : cd /tmp/ltsmin11820904212633985177;'/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 1098 ms.
Running link step : cd /tmp/ltsmin11820904212633985177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11820904212633985177;'/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/stateBased16990378649687957135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:53:33] [INFO ] Invariant cache hit.
[2025-06-02 05:53:33] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20064ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20066ms
[2025-06-02 05:53:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:53] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 05:53:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:53:53] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:53:53] [INFO ] Invariant cache hit.
[2025-06-02 05:53:53] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:45] [INFO ] Deduced a trap composed of 3 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-02 05:54:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LTL mode , in 1 iterations and 80574 ms. Remains : 500/500 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin18277869012365174666
[2025-06-02 05:54:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18277869012365174666
Running compilation step : cd /tmp/ltsmin18277869012365174666;'/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 1093 ms.
Running link step : cd /tmp/ltsmin18277869012365174666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18277869012365174666;'/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/stateBased1776308105662863042.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 05:55:09] [INFO ] Flatten gal took : 15 ms
[2025-06-02 05:55:09] [INFO ] Flatten gal took : 15 ms
[2025-06-02 05:55:09] [INFO ] Time to serialize gal into /tmp/LTL147141467798094119.gal : 3 ms
[2025-06-02 05:55:09] [INFO ] Time to serialize properties into /tmp/LTL17115959759710746161.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/LTL147141467798094119.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2273085296533595779.hoa' '-atoms' '/tmp/LTL17115959759710746161.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL17115959759710746161.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2273085296533595779.hoa
Detected timeout of ITS tools.
[2025-06-02 05:55:24] [INFO ] Flatten gal took : 14 ms
[2025-06-02 05:55:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:55:24] [INFO ] Time to serialize gal into /tmp/LTL2979247288426590763.gal : 4 ms
[2025-06-02 05:55:24] [INFO ] Time to serialize properties into /tmp/LTL7181622117892537217.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/LTL2979247288426590763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7181622117892537217.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((("(p273>=1)")U((F("(p124>=4)"))||(X("(p294>=4)"))))U("(p246<3)"))||(X(G("(p273>=1)"))))))
Formula 0 simplified : F(((!"(p273>=1)" R (G!"(p124>=4)" & X!"(p294>=4)")) R !"(p246<3)") & XF!"(p273>=1)")
Detected timeout of ITS tools.
[2025-06-02 05:55:39] [INFO ] Flatten gal took : 28 ms
[2025-06-02 05:55:39] [INFO ] Applying decomposition
[2025-06-02 05:55:39] [INFO ] Flatten gal took : 14 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/graph1011754631174814422.txt' '-o' '/tmp/graph1011754631174814422.bin' '-w' '/tmp/graph1011754631174814422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1011754631174814422.bin' '-l' '-1' '-v' '-w' '/tmp/graph1011754631174814422.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:55:39] [INFO ] Decomposing Gal with order
[2025-06-02 05:55:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:55:39] [INFO ] Flatten gal took : 17 ms
[2025-06-02 05:55:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 05:55:39] [INFO ] Time to serialize gal into /tmp/LTL3931585073662017236.gal : 3 ms
[2025-06-02 05:55:39] [INFO ] Time to serialize properties into /tmp/LTL16050422467046514595.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/LTL3931585073662017236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16050422467046514595.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(((("(u54.p273>=1)")U((F("(u24.p124>=4)"))||(X("(u58.p294>=4)"))))U("(u49.p246<3)"))||(X(G("(u54.p273>=1)"))))))
Formula 0 simplified : F(((!"(u54.p273>=1)" R (G!"(u24.p124>=4)" & X!"(u58.p294>=4)")) R !"(u49.p246<3)") & XF!"(u54.p273>=1)")
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u0.t8, u1.t9, u1.t10, u1.t11, u1.t12, u1.t16, u2.t17, u2.t18, u2....5044
Detected timeout of ITS tools.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-07 finished in 414868 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 U (!p0&&X(X(p1))&&F(p2))))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:55:54] [INFO ] Invariant cache hit.
[2025-06-02 05:55:54] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20071ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20072ms
[2025-06-02 05:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:14] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 05:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:56:14] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:56:14] [INFO ] Invariant cache hit.
[2025-06-02 05:56:14] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:06] [INFO ] Deduced a trap composed of 3 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-02 05:57:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Finished structural reductions in LTL mode , in 1 iterations and 80579 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2) p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-09
Product exploration explored 100000 steps with 2762 reset in 3958 ms.
Stack based approach found an accepted trace after 16902 steps with 3284 reset with depth 2661 and stack size 884 in 338 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-09 finished in 85245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1) U p2))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:57:19] [INFO ] Invariant cache hit.
[2025-06-02 05:57:19] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20062ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20063ms
[2025-06-02 05:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:57:39] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 05:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:57:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:57:40] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:57:40] [INFO ] Redundant transitions in 6 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 05:57:40] [INFO ] Invariant cache hit.
[2025-06-02 05:57:40] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:32] [INFO ] Deduced a trap composed of 3 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-02 05:58:32] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80589 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-10 finished in 80739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U G(p1))&&G(p2))))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:58:40] [INFO ] Invariant cache hit.
[2025-06-02 05:58:40] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20065ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20066ms
[2025-06-02 05:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:59:00] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 05:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:59:00] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 05:59:00] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 05:59:00] [INFO ] Invariant cache hit.
[2025-06-02 05:59:00] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:52] [INFO ] Deduced a trap composed of 3 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-02 05:59:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:59:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Finished structural reductions in LTL mode , in 1 iterations and 80561 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-11 finished in 80857 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((G((p0&&X(p0))) U X(p1)))))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:00:01] [INFO ] Invariant cache hit.
[2025-06-02 06:00:01] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20067ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20068ms
[2025-06-02 06:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:00:21] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 06:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:00:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 06:00:21] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:00:21] [INFO ] Redundant transitions in 5 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 06:00:21] [INFO ] Invariant cache hit.
[2025-06-02 06:00:21] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:13] [INFO ] Deduced a trap composed of 3 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-02 06:01:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:17] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80577 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND p0 (NOT p1)), false, false]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-13 finished in 80872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p1)&&F(p2)))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:01:22] [INFO ] Invariant cache hit.
[2025-06-02 06:01:22] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20067ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20068ms
[2025-06-02 06:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:42] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 06:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:42] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 06:01:42] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:01:42] [INFO ] Invariant cache hit.
[2025-06-02 06:01:42] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:34] [INFO ] Deduced a trap composed of 3 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-02 06:02:34] [INFO ] Deduced a trap composed of 3 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-02 06:02:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:34] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in LTL mode , in 1 iterations and 80580 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-14
Entered a terminal (fully accepting) state of product in 49442 steps with 0 reset in 2278 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-14 finished in 83079 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(p0)) U p1) U (G(!p1)||X(!p1)||p2)))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:02:45] [INFO ] Invariant cache hit.
[2025-06-02 06:02:45] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20078ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20079ms
[2025-06-02 06:03:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 06:03:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 06:03:05] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:03:05] [INFO ] Invariant cache hit.
[2025-06-02 06:03:05] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:57] [INFO ] Deduced a trap composed of 3 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-02 06:03:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in LTL mode , in 1 iterations and 80563 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) (AND p0 p2)), (OR (NOT p1) p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1225 steps with 0 reset in 40 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLFireability-15 finished in 80808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||X(p1))) U ((p2&&X((p0||X(p1))))||X(G((p0||X(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U (F(p1)||X(p2))) U p3)||X(G(p0)))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0100-LTLFireability-07
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:04:06] [INFO ] Invariant cache hit.
[2025-06-02 06:04:06] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
(s236 2.0timeout
^^^^^^^^^^
(error "Invalid token: 2.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 92.0)
(s5 5.0)
(s6 2.0)
(s7 0.0)
(s8 4.0)
(s9 92.0)
(s10 5.0)
(s11 87.0)
(s12 0.0)
(s13 4.0)
(s14 7.0)
(s15 5.0)
(s16 2.0)
(s17 0.0)
(s18 4.0)
(s19 92.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 91.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 87.0)
(s33 4.0)
(s34 5.0)
(s35 92.0)
(s36 2.0)
(s37 0.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s52 87.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 91.0)
(s59 5.0)
(s60 5.0)
(s61 89.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 0.0)
(s73 4.0)
(s74 92.0)
(s75 92.0)
(s76 2.0)
(s77 0.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 87.0)
(s82 0.0)
(s83 4.0)
(s84 7.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 2.0)
(s92 0.0)
(s93 91.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s97 87.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 89.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 89.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 92.0)
(s111 2.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 0.0)
(s118 91.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 0.0)
(s123 91.0)
(s124 5.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 92.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 4.0)
(s149 92.0)
(s150 5.0)
(s151 2.0)
(s152 87.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 87.0)
(s157 0.0)
(s158 4.0)
(s159 7.0)
(s160 5.0)
(s161 2.0)
(s162 0.0)
(s163 4.0)
(s164 92.0)
(s165 5.0)
(s166 2.0)
(s167 0.0)
(s168 91.0)
(s169 5.0)
(s170 92.0)
(s171 2.0)
(s172 0.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s177 0.0)
(s178 91.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s182 0.0)
(s183 4.0)
(s184 92.0)
(s185 5.0)
(s186 89.0)
(s187 0.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 87.0)
(s192 0.0)
(s193 4.0)
(s194 7.0)
(s195 5.0)
(s196 2.0)
(s197 0.0)
(s198 4.0)
(s199 92.0)
(s200 5.0)
(s201 87.0)
(s202 0.0)
(s203 4.0)
(s204 7.0)
(s205 5.0)
(s206 2.0)
(s207 0.0)
(s208 4.0)
(s209 92.0)
(s210 5.0)
(s211 2.0)
(s212 0.0)
(s213 91.0)
(s214 5.0)
(s215 92.0)
(s216 2.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 89.0)
(s222 0.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 89.0)
(s227 0.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 89.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0timeout
)
(s237 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20065ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20066ms
[2025-06-02 06:04:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:04:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 06:04:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:04:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 06:04:27] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:04:27] [INFO ] Invariant cache hit.
[2025-06-02 06:04:27] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:18] [INFO ] Deduced a trap composed of 3 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-02 06:05:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 80587 ms. Remains : 500/500 places, 801/801 transitions.
Running random walk in product with property : JoinFreeModules-PT-0100-LTLFireability-07
Product exploration explored 100000 steps with 191 reset in 2531 ms.
Product exploration explored 100000 steps with 210 reset in 2717 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 p3 (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p3 (NOT p1) p0 (NOT p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p3 (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0))))]
Knowledge based reduction with 18 factoid took 336 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40081 steps (8 resets) in 231 ms. (172 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
[2025-06-02 06:05:33] [INFO ] Invariant cache hit.
[2025-06-02 06:05:33] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/1301 variables, and 23 constraints, problems are : Problem set: 0 solved, 4 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 24/39 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/1301 variables, and 29 constraints, problems are : Problem set: 0 solved, 4 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 270 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=38 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 7 ms.
Knowledge obtained : [(AND p3 (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p3 (NOT p1) p0 (NOT p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p3 (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p2) p3))), (F p2), (F (NOT p3)), (F (NOT (OR p0 p3))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3)))]
Knowledge based reduction with 18 factoid took 713 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:05:35] [INFO ] Invariant cache hit.
[2025-06-02 06:05:35] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20077ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20078ms
[2025-06-02 06:05:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:55] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 06:05:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 06:05:56] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:05:56] [INFO ] Invariant cache hit.
[2025-06-02 06:05:56] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:47] [INFO ] Deduced a trap composed of 3 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-02 06:06:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:06:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Finished structural reductions in LTL mode , in 1 iterations and 80581 ms. Remains : 500/500 places, 801/801 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 p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
Knowledge based reduction with 18 factoid took 324 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 39151 steps (8 resets) in 246 ms. (158 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT p3)), (F (NOT (OR p0 p3))), (F (NOT p0)), (F (NOT (OR p0 p3 p1)))]
Knowledge based reduction with 18 factoid took 736 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 182 reset in 2550 ms.
Product exploration explored 100000 steps with 197 reset in 2703 ms.
Applying partial POR strategy [false, true, false, false, true, true, false, true, false]
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:07:04] [INFO ] Invariant cache hit.
[2025-06-02 06:07:04] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20070ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20071ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:07:24] [INFO ] Redundant transitions in 5 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-02 06:07:24] [INFO ] Invariant cache hit.
[2025-06-02 06:07:24] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80197 ms. Remains : 500/500 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin16264699488118095329
[2025-06-02 06:08:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16264699488118095329
Running compilation step : cd /tmp/ltsmin16264699488118095329;'/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 1118 ms.
Running link step : cd /tmp/ltsmin16264699488118095329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16264699488118095329;'/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/stateBased3482755435763898991.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:08:40] [INFO ] Invariant cache hit.
[2025-06-02 06:08:40] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20076ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20077ms
[2025-06-02 06:09:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:09:00] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 06:09:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:09:00] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-02 06:09:00] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-02 06:09:00] [INFO ] Invariant cache hit.
[2025-06-02 06:09:00] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:52] [INFO ] Deduced a trap composed of 3 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-02 06:09:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in LTL mode , in 1 iterations and 80614 ms. Remains : 500/500 places, 801/801 transitions.
Built C files in :
/tmp/ltsmin7636207274289882806
[2025-06-02 06:10:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7636207274289882806
Running compilation step : cd /tmp/ltsmin7636207274289882806;'/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 1109 ms.
Running link step : cd /tmp/ltsmin7636207274289882806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7636207274289882806;'/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/stateBased12686658344444751779.hoa' '--buchi-type=spotba'
LTSmin run took 10598 ms.
Treatment of property JoinFreeModules-PT-0100-LTLFireability-07 finished in 366369 ms.
FORMULA JoinFreeModules-PT-0100-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-06-02 06:10:12] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14678973025106660799
[2025-06-02 06:10:12] [INFO ] Applying decomposition
[2025-06-02 06:10:12] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2025-06-02 06:10:12] [INFO ] Flatten gal took : 14 ms
[2025-06-02 06:10:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:10:12] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2025-06-02 06:10:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12454161639601230439.txt' '-o' '/tmp/graph12454161639601230439.bin' '-w' '/tmp/graph12454161639601230439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12454161639601230439.bin' '-l' '-1' '-v' '-w' '/tmp/graph12454161639601230439.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:10:12] [INFO ] Decomposing Gal with order
[2025-06-02 06:10:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:10:12] [INFO ] Flatten gal took : 17 ms
[2025-06-02 06:10:12] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2025-06-02 06:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 06:10:12] [INFO ] Time to serialize gal into /tmp/LTLFireability14413370695475485037.gal : 4 ms
[2025-06-02 06:10:12] [INFO ] Time to serialize properties into /tmp/LTLFireability6514325647121683429.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/LTLFireability14413370695475485037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6514325647121683429.ltl' '-c' '-stutter-deadlock'
[2025-06-02 06:10:12] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 06:10:12] [INFO ] Built C files in 213ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14678973025106660799
Running compilation step : cd /tmp/ltsmin14678973025106660799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(("(u8.p41<5)")||(X("((u22.p111>=3)&&(u40.p201>=3))"))))U((("(u48.p243<1)")&&(X(("(u8.p41<5)")||(X("((u22.p111>=3)&&(u40.p201>=...231
Formula 0 simplified : X(X(!"(u8.p41<5)" & X!"((u22.p111>=3)&&(u40.p201>=3))") R (XF(!"(u8.p41<5)" & X!"((u22.p111>=3)&&(u40.p201>=3))") & (!"(u48.p243<1)"...214
Compilation finished in 1960 ms.
Running link step : cd /tmp/ltsmin14678973025106660799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14678973025106660799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(((LTLAPp0==true)||X((LTLAPp1==true)))) U (((LTLAPp2==true)&&X(((LTLAPp0==true)||X((LTLAPp1==true)))))||X([](((LTLAPp0==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u0.t8, u1.t9, u1.t10, u1.t11, u1.t12, u1.t16, u2.t17, u2.t18, u2....5044
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
18588 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,185.988,2607952,1,0,131990,1.05792e+07,1096,66907,697,1.32601e+07,943
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0100-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2985235 ms.
BK_STOP 1748845028972
--------------------
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="JoinFreeModules-PT-0100"
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 JoinFreeModules-PT-0100, 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 r114-tall-174876422700444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 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 ;