About the Execution of ITS-Tools for ShieldPPPs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFF?FF?FF???FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533300748.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 ShieldPPPs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533300748
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K 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 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 447K May 29 14:33 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 ShieldPPPs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749275831894
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 05:57:13] [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-07 05:57:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 05:57:13] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2025-06-07 05:57:13] [INFO ] Transformed 1553 places.
[2025-06-07 05:57:13] [INFO ] Transformed 1303 transitions.
[2025-06-07 05:57:13] [INFO ] Found NUPN structural information;
[2025-06-07 05:57:13] [INFO ] Parsed PT model containing 1553 places and 1303 transitions and 5006 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-050A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 180 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 05:57:13] [INFO ] Computed 551 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:57:14] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2025-06-07 05:57:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:57:16] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 05:57:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30041 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30021 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60585ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60604ms
Finished structural reductions in LTL mode , in 1 iterations and 63453 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 60 out of 1553 places after structural reductions.
[2025-06-07 05:58:17] [INFO ] Flatten gal took : 181 ms
[2025-06-07 05:58:17] [INFO ] Flatten gal took : 88 ms
[2025-06-07 05:58:17] [INFO ] Input system was already deterministic with 1303 transitions.
Support contains 57 out of 1553 places (down from 60) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 31
RANDOM walk for 40000 steps (11 resets) in 2220 ms. (18 steps per ms) remains 1/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 1/1 properties
[2025-06-07 05:58:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/19 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1534/1553 variables, 546/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1534/2104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:19] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:19] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:19] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:20] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:20] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:20] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:20] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:21] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:21] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:21] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:21] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:22] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:22] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:22] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:22] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:23] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:23] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:23] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 27 ms to minimize.
SMT process timed out in 5171ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 444 times.
Drop transitions (Partial Free agglomeration) removed 444 transitions
Iterating global reduction 0 with 444 rules applied. Total rules applied 448 place count 1551 transition count 1301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 449 place count 1550 transition count 1300
Applied a total of 449 rules in 335 ms. Remains 1550 /1553 variables (removed 3) and now considering 1300/1303 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 1550/1553 places, 1300/1303 transitions.
RANDOM walk for 40000 steps (8 resets) in 887 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 243651 steps, run timeout after 3053 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 243651 steps, saw 240957 distinct states, run finished after 3057 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 1300 rows 1550 cols
[2025-06-07 05:58:27] [INFO ] Computed 551 invariants in 90 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/18 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/20 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/22 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/55 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 73/128 variables, 34/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/132 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/138 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/138 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/138 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/140 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/140 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/140 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 103/243 variables, 53/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/243 variables, 45/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/243 variables, 12/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/243 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/247 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/247 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/247 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/247 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 8/255 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/255 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/255 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 142/397 variables, 76/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/397 variables, 68/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/397 variables, 15/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/397 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/397 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 8/405 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/405 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/405 variables, 8/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/405 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 16/421 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/421 variables, 16/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/421 variables, 12/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/421 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 113/534 variables, 63/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/534 variables, 59/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/534 variables, 18/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/534 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/534 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/536 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/536 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/536 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/536 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 4/540 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/540 variables, 4/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/540 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 106/646 variables, 56/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/646 variables, 52/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/646 variables, 11/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/646 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:27] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:28] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:28] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/646 variables, 3/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/646 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 69 (OVERLAPS) 5/651 variables, 7/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/651 variables, 5/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/651 variables, 5/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/651 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 6/657 variables, 3/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/657 variables, 6/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/657 variables, 4/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/657 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 2/659 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/659 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/659 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 1/660 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/660 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/660 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/660 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 102/762 variables, 56/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/762 variables, 52/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/762 variables, 16/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/762 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/764 variables, 2/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/764 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/764 variables, 2/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/764 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 4/768 variables, 2/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/768 variables, 4/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/768 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 106/874 variables, 56/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/874 variables, 52/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/874 variables, 12/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/874 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 6/880 variables, 8/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/880 variables, 6/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/880 variables, 6/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/880 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 8/888 variables, 4/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/888 variables, 8/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/888 variables, 4/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/888 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 102/990 variables, 56/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/990 variables, 52/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/990 variables, 16/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/990 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 2/992 variables, 2/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/992 variables, 2/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/992 variables, 2/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/992 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 4/996 variables, 2/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/996 variables, 4/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/996 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 106/1102 variables, 56/1302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1102 variables, 52/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1102 variables, 10/1364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1102 variables, 2/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1102 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 6/1108 variables, 8/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1108 variables, 6/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1108 variables, 6/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1108 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 8/1116 variables, 4/1390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1116 variables, 8/1398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1116 variables, 4/1402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1116 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 102/1218 variables, 56/1458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1218 variables, 52/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1218 variables, 16/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1218 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 2/1220 variables, 2/1528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1220 variables, 2/1530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1220 variables, 2/1532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1220 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 4/1224 variables, 2/1534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1224 variables, 4/1538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1224 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 104/1328 variables, 56/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1328 variables, 52/1646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1328 variables, 11/1657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1328 variables, 1/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1328 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 6/1334 variables, 8/1666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1334 variables, 6/1672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1334 variables, 6/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1334 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 8/1342 variables, 4/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1342 variables, 8/1690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1342 variables, 4/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1342 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 99/1441 variables, 54/1748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1441 variables, 50/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1441 variables, 16/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1441 variables, 0/1814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 2/1443 variables, 2/1816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1443 variables, 2/1818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1443 variables, 2/1820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1443 variables, 0/1820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 4/1447 variables, 2/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1447 variables, 4/1826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1447 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 92/1539 variables, 52/1878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1539 variables, 48/1926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1539 variables, 11/1937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1539 variables, 1/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1539 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 4/1543 variables, 6/1944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1543 variables, 4/1948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1543 variables, 4/1952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1543 variables, 0/1952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (OVERLAPS) 4/1547 variables, 2/1954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1547 variables, 4/1958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1547 variables, 4/1962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1547 variables, 0/1962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (OVERLAPS) 78/1625 variables, 41/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1625 variables, 41/2044 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1625 variables, 12/2056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1625 variables, 0/2056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (OVERLAPS) 2/1627 variables, 2/2058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1627 variables, 2/2060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1627 variables, 2/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1627 variables, 0/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (OVERLAPS) 4/1631 variables, 2/2064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1631 variables, 4/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1631 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 79/1710 variables, 42/2110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1710 variables, 38/2148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1710 variables, 7/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1710 variables, 2/2157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1710 variables, 0/2157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (OVERLAPS) 3/1713 variables, 5/2162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1713 variables, 3/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1713 variables, 3/2168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1713 variables, 0/2168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (OVERLAPS) 2/1715 variables, 1/2169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1715 variables, 2/2171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1715 variables, 2/2173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1715 variables, 0/2173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (OVERLAPS) 2/1717 variables, 1/2174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1717 variables, 2/2176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1717 variables, 2/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1717 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 1/1718 variables, 1/2179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1718 variables, 1/2180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1718 variables, 1/2181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1718 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 78/1796 variables, 41/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1796 variables, 41/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1796 variables, 12/2275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1796 variables, 0/2275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (OVERLAPS) 2/1798 variables, 2/2277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1798 variables, 2/2279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1798 variables, 2/2281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1798 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (OVERLAPS) 4/1802 variables, 2/2283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/1802 variables, 4/2287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1802 variables, 0/2287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 79/1881 variables, 42/2329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1881 variables, 38/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1881 variables, 7/2374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1881 variables, 2/2376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1881 variables, 0/2376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (OVERLAPS) 3/1884 variables, 5/2381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1884 variables, 3/2384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1884 variables, 3/2387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1884 variables, 0/2387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (OVERLAPS) 2/1886 variables, 1/2388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1886 variables, 2/2390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1886 variables, 2/2392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1886 variables, 0/2392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 2/1888 variables, 1/2393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1888 variables, 2/2395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1888 variables, 2/2397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1888 variables, 0/2397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (OVERLAPS) 1/1889 variables, 1/2398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1889 variables, 1/2399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1889 variables, 1/2400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1889 variables, 0/2400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (OVERLAPS) 78/1967 variables, 41/2441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1967 variables, 41/2482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1967 variables, 12/2494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1967 variables, 0/2494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (OVERLAPS) 2/1969 variables, 2/2496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1969 variables, 2/2498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1969 variables, 2/2500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/1969 variables, 0/2500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (OVERLAPS) 4/1973 variables, 2/2502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1973 variables, 4/2506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1973 variables, 0/2506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (OVERLAPS) 79/2052 variables, 42/2548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/2052 variables, 38/2586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/2052 variables, 8/2594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/2052 variables, 1/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/2052 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (OVERLAPS) 4/2056 variables, 6/2601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/2056 variables, 4/2605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/2056 variables, 4/2609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/2056 variables, 0/2609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (OVERLAPS) 2/2058 variables, 1/2610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/2058 variables, 2/2612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/2058 variables, 2/2614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/2058 variables, 0/2614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (OVERLAPS) 2/2060 variables, 1/2615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/2060 variables, 2/2617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/2060 variables, 2/2619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/2060 variables, 0/2619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (OVERLAPS) 78/2138 variables, 41/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/2138 variables, 41/2701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/2138 variables, 12/2713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/2138 variables, 0/2713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (OVERLAPS) 2/2140 variables, 2/2715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/2140 variables, 2/2717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/2140 variables, 2/2719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/2140 variables, 0/2719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (OVERLAPS) 4/2144 variables, 2/2721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/2144 variables, 4/2725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/2144 variables, 0/2725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (OVERLAPS) 79/2223 variables, 42/2767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/2223 variables, 38/2805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/2223 variables, 8/2813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/2223 variables, 1/2814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/2223 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (OVERLAPS) 4/2227 variables, 6/2820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/2227 variables, 4/2824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/2227 variables, 4/2828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/2227 variables, 0/2828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (OVERLAPS) 4/2231 variables, 2/2830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/2231 variables, 4/2834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/2231 variables, 4/2838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/2231 variables, 0/2838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (OVERLAPS) 78/2309 variables, 41/2879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/2309 variables, 41/2920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/2309 variables, 12/2932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/2309 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (OVERLAPS) 2/2311 variables, 2/2934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/2311 variables, 2/2936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/2311 variables, 2/2938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/2311 variables, 0/2938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (OVERLAPS) 4/2315 variables, 2/2940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/2315 variables, 4/2944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/2315 variables, 0/2944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (OVERLAPS) 79/2394 variables, 42/2986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (INCLUDED_ONLY) 0/2394 variables, 38/3024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/2394 variables, 8/3032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/2394 variables, 1/3033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/2394 variables, 0/3033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (OVERLAPS) 4/2398 variables, 6/3039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (INCLUDED_ONLY) 0/2398 variables, 4/3043 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/2398 variables, 4/3047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/2398 variables, 0/3047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 4/2402 variables, 2/3049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/2402 variables, 4/3053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/2402 variables, 4/3057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/2402 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (OVERLAPS) 70/2472 variables, 39/3096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/2472 variables, 39/3135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/2472 variables, 12/3147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (INCLUDED_ONLY) 0/2472 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (OVERLAPS) 1/2473 variables, 1/3148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/2473 variables, 1/3149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/2473 variables, 1/3150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/2473 variables, 0/3150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (OVERLAPS) 2/2475 variables, 1/3151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/2475 variables, 2/3153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/2475 variables, 2/3155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/2475 variables, 0/3155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (OVERLAPS) 43/2518 variables, 26/3181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/2518 variables, 26/3207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/2518 variables, 7/3214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (INCLUDED_ONLY) 0/2518 variables, 0/3214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (OVERLAPS) 2/2520 variables, 4/3218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/2520 variables, 2/3220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (INCLUDED_ONLY) 0/2520 variables, 2/3222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/2520 variables, 0/3222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (OVERLAPS) 31/2551 variables, 16/3238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/2551 variables, 16/3254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/2551 variables, 5/3259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (INCLUDED_ONLY) 0/2551 variables, 0/3259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (OVERLAPS) 26/2577 variables, 15/3274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/2577 variables, 15/3289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (INCLUDED_ONLY) 0/2577 variables, 3/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (INCLUDED_ONLY) 0/2577 variables, 0/3292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (OVERLAPS) 2/2579 variables, 4/3296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (INCLUDED_ONLY) 0/2579 variables, 2/3298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (INCLUDED_ONLY) 0/2579 variables, 2/3300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (INCLUDED_ONLY) 0/2579 variables, 0/3300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (OVERLAPS) 29/2608 variables, 14/3314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (INCLUDED_ONLY) 0/2608 variables, 14/3328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (INCLUDED_ONLY) 0/2608 variables, 4/3332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/2608 variables, 0/3332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (OVERLAPS) 26/2634 variables, 15/3347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/2634 variables, 15/3362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (INCLUDED_ONLY) 0/2634 variables, 3/3365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (INCLUDED_ONLY) 0/2634 variables, 0/3365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (OVERLAPS) 2/2636 variables, 4/3369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (INCLUDED_ONLY) 0/2636 variables, 2/3371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (INCLUDED_ONLY) 0/2636 variables, 2/3373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/2636 variables, 0/3373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (OVERLAPS) 29/2665 variables, 14/3387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (INCLUDED_ONLY) 0/2665 variables, 14/3401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/2665 variables, 4/3405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/2665 variables, 0/3405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (OVERLAPS) 26/2691 variables, 15/3420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (INCLUDED_ONLY) 0/2691 variables, 15/3435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (INCLUDED_ONLY) 0/2691 variables, 3/3438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (INCLUDED_ONLY) 0/2691 variables, 0/3438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (OVERLAPS) 2/2693 variables, 4/3442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (INCLUDED_ONLY) 0/2693 variables, 2/3444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (INCLUDED_ONLY) 0/2693 variables, 2/3446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/2693 variables, 0/3446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (OVERLAPS) 29/2722 variables, 14/3460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (INCLUDED_ONLY) 0/2722 variables, 14/3474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/2722 variables, 4/3478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 378 (INCLUDED_ONLY) 0/2722 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (OVERLAPS) 26/2748 variables, 15/3493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (INCLUDED_ONLY) 0/2748 variables, 15/3508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/2748 variables, 3/3511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (INCLUDED_ONLY) 0/2748 variables, 0/3511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (OVERLAPS) 2/2750 variables, 4/3515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (INCLUDED_ONLY) 0/2750 variables, 2/3517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (INCLUDED_ONLY) 0/2750 variables, 2/3519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/2750 variables, 0/3519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (OVERLAPS) 29/2779 variables, 14/3533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (INCLUDED_ONLY) 0/2779 variables, 14/3547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/2779 variables, 4/3551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/2779 variables, 0/3551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (OVERLAPS) 26/2805 variables, 15/3566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (INCLUDED_ONLY) 0/2805 variables, 15/3581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/2805 variables, 3/3584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (INCLUDED_ONLY) 0/2805 variables, 0/3584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (OVERLAPS) 2/2807 variables, 4/3588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/2807 variables, 2/3590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (INCLUDED_ONLY) 0/2807 variables, 2/3592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 398 (INCLUDED_ONLY) 0/2807 variables, 0/3592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (OVERLAPS) 26/2833 variables, 13/3605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (INCLUDED_ONLY) 0/2833 variables, 13/3618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/2833 variables, 4/3622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/2833 variables, 0/3622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (OVERLAPS) 14/2847 variables, 10/3632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (INCLUDED_ONLY) 0/2847 variables, 10/3642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/2847 variables, 3/3645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (INCLUDED_ONLY) 0/2847 variables, 1/3646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (INCLUDED_ONLY) 0/2847 variables, 0/3646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (OVERLAPS) 1/2848 variables, 1/3647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (INCLUDED_ONLY) 0/2848 variables, 1/3648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (INCLUDED_ONLY) 0/2848 variables, 1/3649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/2848 variables, 0/3649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (OVERLAPS) 2/2850 variables, 2/3651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/2850 variables, 2/3653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (INCLUDED_ONLY) 0/2850 variables, 1/3654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (INCLUDED_ONLY) 0/2850 variables, 0/3654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (OVERLAPS) 0/2850 variables, 0/3654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2850/2850 variables, and 3654 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3619 ms.
Refiners :[Domain max(s): 1550/1550 constraints, Positive P Invariants (semi-flows): 530/530 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1550/1550 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 13/18 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/20 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/22 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/55 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 73/128 variables, 34/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/128 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/128 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/132 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/138 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/138 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/138 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/140 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/140 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 103/243 variables, 53/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/243 variables, 45/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/243 variables, 12/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/243 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/247 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/247 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/247 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/247 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 8/255 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/255 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/255 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 142/397 variables, 76/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/397 variables, 68/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/397 variables, 15/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/397 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/397 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/397 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 8/405 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/405 variables, 8/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/405 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/405 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 16/421 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/421 variables, 16/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/421 variables, 12/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/421 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 113/534 variables, 63/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/534 variables, 59/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/534 variables, 18/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/534 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/534 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/534 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 2/536 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/536 variables, 2/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/536 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/536 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 4/540 variables, 2/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/540 variables, 4/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/540 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 106/646 variables, 56/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/646 variables, 52/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/646 variables, 11/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/646 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/646 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:31] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:31] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:31] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
At refinement iteration 71 (INCLUDED_ONLY) 0/646 variables, 3/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/646 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 5/651 variables, 7/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/651 variables, 5/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/651 variables, 5/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:31] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:31] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/651 variables, 2/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/651 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 6/657 variables, 3/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/657 variables, 6/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/657 variables, 4/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:31] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 81 (INCLUDED_ONLY) 0/657 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/657 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 2/659 variables, 1/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/659 variables, 2/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/659 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 1/660 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/660 variables, 1/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/660 variables, 1/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/660 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 102/762 variables, 56/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/762 variables, 52/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/762 variables, 16/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:32] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:32] [INFO ] Deduced a trap composed of 6 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-07 05:58:32] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
At refinement iteration 93 (INCLUDED_ONLY) 0/762 variables, 3/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/762 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 2/764 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/764 variables, 2/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/764 variables, 2/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/764 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 4/768 variables, 2/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/768 variables, 4/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/768 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 106/874 variables, 56/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/874 variables, 52/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/874 variables, 12/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/874 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 6/880 variables, 8/1092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/880 variables, 6/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/880 variables, 6/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/880 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 8/888 variables, 4/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/888 variables, 8/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/888 variables, 4/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/888 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 102/990 variables, 56/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/990 variables, 52/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/990 variables, 16/1244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:32] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
At refinement iteration 117 (INCLUDED_ONLY) 0/990 variables, 1/1245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/990 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 2/992 variables, 2/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/992 variables, 2/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/992 variables, 2/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/992 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 4/996 variables, 2/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/996 variables, 4/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:32] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:33] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 6 ms to minimize.
At refinement iteration 125 (INCLUDED_ONLY) 0/996 variables, 2/1259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/996 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 106/1102 variables, 56/1315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1102 variables, 52/1367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1102 variables, 10/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1102 variables, 2/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:33] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:33] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 7 ms to minimize.
At refinement iteration 131 (INCLUDED_ONLY) 0/1102 variables, 2/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1102 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 6/1108 variables, 8/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1108 variables, 6/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1108 variables, 6/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1108 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 8/1116 variables, 4/1405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1116 variables, 8/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1116 variables, 4/1417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:33] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:33] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
At refinement iteration 140 (INCLUDED_ONLY) 0/1116 variables, 2/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1116 variables, 0/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 102/1218 variables, 56/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1218 variables, 52/1527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1218 variables, 16/1543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:33] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 6 ms to minimize.
At refinement iteration 145 (INCLUDED_ONLY) 0/1218 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1218 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 2/1220 variables, 2/1546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1220 variables, 2/1548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1220 variables, 2/1550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1220 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 4/1224 variables, 2/1552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1224 variables, 4/1556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1224 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 104/1328 variables, 56/1612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1328 variables, 52/1664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1328 variables, 11/1675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1328 variables, 1/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1328 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 6/1334 variables, 8/1684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1334 variables, 6/1690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1334 variables, 6/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:34] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 17 ms to minimize.
At refinement iteration 162 (INCLUDED_ONLY) 0/1334 variables, 1/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1334 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (OVERLAPS) 8/1342 variables, 4/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1342 variables, 8/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1342 variables, 4/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1342 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 99/1441 variables, 54/1767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1441 variables, 50/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1441 variables, 16/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1441 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (OVERLAPS) 2/1443 variables, 2/1835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1443 variables, 2/1837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1443 variables, 2/1839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:34] [INFO ] Deduced a trap along path composed of 4 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-07 05:58:34] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 175 (INCLUDED_ONLY) 0/1443 variables, 2/1841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:34] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:35] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 5 ms to minimize.
At refinement iteration 176 (INCLUDED_ONLY) 0/1443 variables, 2/1843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1443 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (OVERLAPS) 4/1447 variables, 2/1845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1447 variables, 4/1849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1447 variables, 0/1849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (OVERLAPS) 92/1539 variables, 52/1901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1539 variables, 48/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1539 variables, 11/1960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1539 variables, 1/1961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1539 variables, 0/1961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 4/1543 variables, 6/1967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1543 variables, 4/1971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1543 variables, 4/1975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:35] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:35] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 6 ms to minimize.
At refinement iteration 189 (INCLUDED_ONLY) 0/1543 variables, 2/1977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1543 variables, 0/1977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (OVERLAPS) 4/1547 variables, 2/1979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1547 variables, 4/1983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1547 variables, 4/1987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:35] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:35] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:36] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 6 ms to minimize.
At refinement iteration 194 (INCLUDED_ONLY) 0/1547 variables, 3/1990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1547 variables, 0/1990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (OVERLAPS) 78/1625 variables, 41/2031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1625 variables, 41/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1625 variables, 12/2084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:36] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:36] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:36] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 5 ms to minimize.
At refinement iteration 199 (INCLUDED_ONLY) 0/1625 variables, 3/2087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1625 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (OVERLAPS) 2/1627 variables, 2/2089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1627 variables, 2/2091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1627 variables, 2/2093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:36] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:37] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:37] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:37] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 10 ms to minimize.
At refinement iteration 204 (INCLUDED_ONLY) 0/1627 variables, 4/2097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:37] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 12 ms to minimize.
At refinement iteration 205 (INCLUDED_ONLY) 0/1627 variables, 1/2098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1627 variables, 0/2098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 4/1631 variables, 2/2100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1631 variables, 4/2104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1631 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (OVERLAPS) 79/1710 variables, 42/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/1710 variables, 38/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1710 variables, 7/2191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1710 variables, 2/2193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:37] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:37] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 9 ms to minimize.
At refinement iteration 214 (INCLUDED_ONLY) 0/1710 variables, 2/2195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:38] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:38] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 8 ms to minimize.
At refinement iteration 215 (INCLUDED_ONLY) 0/1710 variables, 2/2197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:38] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 8 ms to minimize.
At refinement iteration 216 (INCLUDED_ONLY) 0/1710 variables, 1/2198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1710 variables, 0/2198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (OVERLAPS) 3/1713 variables, 5/2203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1713 variables, 3/2206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/1713 variables, 3/2209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1713 variables, 0/2209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 2/1715 variables, 1/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1715 variables, 2/2212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1715 variables, 2/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1715 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (OVERLAPS) 2/1717 variables, 1/2215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1717 variables, 2/2217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1717 variables, 2/2219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:38] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 6 ms to minimize.
At refinement iteration 229 (INCLUDED_ONLY) 0/1717 variables, 1/2220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1717 variables, 0/2220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (OVERLAPS) 1/1718 variables, 1/2221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1718 variables, 1/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1718 variables, 1/2223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1718 variables, 0/2223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 78/1796 variables, 41/2264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1796 variables, 41/2305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1796 variables, 12/2317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1796 variables, 0/2317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (OVERLAPS) 2/1798 variables, 2/2319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1798 variables, 2/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1798 variables, 2/2323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1798 variables, 0/2323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (OVERLAPS) 4/1802 variables, 2/2325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1802 variables, 4/2329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1802 variables, 0/2329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (OVERLAPS) 79/1881 variables, 42/2371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/1881 variables, 38/2409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1881 variables, 7/2416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1881 variables, 2/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/1881 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (OVERLAPS) 3/1884 variables, 5/2423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1884 variables, 3/2426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1884 variables, 3/2429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1884 variables, 0/2429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (OVERLAPS) 2/1886 variables, 1/2430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1886 variables, 2/2432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1886 variables, 2/2434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/1886 variables, 0/2434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (OVERLAPS) 2/1888 variables, 1/2435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1888 variables, 2/2437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1888 variables, 2/2439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/1888 variables, 0/2439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (OVERLAPS) 1/1889 variables, 1/2440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1889 variables, 1/2441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/1889 variables, 1/2442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1889 variables, 0/2442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (OVERLAPS) 78/1967 variables, 41/2483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/1967 variables, 41/2524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1967 variables, 12/2536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/1967 variables, 0/2536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (OVERLAPS) 2/1969 variables, 2/2538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1969 variables, 2/2540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/1969 variables, 2/2542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/1969 variables, 0/2542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (OVERLAPS) 4/1973 variables, 2/2544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1973 variables, 4/2548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/1973 variables, 0/2548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (OVERLAPS) 79/2052 variables, 42/2590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/2052 variables, 38/2628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/2052 variables, 8/2636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/2052 variables, 1/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/2052 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (OVERLAPS) 4/2056 variables, 6/2643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/2056 variables, 4/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/2056 variables, 4/2651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/2056 variables, 0/2651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (OVERLAPS) 2/2058 variables, 1/2652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/2058 variables, 2/2654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/2058 variables, 2/2656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/2058 variables, 0/2656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (OVERLAPS) 2/2060 variables, 1/2657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/2060 variables, 2/2659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/2060 variables, 2/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/2060 variables, 0/2661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (OVERLAPS) 78/2138 variables, 41/2702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/2138 variables, 41/2743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/2138 variables, 12/2755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:40] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 12 ms to minimize.
At refinement iteration 298 (INCLUDED_ONLY) 0/2138 variables, 1/2756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/2138 variables, 0/2756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (OVERLAPS) 2/2140 variables, 2/2758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/2140 variables, 2/2760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/2140 variables, 2/2762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/2140 variables, 0/2762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (OVERLAPS) 4/2144 variables, 2/2764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/2144 variables, 4/2768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/2144 variables, 0/2768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (OVERLAPS) 79/2223 variables, 42/2810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/2223 variables, 38/2848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/2223 variables, 8/2856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/2223 variables, 1/2857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/2223 variables, 0/2857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (OVERLAPS) 4/2227 variables, 6/2863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/2227 variables, 4/2867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/2227 variables, 4/2871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (INCLUDED_ONLY) 0/2227 variables, 0/2871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (OVERLAPS) 4/2231 variables, 2/2873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/2231 variables, 4/2877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/2231 variables, 4/2881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (INCLUDED_ONLY) 0/2231 variables, 0/2881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (OVERLAPS) 78/2309 variables, 41/2922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/2309 variables, 41/2963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (INCLUDED_ONLY) 0/2309 variables, 12/2975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:41] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:41] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 7 ms to minimize.
At refinement iteration 323 (INCLUDED_ONLY) 0/2309 variables, 2/2977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/2309 variables, 0/2977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (OVERLAPS) 2/2311 variables, 2/2979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/2311 variables, 2/2981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (INCLUDED_ONLY) 0/2311 variables, 2/2983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/2311 variables, 0/2983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (OVERLAPS) 4/2315 variables, 2/2985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/2315 variables, 4/2989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (INCLUDED_ONLY) 0/2315 variables, 0/2989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (OVERLAPS) 79/2394 variables, 42/3031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/2394 variables, 38/3069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (INCLUDED_ONLY) 0/2394 variables, 8/3077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/2394 variables, 1/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/2394 variables, 0/3078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (OVERLAPS) 4/2398 variables, 6/3084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/2398 variables, 4/3088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/2398 variables, 4/3092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/2398 variables, 0/3092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (OVERLAPS) 4/2402 variables, 2/3094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (INCLUDED_ONLY) 0/2402 variables, 4/3098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (INCLUDED_ONLY) 0/2402 variables, 4/3102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/2402 variables, 0/3102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (OVERLAPS) 70/2472 variables, 39/3141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (INCLUDED_ONLY) 0/2472 variables, 39/3180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/2472 variables, 12/3192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:42] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:42] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:42] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:43] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 9 ms to minimize.
At refinement iteration 348 (INCLUDED_ONLY) 0/2472 variables, 4/3196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (INCLUDED_ONLY) 0/2472 variables, 0/3196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (OVERLAPS) 1/2473 variables, 1/3197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (INCLUDED_ONLY) 0/2473 variables, 1/3198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (INCLUDED_ONLY) 0/2473 variables, 1/3199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:58:43] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 8 ms to minimize.
At refinement iteration 353 (INCLUDED_ONLY) 0/2473 variables, 1/3200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/2473 variables, 0/3200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (OVERLAPS) 2/2475 variables, 1/3201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/2475 variables, 2/3203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (INCLUDED_ONLY) 0/2475 variables, 2/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (INCLUDED_ONLY) 0/2475 variables, 0/3205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (OVERLAPS) 43/2518 variables, 26/3231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (INCLUDED_ONLY) 0/2518 variables, 26/3257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (INCLUDED_ONLY) 0/2518 variables, 7/3264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/2518 variables, 0/3264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (OVERLAPS) 2/2520 variables, 4/3268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (INCLUDED_ONLY) 0/2520 variables, 2/3270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/2520 variables, 2/3272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/2520 variables, 0/3272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (OVERLAPS) 31/2551 variables, 16/3288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (INCLUDED_ONLY) 0/2551 variables, 16/3304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (INCLUDED_ONLY) 0/2551 variables, 5/3309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (INCLUDED_ONLY) 0/2551 variables, 0/3309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (OVERLAPS) 26/2577 variables, 15/3324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (INCLUDED_ONLY) 0/2577 variables, 15/3339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (INCLUDED_ONLY) 0/2577 variables, 3/3342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/2577 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (OVERLAPS) 2/2579 variables, 4/3346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (INCLUDED_ONLY) 0/2579 variables, 2/3348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/2579 variables, 2/3350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 378 (INCLUDED_ONLY) 0/2579 variables, 0/3350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (OVERLAPS) 29/2608 variables, 14/3364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (INCLUDED_ONLY) 0/2608 variables, 14/3378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/2608 variables, 4/3382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (INCLUDED_ONLY) 0/2608 variables, 0/3382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (OVERLAPS) 26/2634 variables, 15/3397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (INCLUDED_ONLY) 0/2634 variables, 15/3412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (INCLUDED_ONLY) 0/2634 variables, 3/3415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/2634 variables, 0/3415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (OVERLAPS) 2/2636 variables, 4/3419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (INCLUDED_ONLY) 0/2636 variables, 2/3421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/2636 variables, 2/3423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/2636 variables, 0/3423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (OVERLAPS) 29/2665 variables, 14/3437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (INCLUDED_ONLY) 0/2665 variables, 14/3451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/2665 variables, 4/3455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (INCLUDED_ONLY) 0/2665 variables, 0/3455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (OVERLAPS) 26/2691 variables, 15/3470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/2691 variables, 15/3485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (INCLUDED_ONLY) 0/2691 variables, 3/3488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 398 (INCLUDED_ONLY) 0/2691 variables, 0/3488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (OVERLAPS) 2/2693 variables, 4/3492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (INCLUDED_ONLY) 0/2693 variables, 2/3494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/2693 variables, 2/3496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/2693 variables, 0/3496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (OVERLAPS) 29/2722 variables, 14/3510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (INCLUDED_ONLY) 0/2722 variables, 14/3524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/2722 variables, 4/3528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (INCLUDED_ONLY) 0/2722 variables, 0/3528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (OVERLAPS) 26/2748 variables, 15/3543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (INCLUDED_ONLY) 0/2748 variables, 15/3558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (INCLUDED_ONLY) 0/2748 variables, 3/3561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (INCLUDED_ONLY) 0/2748 variables, 0/3561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (OVERLAPS) 2/2750 variables, 4/3565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (INCLUDED_ONLY) 0/2750 variables, 2/3567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/2750 variables, 2/3569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (INCLUDED_ONLY) 0/2750 variables, 0/3569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (OVERLAPS) 29/2779 variables, 14/3583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/2779 variables, 14/3597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/2779 variables, 4/3601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (INCLUDED_ONLY) 0/2779 variables, 0/3601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (OVERLAPS) 26/2805 variables, 15/3616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/2805 variables, 15/3631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (INCLUDED_ONLY) 0/2805 variables, 3/3634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (INCLUDED_ONLY) 0/2805 variables, 0/3634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (OVERLAPS) 2/2807 variables, 4/3638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (INCLUDED_ONLY) 0/2807 variables, 2/3640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/2807 variables, 2/3642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (INCLUDED_ONLY) 0/2807 variables, 0/3642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (OVERLAPS) 26/2833 variables, 13/3655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/2833 variables, 13/3668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (INCLUDED_ONLY) 0/2833 variables, 4/3672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (INCLUDED_ONLY) 0/2833 variables, 0/3672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (OVERLAPS) 14/2847 variables, 10/3682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/2847 variables, 10/3692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (INCLUDED_ONLY) 0/2847 variables, 3/3695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (INCLUDED_ONLY) 0/2847 variables, 1/3696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/2847 variables, 0/3696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (OVERLAPS) 1/2848 variables, 1/3697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (INCLUDED_ONLY) 0/2848 variables, 1/3698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (INCLUDED_ONLY) 0/2848 variables, 1/3699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (INCLUDED_ONLY) 0/2848 variables, 0/3699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (OVERLAPS) 2/2850 variables, 2/3701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (INCLUDED_ONLY) 0/2850 variables, 2/3703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (INCLUDED_ONLY) 0/2850 variables, 1/3704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/2850 variables, 0/3704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (OVERLAPS) 0/2850 variables, 0/3704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2850/2850 variables, and 3704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15175 ms.
Refiners :[Domain max(s): 1550/1550 constraints, Positive P Invariants (semi-flows): 530/530 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 1550/1550 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18904ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 81 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 78 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2025-06-07 05:58:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:58:47] [INFO ] Implicit Places using invariants in 859 ms returned []
[2025-06-07 05:58:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:58:49] [INFO ] Implicit Places using invariants and state equation in 2149 ms returned []
Implicit Place search using SMT with State Equation took 3011 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:58:49] [INFO ] Redundant transitions in 72 ms returned []
Running 1298 sub problems to find dead transitions.
[2025-06-07 05:58:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1550 variables, 530/2080 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1550 variables, 21/2101 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:59:18] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:59:18] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:59:19] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:59:19] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:59:19] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:59:19] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:59:19] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 22 ms to minimize.
SMT process timed out in 30468ms, After SMT, problems are : Problem set: 0 solved, 1298 unsolved
Search for dead transitions found 0 dead transitions in 30472ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33642 ms. Remains : 1550/1550 places, 1300/1300 transitions.
FORMULA ShieldPPPs-PT-050A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 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(F((p0||(F(p0) U p1))))&&F(!p2))||G(F((p0||(F(p0) U p1)))))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 39 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 05:59:20] [INFO ] Computed 551 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:59:21] [INFO ] Implicit Places using invariants in 772 ms returned []
[2025-06-07 05:59:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:59:22] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 05:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30029 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30022 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Finished structural reductions in LTL mode , in 1 iterations and 62868 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-01
Product exploration explored 100000 steps with 83 reset in 1042 ms.
Product exploration explored 100000 steps with 82 reset in 1137 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10001 steps (1 resets) in 146 ms. (68 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-07 06:00:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:00:28] [INFO ] [Real]Absence check using 551 positive place invariants in 636 ms returned sat
[2025-06-07 06:00:36] [INFO ] [Real]Absence check using state equation in 7686 ms returned sat
[2025-06-07 06:00:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:00:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 595 ms returned sat
[2025-06-07 06:00:46] [INFO ] [Nat]Absence check using state equation in 8539 ms returned sat
[2025-06-07 06:00:46] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 55 ms.
[2025-06-07 06:00:51] [INFO ] Added : 75 causal constraints over 15 iterations in 4675 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 1553 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 37 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:00:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:00:51] [INFO ] Implicit Places using invariants in 763 ms returned []
[2025-06-07 06:00:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:00:53] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30020 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30026 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60350ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Finished structural reductions in LTL mode , in 1 iterations and 62811 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10799 steps (1 resets) in 159 ms. (67 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-07 06:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:01:56] [INFO ] [Real]Absence check using 551 positive place invariants in 608 ms returned sat
[2025-06-07 06:02:03] [INFO ] [Real]Absence check using state equation in 7396 ms returned sat
[2025-06-07 06:02:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:02:05] [INFO ] [Nat]Absence check using 551 positive place invariants in 631 ms returned sat
[2025-06-07 06:02:14] [INFO ] [Nat]Absence check using state equation in 8777 ms returned sat
[2025-06-07 06:02:14] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-07 06:02:18] [INFO ] Added : 70 causal constraints over 14 iterations in 4337 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 89811 steps with 72 reset in 819 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-01 finished in 179491 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 ((!p0&&X(X(X(p0))))||X(X(X(G(p0)))))))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 34 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:02:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:02:20] [INFO ] Implicit Places using invariants in 760 ms returned []
[2025-06-07 06:02:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:02:22] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:02:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30022 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30023 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Finished structural reductions in LTL mode , in 1 iterations and 62792 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-02 finished in 62976 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&&F(G((G(p1) U X(X((X(p3)&&p2)))))))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 35 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:03:23] [INFO ] Implicit Places using invariants in 737 ms returned []
[2025-06-07 06:03:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:03:25] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:03:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30027 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30032 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Finished structural reductions in LTL mode , in 1 iterations and 62767 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 1118 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-03
Stuttering criterion allowed to conclude after 9096 steps with 3 reset in 105 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-03 finished in 64047 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(X(p0))&&F(p1)))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 37 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:04:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:04:27] [INFO ] Implicit Places using invariants in 748 ms returned []
[2025-06-07 06:04:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:04:29] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30022 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30026 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Finished structural reductions in LTL mode , in 1 iterations and 62764 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-05
Product exploration explored 100000 steps with 84 reset in 1000 ms.
Product exploration explored 100000 steps with 90 reset in 1190 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
RANDOM walk for 10268 steps (0 resets) in 218 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
[2025-06-07 06:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:05:34] [INFO ] [Real]Absence check using 551 positive place invariants in 589 ms returned sat
[2025-06-07 06:05:43] [INFO ] [Real]Absence check using state equation in 8594 ms returned sat
[2025-06-07 06:05:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:05:45] [INFO ] [Nat]Absence check using 551 positive place invariants in 608 ms returned sat
[2025-06-07 06:05:54] [INFO ] [Nat]Absence check using state equation in 9637 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:05:54] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:05:55] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:05:55] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:05:55] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:05:55] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:05:55] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 7 ms to minimize.
[2025-06-07 06:05:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1073 ms
[2025-06-07 06:05:56] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 58 ms.
[2025-06-07 06:05:58] [INFO ] Added : 95 causal constraints over 19 iterations in 2574 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 38 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:05:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:05:59] [INFO ] Implicit Places using invariants in 735 ms returned []
[2025-06-07 06:05:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:06:00] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30030 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30027 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Finished structural reductions in LTL mode , in 1 iterations and 62715 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
RANDOM walk for 9700 steps (0 resets) in 120 ms. (80 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
[2025-06-07 06:07:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:07:03] [INFO ] [Real]Absence check using 551 positive place invariants in 594 ms returned sat
[2025-06-07 06:07:12] [INFO ] [Real]Absence check using state equation in 8526 ms returned sat
[2025-06-07 06:07:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:07:14] [INFO ] [Nat]Absence check using 551 positive place invariants in 622 ms returned sat
[2025-06-07 06:07:23] [INFO ] [Nat]Absence check using state equation in 9477 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:07:23] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:07:23] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:07:24] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:07:24] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:07:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:07:24] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 8 ms to minimize.
[2025-06-07 06:07:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1061 ms
[2025-06-07 06:07:24] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 58 ms.
[2025-06-07 06:07:27] [INFO ] Added : 100 causal constraints over 20 iterations in 2714 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Product exploration explored 100000 steps with 70 reset in 940 ms.
Product exploration explored 100000 steps with 76 reset in 1153 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 307 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:07:30] [INFO ] Redundant transitions in 71 ms returned []
Running 1302 sub problems to find dead transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 06:07:30] [INFO ] Computed 551 invariants in 9 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30025 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30024 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60367ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60754 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin13836857373791572188
[2025-06-07 06:08:31] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13836857373791572188
Running compilation step : cd /tmp/ltsmin13836857373791572188;'/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 2613 ms.
Running link step : cd /tmp/ltsmin13836857373791572188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13836857373791572188;'/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/stateBased5762700078544327598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 42 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 06:08:46] [INFO ] Computed 551 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:08:46] [INFO ] Implicit Places using invariants in 743 ms returned []
[2025-06-07 06:08:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:08:48] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 timeout
1.0)
(s438 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30026 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30028 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Finished structural reductions in LTL mode , in 1 iterations and 62715 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin846596596723314490
[2025-06-07 06:09:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin846596596723314490
Running compilation step : cd /tmp/ltsmin846596596723314490;'/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 2473 ms.
Running link step : cd /tmp/ltsmin846596596723314490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin846596596723314490;'/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/stateBased4316343851453913534.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 06:10:04] [INFO ] Flatten gal took : 192 ms
[2025-06-07 06:10:04] [INFO ] Flatten gal took : 70 ms
[2025-06-07 06:10:04] [INFO ] Time to serialize gal into /tmp/LTL16218641021837340903.gal : 21 ms
[2025-06-07 06:10:04] [INFO ] Time to serialize properties into /tmp/LTL14945044517700056262.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/LTL16218641021837340903.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17002261394239763.hoa' '-atoms' '/tmp/LTL14945044517700056262.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/LTL14945044517700056262.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17002261394239763.hoa
Detected timeout of ITS tools.
[2025-06-07 06:10:19] [INFO ] Flatten gal took : 60 ms
[2025-06-07 06:10:19] [INFO ] Flatten gal took : 54 ms
[2025-06-07 06:10:19] [INFO ] Time to serialize gal into /tmp/LTL6568508028292386773.gal : 7 ms
[2025-06-07 06:10:19] [INFO ] Time to serialize properties into /tmp/LTL8370418538417827350.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/LTL6568508028292386773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8370418538417827350.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 : !((X(X((X(X("((p1194==0)||(p1211==0))")))&&(F("(p307==1)"))))))
Formula 0 simplified : XX(XX!"((p1194==0)||(p1211==0))" | G!"(p307==1)")
Detected timeout of ITS tools.
[2025-06-07 06:10:34] [INFO ] Flatten gal took : 50 ms
[2025-06-07 06:10:34] [INFO ] Applying decomposition
[2025-06-07 06:10:34] [INFO ] Flatten gal took : 52 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/graph16927962137335781285.txt' '-o' '/tmp/graph16927962137335781285.bin' '-w' '/tmp/graph16927962137335781285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16927962137335781285.bin' '-l' '-1' '-v' '-w' '/tmp/graph16927962137335781285.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:10:34] [INFO ] Decomposing Gal with order
[2025-06-07 06:10:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:10:35] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 06:10:35] [INFO ] Flatten gal took : 129 ms
[2025-06-07 06:10:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 202 ms.
[2025-06-07 06:10:35] [INFO ] Time to serialize gal into /tmp/LTL12489226529479342811.gal : 18 ms
[2025-06-07 06:10:35] [INFO ] Time to serialize properties into /tmp/LTL923555385230830847.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/LTL12489226529479342811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL923555385230830847.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X("((i38.u424.p1194==0)||(i38.u429.p1211==0))")))&&(F("(i9.u109.p307==1)"))))))
Formula 0 simplified : XX(XX!"((i38.u424.p1194==0)||(i38.u429.p1211==0))" | G!"(i9.u109.p307==1)")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-05 finished in 383505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1)) U X((p2||(F(p0) U p3)))))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 40 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:10:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:10:51] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-07 06:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:10:52] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 2392 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30025 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30024 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Finished structural reductions in LTL mode , in 1 iterations and 62791 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 507 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-06
Product exploration explored 100000 steps with 39 reset in 985 ms.
Product exploration explored 100000 steps with 40 reset in 1190 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 36 factoid took 186 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 22 states, 80 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 973 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (10 resets) in 697 ms. (57 steps per ms) remains 11/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
[2025-06-07 06:11:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 19/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1527/1553 variables, 544/577 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1527/2104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2856/2856 variables, and 3657 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1575 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1553/1553 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 19/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1527/1553 variables, 544/577 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1527/2104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2856 variables, 11/3668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2856 variables, 0/3668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 1)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 1)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 1)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 1)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 1)
(s361 1)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 1)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 1)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 1)
(s459 0)
(s460 1)
(s461 0)
(s462 0)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 1)
(s475 0)
(s476 0)
(s477 1)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 1)
(s484 0)
(s485 0)
(s486 0)
(s487 1)
(s488 0)
(s489 1)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 0)
(s503 1)
(s504 1)
(s505 0)
(s506 0)
(s507 0)
(s508 1)
(s509 0)
(s510 1)
(s511 0)
(s512 0)
(s513 1)
(s514 1)
(s515 0)
(s516 1)
(s517 0)
(s518 0)
(s519 0)
(s520 1)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 1)
(s532 0)
(s533 1)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 1)
(s542 0)
(s543 0)
(s544 1)
(s545 0)
(s546 1)
(s547 1)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 0)
(s554 1)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 1)
(s563 0)
(s564 1)
(s565 0)
(s566 1)
(s567 0)
(s568 0)
(s569 1)
(s570 0)
(s571 1)
(s572 0)
(s573 0)
(s574 0)
(s575 1)
(s576 1)
(s577 0)
(s578 1)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 0)
(s585 1)
(s586 0)
(s587 0)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 1)
(s597 0)
(s598 1)
(s599 0)
(s600 1)
(s601 0)
(s602 1)
(s603 0)
(s604 0)
(s605 0)
(s606 1)
(s607 0)
(s608 1)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 0)
(s616 1)
(s617 0)
(s618 0)
(s619 1)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 1)
(s625 0)
(s626 0)
(s627 1)
(s628 0)
(s629 1)
(s630 0)
(s631 0)
(s632 1)
(s633 0)
(s634 1)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 0)
(s641 0)
(s642 1)
(s643 0)
(s644 1)
(s645 0)
(s646 1)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 1)
(s652 0)
(s653 0)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 1)
(s659 1)
(s660 0)
(s661 0)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 1)
(s670 0)
(s671 0)
(s672 1)
(s673 0)
(s674 0)
(s675 1)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 1)
(s681 1)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 0)
(s694 1)
(s695 0)
(s696 1)
(s697 0)
(s698 1)
(s699 0)
(s700 1)
(s701 0)
(s702 0)
(s703 0)
(s704 1)
(s705 0)
(s706 0)
(s707 1)
(s708 1)
(s709 0)
(s710 0)
(s711 0)
(s712 1)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 1)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 1)
(s723 0)
(s724 0)
(s725 1)
(s726 0)
(s727 1)
(s728 0)
(s729 0)
(s730 1)
(s731 0)
(s732 1)
(s733 1)
(s734 0)
(s735 0)
(s736 0)
(s737 1)
(s738 0)
(s739 0)
(s740 0)
(s741 1)
(s742 0)
(s743 1)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 1)
(s749 0)
(s750 0)
(s751 1)
(s752 0)
(s753 1)
(s754 0)
(s755 0)
(s756 1)
(s757 0)
(s758 1)
(s759 0)
(s760 0)
(s761 1)
(s762 0)
(s763 1)
(s764 0)
(s765 1)
(s766 0)
(s767 0)
(s768 1)
(s769 0)
(s770 1)
(s771 0)
(s772 0)
(s773 0)
(s774 1)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 1)
(s780 0)
(s781 0)
(s782 1)
(s783 0)
(s784 1)
(s785 0)
(s786 1)
(s787 0)
(s788 0)
(s789 1)
(s790 0)
(s791 1)
(s792 0)
(s793 1)
(s794 0)
(s795 0)
(s796 0)
(s797 1)
(s798 0)
(s799 1)
(s800 0)
(s801 0)
(s802 0)
(s803 1)
(s804 0)
(s805 1)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 1)
(s811 0)
(s812 1)
(s813 0)
(s814 0)
(s815 1)
(s816 0)
(s817 0)
(s818 1)
(s819 0)
(s820 1)
(s821 0)
(s822 1)
(s823 0)
(s824 1)
(s825 0)
(s826 0)
(s827 1)
(s828 0)
(s829 0)
(s830 1)
(s831 0)
(s832 0)
(s833 0)
(s834 1)
(s835 0)
(s836 1)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 1)
(s842 0)
(s843 0)
(s844 1)
(s845 0)
(s846 1)
(s847 0)
(s848 0)
(s849 1)
(s850 0)
(s851 1)
(s852 0)
(s853 0)
(s854 1)
(s855 1)
(s856 0)
(s857 0)
(s858 1)
(s859 0)
(s860 0)
(s861 1)
(s862 0)
(s863 1)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 1)
(s870 0)
(s871 0)
(s872 1)
(s873 0)
(s874 1)
(s875 0)
(s876 0)
(s877 1)
(s878 0)
(s879 1)
(s880 0)
(s881 0)
(s882 1)
(s883 0)
(s884 0)
(s885 1)
(s886 0)
(s887 1)
(s888 1)
(s889 0)
(s890 0)
(s891 0)
(s892 1)
(s893 0)
(s894 0)
(s895 0)
(s896 1)
(s897 0)
(s898 0)
(s899 0)
(s900 1)
(s901 0)
(s902 0)
(s903 1)
(s904 0)
(s905 1)
(s906 0)
(s907 0)
(s908 1)
(s909 0)
(s910 1)
(s911 0)
(s912 0)
(s913 1)
(s914 0)
(s915 0)
(s916 1)
(s917 0)
(s918 1)
(s919 1)
(s920 0)
(s921 0)
(s922 0)
(s923 1)
(s924 0)
(s925 1)
(s926 0)
(s927 0)
(s928 0)
(s929 1)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 1)
(s935 0)
(s936 0)
(s937 1)
(s938 0)
(s939 1)
(s940 0)
(s941 0)
(s942 1)
(s943 0)
(s944 1)
(s945 0)
(s946 0)
(s947 1)
(s948 0)
(s949 1)
(s950 0)
(s951 0)
(s952 1)
(s953 0)
(s954 1)
(s955 0)
(s956 0)
(s957 1)
(s958 0)
(s959 0)
(s960 0)
(s961 1)
(s962 0)
(s963 0)
(s964 0)
(s965 1)
(s966 0)
(s967 0)
(s968 1)
(s969 0)
(s970 1)
(s971 0)
(s972 0)
(s973 1)
(s974 0)
(s975 1)
(s976 0)
(s977 0)
(s978 1)
(s979 0)
(s980 1)
(s981 0)
(s982 0)
(s983 1)
(s984 0)
(s985 1)
(s986 0)
(s987 0)
(s988 1)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 1)
(s994 0)
(s995 0)
(s996 1)
(s997 0)
(s998 0)
(s999 1)
(s1000 0)
(s1001 1)
(s1002 0)
(s1003 1)
(s1004 0)
(s1005 0)
(s1006 1)
(s1007 0)
(s1008 0)
(s1009 1)
(s1010 0)
(s1011 1)
(s1012 0)
(s1013 0)
(s1014 1)
(s1015 0)
(s1016 1)
(s1017 0)
(s1018 0)
(s1019 1)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 1)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 1)
(s1028 0)
(s1029 0)
(s1030 1)
(s1031 0)
(s1032 1)
(s1033 0)
(s1034 0)
(s1035 1)
(s1036 0)
(s1037 1)
(s1038 0)
(s1039 0)
(s1040 1)
(s1041 1)
(s1042 0)
(s1043 0)
(s1044 1)
(s1045 0)
(s1046 0)
(s1047 1)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 1)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 1)
(s1056 0)
(s1057 0)
(s1058 1)
(s1059 0)
(s1060 0)
(s1061 1)
(s1062 0)
(s1063 1)
(s1064 0)
(s1065 0)
(s1066 1)
(s1067 0)
(s1068 1)
(s1069 0)
(s1070 0)
(s1071 1)
(s1072 0)
(s1073 1)
(s1074 1)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 1)
(s1079 0)
(s1080 1)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 1)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 1)
(s1090 0)
(s1091 0)
(s1092 1)
(s1093 0)
(s1094 1)
(s1095 0)
(s1096 0)
(s1097 1)
(s1098 0)
(s1099 1)
(s1100 0)
(s1101 0)
(s1102 1)
(s1103 0)
(s1104 1)
(s1105 0)
(s1106 0)
(s1107 1)
(s1108 0)
(s1109 1)
(s1110 0)
(s1111 1)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 1)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 1)
(s1121 0)
(s1122 0)
(s1123 1)
(s1124 0)
(s1125 1)
(s1126 0)
(s1127 0)
(s1128 1)
(s1129 0)
(s1130 1)
(s1131 0)
(s1132 0)
(s1133 1)
(s1134 0)
(s1135 1)
(s1136 0)
(s1137 0)
(s1138 1)
(s1139 0)
(s1140 1)
(s1141 0)
(s1142 1)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 1)
(s1149 0)
(s1150 0)
(s1151 1)
(s1152 0)
(s1153 0)
(s1154 1)
(s1155 1)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 1)
(s1160 0)
(s1161 1)
(s1162 0)
(s1163 0)
(s1164 1)
(s1165 1)
(s1166 0)
(s1167 1)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 1)
(s1172 0)
(s1173 1)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 1)
(s1180 0)
(s1181 0)
(s1182 1)
(s1183 0)
(s1184 0)
(s1185 1)
(s1186 0)
(s1187 1)
(s1188 0)
(s1189 0)
(s1190 1)
(s1191 0)
(s1192 1)
(s1193 0)
(s1194 0)
(s1195 1)
(s1196 1)
(s1197 0)
(s1198 1)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 1)
(s1203 0)
(s1204 1)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 1)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 1)
(s1214 0)
(s1215 1)
(s1216 0)
(s1217 0)
(s1218 1)
(s1219 0)
(s1220 1)
(s1221 0)
(s1222 0)
(s1223 1)
(s1224 0)
(s1225 0)
(s1226 1)
(s1227 0)
(s1228 1)
(s1229 1)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 1)
(s1234 0)
(s1235 0)
(s1236 1)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 1)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 1)
(s1245 0)
(s1246 1)
(s1247 0)
(s1248 0)
(s1249 1)
(s1250 0)
(s1251 1)
(s1252 0)
(s1253 0)
(s1254 1)
(s1255 0)
(s1256 0)
(s1257 1)
(s1258 0)
(s1259 1)
(s1260 1)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 1)
(s1265 0)
(s1266 1)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 1)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 1)
(s1276 0)
(s1277 0)
(s1278 1)
(s1279 0)
(s1280 1)
(s1281 0)
(s1282 0)
(s1283 1)
(s1284 0)
(s1285 1)
(s1286 0)
(s1287 0)
(s1288 1)
(s1289 0)
(s1290 1)
(s1291 0)
(s1292 0)
(s1293 1)
(s1294 0)
(s1295 1)
(s1296 0)
(s1297 0)
(s1298 1)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 1)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 1)
(s1307 0)
(s1308 0)
(s1309 1)
(s1310 0)
(s1311 1)
(s1312 0)
(s1313 0)
(s1314 1)
(s1315 0)
(s1316 1)
(s1317 0)
(s1318 0)
(s1319 1)
(s1320 1)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 1)
(s1325 0)
(s1326 1)
(s1327 0)
(s1328 1)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 1)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 1)
(s1338 0)
(s1339 0)
(s1340 1)
(s1341 0)
(s1342 1)
(s1343 0)
(s1344 1)
(s1345 0)
(s1346 0)
(s1347 1)
(s1348 0)
(s1349 1)
(s1350 0)
(s1351 1)
(s1352 0)
(s1353 1)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 1)
(s1358 0)
(s1359 1)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 1)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 1)
(s1369 0)
(s1370 1)
(s1371 0)
(s1372 0)
(s1373 1)
(s1374 0)
(s1375 1)
(s1376 0)
(s1377 0)
(s1378 1)
(s1379 0)
(s1380 0)
(s1381 1)
(s1382 0)
(s1383 1)
(s1384 1)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 1)
(s1389 0)
(s1390 1)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 1)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 1)
(s1400 0)
(s1401 0)
(s1402 1)
(s1403 0)
(s1404 1)
(s1405 0)
(s1406 0)
(s1407 1)
(s1408 0)
(s1409 1)
(s1410 0)
(s1411 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2856/2856 variables, and 3668 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5016 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1553/1553 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6608ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 444 times.
Drop transitions (Partial Free agglomeration) removed 444 transitions
Iterating global reduction 0 with 444 rules applied. Total rules applied 448 place count 1551 transition count 1301
Applied a total of 448 rules in 129 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 1551/1553 places, 1301/1303 transitions.
RANDOM walk for 40000 steps (8 resets) in 1070 ms. (37 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 295 ms. (135 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 121588 steps, run timeout after 3003 ms. (steps per millisecond=40 ) properties seen :0 out of 10
Probabilistic random walk after 121588 steps, saw 120309 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 1301 rows 1551 cols
[2025-06-07 06:12:09] [INFO ] Computed 551 invariants in 66 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 19/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1465/1491 variables, 514/547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1491 variables, 1465/2012 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1491 variables, 0/2012 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 60/1551 variables, 30/2042 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1551 variables, 60/2102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1551 variables, 0/2102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1301/2852 variables, 1551/3653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2852 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2852 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2852/2852 variables, and 3653 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1776 ms.
Refiners :[Domain max(s): 1551/1551 constraints, Positive P Invariants (semi-flows): 521/521 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1551/1551 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 19/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1465/1491 variables, 514/547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1491 variables, 1465/2012 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:11] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:11] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:11] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:11] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:11] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:11] [INFO ] Deduced a trap composed of 5 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-07 06:12:11] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1491 variables, 7/2019 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1491 variables, 0/2019 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 60/1551 variables, 30/2049 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1551 variables, 60/2109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:12] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1551 variables, 1/2110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1551 variables, 0/2110 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1301/2852 variables, 1551/3661 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2852 variables, 10/3671 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:32] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:33] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:33] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:34] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:34] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:34] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:35] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2852 variables, 7/3678 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:12:49] [INFO ] Deduced a trap along path composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2852 variables, 1/3679 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2852/2852 variables, and 3679 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45025 ms.
Refiners :[Domain max(s): 1551/1551 constraints, Positive P Invariants (semi-flows): 521/521 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1551/1551 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46892ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 42 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1551/1551 places, 1301/1301 transitions.
RANDOM walk for 40000 steps (8 resets) in 852 ms. (46 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 327 ms. (121 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 118882 steps, run timeout after 3002 ms. (steps per millisecond=39 ) properties seen :0 out of 10
Probabilistic random walk after 118882 steps, saw 117626 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-07 06:12:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 19/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1465/1491 variables, 514/547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1491 variables, 1465/2012 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1491 variables, 0/2012 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 60/1551 variables, 30/2042 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1551 variables, 60/2102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1551 variables, 0/2102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1301/2852 variables, 1551/3653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2852 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2852 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2852/2852 variables, and 3653 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1730 ms.
Refiners :[Domain max(s): 1551/1551 constraints, Positive P Invariants (semi-flows): 521/521 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1551/1551 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 19/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:01] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:01] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1465/1491 variables, 514/549 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1491 variables, 1465/2014 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:02] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:02] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:02] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:02] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:02] [INFO ] Deduced a trap composed of 5 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-07 06:13:02] [INFO ] Deduced a trap composed of 5 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-07 06:13:02] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:02] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:02] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:02] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1491 variables, 10/2024 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1491 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 60/1551 variables, 30/2054 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1551 variables, 60/2114 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:03] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:03] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:03] [INFO ] Deduced a trap composed of 5 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-07 06:13:03] [INFO ] Deduced a trap composed of 5 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-07 06:13:03] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1551 variables, 5/2119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1551 variables, 0/2119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 1301/2852 variables, 1551/3670 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2852 variables, 10/3680 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:13] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:14] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:14] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:14] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:14] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:14] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:14] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:15] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:15] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2852 variables, 9/3689 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:18] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2852 variables, 1/3690 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:21] [INFO ] Deduced a trap composed of 11 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-07 06:13:21] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2852 variables, 2/3692 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:13:23] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2852 variables, 1/3693 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2852 variables, 0/3693 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/2852 variables, 0/3693 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2852/2852 variables, and 3693 constraints, problems are : Problem set: 0 solved, 10 unsolved in 32474 ms.
Refiners :[Domain max(s): 1551/1551 constraints, Positive P Invariants (semi-flows): 521/521 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1551/1551 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34222ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 34870 ms.
Support contains 7 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 42 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 42 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2025-06-07 06:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:14:10] [INFO ] Implicit Places using invariants in 882 ms returned []
[2025-06-07 06:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:14:12] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 3180 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:14:12] [INFO ] Redundant transitions in 21 ms returned []
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1550 variables, 30/1580 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/2852 variables, and 1580 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30018 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/521 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1550 variables, 30/1580 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
(s1219 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1580 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30035 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/521 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60550ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63805 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3 p1))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p3) p1))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p3 p1))), (F p0), (F (NOT (OR (NOT p0) p2 p3 p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 (NOT p2) p3 p1))), (F (NOT (OR (NOT p0) p3))), (F p2), (F (NOT (OR p3 (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p1)]
Knowledge based reduction with 36 factoid took 1015 ms. Reduced automaton from 22 states, 80 edges and 4 AP (stutter insensitive) to 22 states, 80 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1033 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 991 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 06:15:15] [INFO ] Computed 551 invariants in 6 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (AND (NOT p1) (NOT p3))
[2025-06-07 06:15:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:15:19] [INFO ] [Real]Absence check using 551 positive place invariants in 1454 ms returned sat
[2025-06-07 06:15:32] [INFO ] [Real]Absence check using state equation in 12397 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
[2025-06-07 06:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:15:33] [INFO ] [Real]Absence check using 551 positive place invariants in 623 ms returned sat
[2025-06-07 06:15:41] [INFO ] [Real]Absence check using state equation in 7749 ms returned sat
[2025-06-07 06:15:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:15:43] [INFO ] [Nat]Absence check using 551 positive place invariants in 629 ms returned sat
[2025-06-07 06:15:51] [INFO ] [Nat]Absence check using state equation in 8399 ms returned sat
[2025-06-07 06:15:52] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 54 ms.
[2025-06-07 06:15:56] [INFO ] Added : 95 causal constraints over 19 iterations in 4749 ms. Result :unknown
Could not prove EG (AND (NOT p2) (NOT p3))
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3 p1))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p3) p1))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p3 p1))), (F p0), (F (NOT (OR (NOT p0) p2 p3 p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 (NOT p2) p3 p1))), (F (NOT (OR (NOT p0) p3))), (F p2), (F (NOT (OR p3 (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p1), (G (AND (NOT p1) (NOT p3)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p3)))
Knowledge based reduction with 36 factoid took 1045 ms. Reduced automaton from 22 states, 80 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050A-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050A-LTLFireability-06 finished in 307377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 34 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:15:58] [INFO ] Implicit Places using invariants in 739 ms returned []
[2025-06-07 06:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:16:00] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:16:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30025 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30023 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in LTL mode , in 1 iterations and 62826 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3004 steps with 0 reset in 38 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-07 finished in 63029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p1||(p2&&F(p3))))&&p0))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 33 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:17:01] [INFO ] Implicit Places using invariants in 759 ms returned []
[2025-06-07 06:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:17:03] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2379 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:17:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30025 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30032 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60383ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Finished structural reductions in LTL mode , in 1 iterations and 62800 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-08
Product exploration explored 100000 steps with 768 reset in 868 ms.
Product exploration explored 100000 steps with 766 reset in 1024 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 104 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (9 resets) in 531 ms. (75 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 4/4 properties
[2025-06-07 06:18:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1539/1553 variables, 546/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1539/2104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2856/2856 variables, and 3657 constraints, problems are : Problem set: 0 solved, 4 unsolved in 901 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1553/1553 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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
Problem apf6 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 5/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1539/1553 variables, 546/565 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1539/2104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2856 variables, 2/3659 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:18:08] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:18:08] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2856 variables, 2/3661 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2856 variables, 0/3661 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2856 variables, 0/3661 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2856/2856 variables, and 3661 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2089 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1553/1553 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3001ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 240570 steps, including 412 resets, run visited all 2 properties in 3088 ms. (steps per millisecond=77 )
Parikh walk visited 2 properties in 6292 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR (NOT p0) p3))), (F (NOT p2)), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 p2))), (F p1)]
Knowledge based reduction with 12 factoid took 419 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
[2025-06-07 06:18:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:18:18] [INFO ] [Real]Absence check using 551 positive place invariants in 685 ms returned sat
[2025-06-07 06:18:26] [INFO ] [Real]Absence check using state equation in 8282 ms returned sat
[2025-06-07 06:18:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:18:29] [INFO ] [Nat]Absence check using 551 positive place invariants in 1233 ms returned sat
[2025-06-07 06:18:41] [INFO ] [Nat]Absence check using state equation in 12656 ms returned unknown
Could not prove EG (NOT p0)
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 34 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:18:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:18:42] [INFO ] Implicit Places using invariants in 747 ms returned []
[2025-06-07 06:18:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:18:44] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2391 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:18:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30023 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30026 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Finished structural reductions in LTL mode , in 1 iterations and 62772 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (9 resets) in 552 ms. (72 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
[2025-06-07 06:19:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1539/1553 variables, 546/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1539/2104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2856 variables, 1553/3657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2856 variables, 0/3657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2856/2856 variables, and 3657 constraints, problems are : Problem set: 0 solved, 2 unsolved in 729 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1553/1553 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1539/1553 variables, 546/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1539/2104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:19:46] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:19:46] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 2/2106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1553 variables, 0/2106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1303/2856 variables, 1553/3659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2856 variables, 2/3661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2856 variables, 0/3661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2856 variables, 0/3661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2856/2856 variables, and 3661 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1839 ms.
Refiners :[Domain max(s): 1553/1553 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1553/1553 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2576ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 265790 steps, including 475 resets, run visited all 2 properties in 3429 ms. (steps per millisecond=77 )
Parikh walk visited 2 properties in 6964 ms.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p3 p0))), (F p0), (F (NOT (OR p1 p2 p3))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p3)), (F p1), (F (NOT (OR p3 (NOT p0))))]
Knowledge based reduction with 8 factoid took 337 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
[2025-06-07 06:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:19:57] [INFO ] [Real]Absence check using 551 positive place invariants in 692 ms returned sat
[2025-06-07 06:20:05] [INFO ] [Real]Absence check using state equation in 8293 ms returned sat
[2025-06-07 06:20:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:20:08] [INFO ] [Nat]Absence check using 551 positive place invariants in 1252 ms returned sat
[2025-06-07 06:20:20] [INFO ] [Nat]Absence check using state equation in 12614 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 770 reset in 828 ms.
Product exploration explored 100000 steps with 746 reset in 1008 ms.
Built C files in :
/tmp/ltsmin7899215713736989996
[2025-06-07 06:20:22] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7899215713736989996
Running compilation step : cd /tmp/ltsmin7899215713736989996;'/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 2491 ms.
Running link step : cd /tmp/ltsmin7899215713736989996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7899215713736989996;'/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/stateBased16455173441452946780.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 39 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:20:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:20:38] [INFO ] Implicit Places using invariants in 738 ms returned []
[2025-06-07 06:20:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:20:40] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30019 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30029 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Finished structural reductions in LTL mode , in 1 iterations and 62766 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin14398571742654288609
[2025-06-07 06:21:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14398571742654288609
Running compilation step : cd /tmp/ltsmin14398571742654288609;'/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 2491 ms.
Running link step : cd /tmp/ltsmin14398571742654288609;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14398571742654288609;'/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/stateBased11258961357489851383.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 06:21:55] [INFO ] Flatten gal took : 48 ms
[2025-06-07 06:21:56] [INFO ] Flatten gal took : 60 ms
[2025-06-07 06:21:56] [INFO ] Time to serialize gal into /tmp/LTL792500924840504013.gal : 8 ms
[2025-06-07 06:21:56] [INFO ] Time to serialize properties into /tmp/LTL10003385432583660490.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/LTL792500924840504013.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17858355217745293815.hoa' '-atoms' '/tmp/LTL10003385432583660490.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/LTL10003385432583660490.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17858355217745293815.hoa
Detected timeout of ITS tools.
[2025-06-07 06:22:11] [INFO ] Flatten gal took : 45 ms
[2025-06-07 06:22:11] [INFO ] Flatten gal took : 45 ms
[2025-06-07 06:22:11] [INFO ] Time to serialize gal into /tmp/LTL3233594561956228566.gal : 8 ms
[2025-06-07 06:22:11] [INFO ] Time to serialize properties into /tmp/LTL12759736680863441990.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/LTL3233594561956228566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12759736680863441990.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p1399==1)&&(p1420==1))")&&(X(("((p105==1)&&(p107==1))")||(("((p1399==0)||(p1420==0))")&&(F("(p393==0)")))))))))
Formula 0 simplified : XG(!"((p1399==1)&&(p1420==1))" | X(!"((p105==1)&&(p107==1))" & (!"((p1399==0)||(p1420==0))" | G!"(p393==0)")))
Detected timeout of ITS tools.
[2025-06-07 06:22:26] [INFO ] Flatten gal took : 43 ms
[2025-06-07 06:22:26] [INFO ] Applying decomposition
[2025-06-07 06:22:26] [INFO ] Flatten gal took : 44 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/graph5853306609628310127.txt' '-o' '/tmp/graph5853306609628310127.bin' '-w' '/tmp/graph5853306609628310127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5853306609628310127.bin' '-l' '-1' '-v' '-w' '/tmp/graph5853306609628310127.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:22:26] [INFO ] Decomposing Gal with order
[2025-06-07 06:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:22:26] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 06:22:26] [INFO ] Flatten gal took : 75 ms
[2025-06-07 06:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 51 ms.
[2025-06-07 06:22:26] [INFO ] Time to serialize gal into /tmp/LTL8091275802614946360.gal : 15 ms
[2025-06-07 06:22:26] [INFO ] Time to serialize properties into /tmp/LTL5888644838935333708.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/LTL8091275802614946360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5888644838935333708.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("((i45.i0.u496.p1399==1)&&(i45.i0.u504.p1420==1))")&&(X(("((i3.i2.u37.p105==1)&&(i3.i1.u38.p107==1))")||(("((i45.i0.u496.p1399...223
Formula 0 simplified : XG(!"((i45.i0.u496.p1399==1)&&(i45.i0.u504.p1420==1))" | X(!"((i3.i2.u37.p105==1)&&(i3.i1.u38.p107==1))" & (!"((i45.i0.u496.p1399==0...213
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-08 finished in 340924 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(p0) U p1))&&(p2||F(p3)))))'
Support contains 8 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 28 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:22:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:22:42] [INFO ] Implicit Places using invariants in 741 ms returned []
[2025-06-07 06:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:22:44] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:22:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30022 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30020 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Finished structural reductions in LTL mode , in 1 iterations and 62753 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-09
Entered a terminal (fully accepting) state of product in 447 steps with 1 reset in 8 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-09 finished in 63019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 82 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2025-06-07 06:23:44] [INFO ] Computed 551 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:23:45] [INFO ] Implicit Places using invariants in 754 ms returned []
[2025-06-07 06:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:23:47] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2407 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:23:47] [INFO ] Redundant transitions in 23 ms returned []
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:23:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 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 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30023 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30024 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62868 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-10
Stuttering criterion allowed to conclude after 3221 steps with 0 reset in 39 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-10 finished in 62976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 76 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
[2025-06-07 06:24:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:24:48] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-07 06:24:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:24:50] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2370 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:24:50] [INFO ] Redundant transitions in 24 ms returned []
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:24:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 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 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30020 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30021 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62826 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-11
Product exploration explored 100000 steps with 39 reset in 985 ms.
Product exploration explored 100000 steps with 39 reset in 1205 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 9935 steps (0 resets) in 121 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2025-06-07 06:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:25:55] [INFO ] [Real]Absence check using 551 positive place invariants in 736 ms returned sat
[2025-06-07 06:26:04] [INFO ] [Real]Absence check using state equation in 9234 ms returned sat
[2025-06-07 06:26:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:26:06] [INFO ] [Nat]Absence check using 551 positive place invariants in 649 ms returned sat
[2025-06-07 06:26:15] [INFO ] [Nat]Absence check using state equation in 9154 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:26:15] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
[2025-06-07 06:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-07 06:26:15] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 63 ms.
[2025-06-07 06:26:19] [INFO ] Added : 100 causal constraints over 20 iterations in 3806 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 49 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2025-06-07 06:26:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:26:20] [INFO ] Implicit Places using invariants in 751 ms returned []
[2025-06-07 06:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:26:21] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:26:21] [INFO ] Redundant transitions in 25 ms returned []
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30024 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 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 Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30024 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62842 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 9720 steps (0 resets) in 144 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2025-06-07 06:27:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:27:24] [INFO ] [Real]Absence check using 551 positive place invariants in 791 ms returned sat
[2025-06-07 06:27:33] [INFO ] [Real]Absence check using state equation in 9559 ms returned sat
[2025-06-07 06:27:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:27:35] [INFO ] [Nat]Absence check using 551 positive place invariants in 643 ms returned sat
[2025-06-07 06:27:44] [INFO ] [Nat]Absence check using state equation in 8999 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:27:44] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
[2025-06-07 06:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2025-06-07 06:27:45] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 57 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 980 ms.
Product exploration explored 100000 steps with 39 reset in 1180 ms.
Built C files in :
/tmp/ltsmin1999778481915928553
[2025-06-07 06:27:51] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2025-06-07 06:27:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:27:51] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2025-06-07 06:27:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:27:51] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2025-06-07 06:27:51] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:27:51] [INFO ] Built C files in 336ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1999778481915928553
Running compilation step : cd /tmp/ltsmin1999778481915928553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1999778481915928553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1999778481915928553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 37 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2025-06-07 06:27:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:27:55] [INFO ] Implicit Places using invariants in 730 ms returned []
[2025-06-07 06:27:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:27:57] [INFO ] Implicit Places using invariants and state equation in 1642 ms returned []
Implicit Place search using SMT with State Equation took 2374 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:27:57] [INFO ] Redundant transitions in 24 ms returned []
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:27:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30022 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30023 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62780 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin10817351177844578298
[2025-06-07 06:28:57] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2025-06-07 06:28:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:28:57] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2025-06-07 06:28:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:28:57] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2025-06-07 06:28:57] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:28:57] [INFO ] Built C files in 311ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10817351177844578298
Running compilation step : cd /tmp/ltsmin10817351177844578298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10817351177844578298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10817351177844578298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-07 06:29:00] [INFO ] Flatten gal took : 44 ms
[2025-06-07 06:29:00] [INFO ] Flatten gal took : 43 ms
[2025-06-07 06:29:00] [INFO ] Time to serialize gal into /tmp/LTL14548272613069047997.gal : 5 ms
[2025-06-07 06:29:00] [INFO ] Time to serialize properties into /tmp/LTL18266909264827470950.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/LTL14548272613069047997.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2384933423765668770.hoa' '-atoms' '/tmp/LTL18266909264827470950.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/LTL18266909264827470950.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2384933423765668770.hoa
Detected timeout of ITS tools.
[2025-06-07 06:29:15] [INFO ] Flatten gal took : 43 ms
[2025-06-07 06:29:15] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:29:15] [INFO ] Time to serialize gal into /tmp/LTL16530952330348023497.gal : 5 ms
[2025-06-07 06:29:15] [INFO ] Time to serialize properties into /tmp/LTL17409897416645071273.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/LTL16530952330348023497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17409897416645071273.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("((p299==1)&&(p320==1))")))
Formula 0 simplified : G!"((p299==1)&&(p320==1))"
Detected timeout of ITS tools.
[2025-06-07 06:29:31] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:29:31] [INFO ] Applying decomposition
[2025-06-07 06:29:31] [INFO ] Flatten gal took : 43 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/graph16677427375295949438.txt' '-o' '/tmp/graph16677427375295949438.bin' '-w' '/tmp/graph16677427375295949438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16677427375295949438.bin' '-l' '-1' '-v' '-w' '/tmp/graph16677427375295949438.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:29:31] [INFO ] Decomposing Gal with order
[2025-06-07 06:29:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:29:31] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 06:29:31] [INFO ] Flatten gal took : 58 ms
[2025-06-07 06:29:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 37 ms.
[2025-06-07 06:29:31] [INFO ] Time to serialize gal into /tmp/LTL15061455245388188347.gal : 15 ms
[2025-06-07 06:29:31] [INFO ] Time to serialize properties into /tmp/LTL943486242783862858.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/LTL15061455245388188347.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL943486242783862858.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F("((i9.i0.u107.p299==1)&&(i10.i2.u114.p320==1))")))
Formula 0 simplified : G!"((i9.i0.u107.p299==1)&&(i10.i2.u114.p320==1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-11 finished in 298682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1||F(G(!p2)))))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 36 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 06:29:46] [INFO ] Computed 551 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:29:47] [INFO ] Implicit Places using invariants in 752 ms returned []
[2025-06-07 06:29:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:29:48] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2359 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:29:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30025 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30024 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Finished structural reductions in LTL mode , in 1 iterations and 62772 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-12
Product exploration explored 100000 steps with 29 reset in 1052 ms.
Product exploration explored 100000 steps with 29 reset in 1228 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
RANDOM walk for 13842 steps (3 resets) in 178 ms. (77 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p2), (F p1), (F (NOT p0)), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 346 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 36 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2025-06-07 06:30:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:30:53] [INFO ] Implicit Places using invariants in 730 ms returned []
[2025-06-07 06:30:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:30:55] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:30:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30024 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30024 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Finished structural reductions in LTL mode , in 1 iterations and 62693 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
RANDOM walk for 8929 steps (0 resets) in 110 ms. (80 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F p2), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 338 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Product exploration explored 100000 steps with 29 reset in 1004 ms.
Product exploration explored 100000 steps with 29 reset in 1218 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 79 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:31:59] [INFO ] Redundant transitions in 21 ms returned []
Running 1302 sub problems to find dead transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 06:31:59] [INFO ] Computed 551 invariants in 9 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 timeout
1.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30025 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30020 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60368ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60480 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin15277199240433149834
[2025-06-07 06:33:00] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15277199240433149834
Running compilation step : cd /tmp/ltsmin15277199240433149834;'/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 2492 ms.
Running link step : cd /tmp/ltsmin15277199240433149834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15277199240433149834;'/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/stateBased13655800969490571815.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 35 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 06:33:15] [INFO ] Computed 551 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:33:15] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-06-07 06:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:33:17] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:33:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30021 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30023 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in LTL mode , in 1 iterations and 62689 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin17091574917748204337
[2025-06-07 06:34:17] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17091574917748204337
Running compilation step : cd /tmp/ltsmin17091574917748204337;'/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 2446 ms.
Running link step : cd /tmp/ltsmin17091574917748204337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17091574917748204337;'/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/stateBased7165893745761379325.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 06:34:33] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:34:33] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:34:33] [INFO ] Time to serialize gal into /tmp/LTL5537484234970881698.gal : 5 ms
[2025-06-07 06:34:33] [INFO ] Time to serialize properties into /tmp/LTL118972674827101734.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/LTL5537484234970881698.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14783369839011429403.hoa' '-atoms' '/tmp/LTL118972674827101734.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/LTL118972674827101734.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14783369839011429403.hoa
Detected timeout of ITS tools.
[2025-06-07 06:34:48] [INFO ] Flatten gal took : 41 ms
[2025-06-07 06:34:48] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:34:48] [INFO ] Time to serialize gal into /tmp/LTL11178108721386002176.gal : 5 ms
[2025-06-07 06:34:48] [INFO ] Time to serialize properties into /tmp/LTL12014099037805754433.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/LTL11178108721386002176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12014099037805754433.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(p1302==0)"))U(X(X((F(G(!("((p454==1)&&(p475==1))"))))||("((p1339==1)&&(p1355==1))"))))))
Formula 0 simplified : F!"(p1302==0)" R XX(!"((p1339==1)&&(p1355==1))" & GF"((p454==1)&&(p475==1))")
Detected timeout of ITS tools.
[2025-06-07 06:35:03] [INFO ] Flatten gal took : 43 ms
[2025-06-07 06:35:03] [INFO ] Applying decomposition
[2025-06-07 06:35:03] [INFO ] Flatten gal took : 59 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/graph14175743677552386515.txt' '-o' '/tmp/graph14175743677552386515.bin' '-w' '/tmp/graph14175743677552386515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14175743677552386515.bin' '-l' '-1' '-v' '-w' '/tmp/graph14175743677552386515.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:35:03] [INFO ] Decomposing Gal with order
[2025-06-07 06:35:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:35:03] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 06:35:03] [INFO ] Flatten gal took : 56 ms
[2025-06-07 06:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 49 ms.
[2025-06-07 06:35:03] [INFO ] Time to serialize gal into /tmp/LTL7971723069396591454.gal : 14 ms
[2025-06-07 06:35:03] [INFO ] Time to serialize properties into /tmp/LTL5858123650612651336.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/LTL7971723069396591454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5858123650612651336.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(i41.i3.u462.p1302==0)"))U(X(X((F(G(!("((i14.i1.u162.p454==1)&&(i15.i1.u169.p475==1))"))))||("((i43.i2.u475.p1339==1)&&(i43.i2....177
Formula 0 simplified : F!"(i41.i3.u462.p1302==0)" R XX(!"((i43.i2.u475.p1339==1)&&(i43.i2.u481.p1355==1))" & GF"((i14.i1.u162.p454==1)&&(i15.i1.u169.p475==...160
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-12 finished in 332308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 76 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2025-06-07 06:35:18] [INFO ] Computed 551 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:35:19] [INFO ] Implicit Places using invariants in 778 ms returned []
[2025-06-07 06:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:35:21] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:35:21] [INFO ] Redundant transitions in 21 ms returned []
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:35:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30024 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30023 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60349ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62823 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-13
Product exploration explored 100000 steps with 29 reset in 1017 ms.
Product exploration explored 100000 steps with 29 reset in 1238 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 4704 steps (0 resets) in 71 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 47 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2025-06-07 06:36:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:36:25] [INFO ] Implicit Places using invariants in 751 ms returned []
[2025-06-07 06:36:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:36:26] [INFO ] Implicit Places using invariants and state equation in 1605 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:36:26] [INFO ] Redundant transitions in 21 ms returned []
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30030 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30029 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62778 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 5335 steps (0 resets) in 87 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29 reset in 1038 ms.
Product exploration explored 100000 steps with 29 reset in 1234 ms.
Built C files in :
/tmp/ltsmin2071336964217490929
[2025-06-07 06:37:29] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2025-06-07 06:37:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:37:29] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2025-06-07 06:37:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:37:29] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2025-06-07 06:37:30] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:37:30] [INFO ] Built C files in 281ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2071336964217490929
Running compilation step : cd /tmp/ltsmin2071336964217490929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2071336964217490929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2071336964217490929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 43 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2025-06-07 06:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:37:33] [INFO ] Implicit Places using invariants in 749 ms returned []
[2025-06-07 06:37:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:37:35] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2349 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:37:35] [INFO ] Redundant transitions in 22 ms returned []
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:37:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 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 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30020 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30023 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62762 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin3945644753127149777
[2025-06-07 06:38:35] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2025-06-07 06:38:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:38:35] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2025-06-07 06:38:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:38:36] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2025-06-07 06:38:36] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:38:36] [INFO ] Built C files in 293ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3945644753127149777
Running compilation step : cd /tmp/ltsmin3945644753127149777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3945644753127149777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3945644753127149777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-07 06:38:39] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:38:39] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:38:39] [INFO ] Time to serialize gal into /tmp/LTL9533330963760834513.gal : 6 ms
[2025-06-07 06:38:39] [INFO ] Time to serialize properties into /tmp/LTL15514797201802248425.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/LTL9533330963760834513.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8073184977439717658.hoa' '-atoms' '/tmp/LTL15514797201802248425.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/LTL15514797201802248425.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8073184977439717658.hoa
Detected timeout of ITS tools.
[2025-06-07 06:38:54] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:38:54] [INFO ] Flatten gal took : 51 ms
[2025-06-07 06:38:54] [INFO ] Time to serialize gal into /tmp/LTL12521983415090408554.gal : 5 ms
[2025-06-07 06:38:54] [INFO ] Time to serialize properties into /tmp/LTL16830295902312338752.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/LTL12521983415090408554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16830295902312338752.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((p843==0)||(p860==0))"))))
Formula 0 simplified : GF!"((p843==0)||(p860==0))"
Detected timeout of ITS tools.
[2025-06-07 06:39:09] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:39:09] [INFO ] Applying decomposition
[2025-06-07 06:39:09] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11184122147601586569.txt' '-o' '/tmp/graph11184122147601586569.bin' '-w' '/tmp/graph11184122147601586569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11184122147601586569.bin' '-l' '-1' '-v' '-w' '/tmp/graph11184122147601586569.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:39:09] [INFO ] Decomposing Gal with order
[2025-06-07 06:39:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:39:09] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 06:39:09] [INFO ] Flatten gal took : 55 ms
[2025-06-07 06:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 36 ms.
[2025-06-07 06:39:09] [INFO ] Time to serialize gal into /tmp/LTL7727513820007708968.gal : 14 ms
[2025-06-07 06:39:09] [INFO ] Time to serialize properties into /tmp/LTL17626022359521181695.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/LTL7727513820007708968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17626022359521181695.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 : !((F(G("((i27.i1.u299.p843==0)||(i27.i1.u305.p860==0))"))))
Formula 0 simplified : GF!"((i27.i1.u299.p843==0)||(i27.i1.u305.p860==0))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-13 finished in 246083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p1))) U p2))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 35 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2025-06-07 06:39:24] [INFO ] Computed 551 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:39:25] [INFO ] Implicit Places using invariants in 727 ms returned []
[2025-06-07 06:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:39:27] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
Running 1302 sub problems to find dead transitions.
[2025-06-07 06:39:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 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 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30023 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 1302/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1552 variables, 1552/1552 constraints. Problems are: Problem set: 0 solved, 1302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1552/2856 variables, and 1552 constraints, problems are : Problem set: 0 solved, 1302 unsolved in 30020 ms.
Refiners :[Domain max(s): 1552/1553 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1553 constraints, PredecessorRefiner: 0/1302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 1302 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Finished structural reductions in LTL mode , in 1 iterations and 62690 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2439 steps with 0 reset in 30 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-15 finished in 62835 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(X(p0))&&F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p1||(p2&&F(p3))))&&p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-050A-LTLFireability-08
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 89 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2025-06-07 06:40:28] [INFO ] Computed 551 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:40:28] [INFO ] Implicit Places using invariants in 734 ms returned []
[2025-06-07 06:40:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:40:30] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2384 ms to find 0 implicit places.
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 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 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30036 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30026 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62831 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-08
Product exploration explored 100000 steps with 790 reset in 847 ms.
Product exploration explored 100000 steps with 809 reset in 1021 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 104 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (10 resets) in 540 ms. (73 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 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
[2025-06-07 06:41:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1537/1551 variables, 546/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1551 variables, 1537/2102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1551 variables, 0/2102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1301/2852 variables, 1551/3653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2852 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2852 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2852/2852 variables, and 3653 constraints, problems are : Problem set: 0 solved, 4 unsolved in 898 ms.
Refiners :[Domain max(s): 1551/1551 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1551/1551 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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
Problem apf6 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 5/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1537/1551 variables, 546/565 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1551 variables, 1537/2102 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:41:34] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:41:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1551 variables, 2/2104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1551 variables, 0/2104 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1301/2852 variables, 1551/3655 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2852 variables, 2/3657 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2852 variables, 0/3657 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2852 variables, 0/3657 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2852/2852 variables, and 3657 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1784 ms.
Refiners :[Domain max(s): 1551/1551 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1551/1551 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2691ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 82446 steps, including 397 resets, run visited all 2 properties in 1056 ms. (steps per millisecond=78 )
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 1057 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR (NOT p0) p3))), (F (NOT p2)), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 p2))), (F p1)]
Knowledge based reduction with 12 factoid took 431 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
[2025-06-07 06:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:41:40] [INFO ] [Real]Absence check using 551 positive place invariants in 741 ms returned sat
[2025-06-07 06:41:50] [INFO ] [Real]Absence check using state equation in 10112 ms returned sat
[2025-06-07 06:41:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:41:52] [INFO ] [Nat]Absence check using 551 positive place invariants in 883 ms returned sat
[2025-06-07 06:42:05] [INFO ] [Nat]Absence check using state equation in 12970 ms returned unknown
Could not prove EG (NOT p0)
Support contains 5 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 34 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2025-06-07 06:42:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:42:06] [INFO ] Implicit Places using invariants in 736 ms returned []
[2025-06-07 06:42:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:42:07] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:42:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30023 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30027 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60346ms
Finished structural reductions in LTL mode , in 1 iterations and 62786 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 101 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (9 resets) in 513 ms. (77 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
[2025-06-07 06:43:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1537/1551 variables, 546/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1551 variables, 1537/2102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1551 variables, 0/2102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1301/2852 variables, 1551/3653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2852 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2852 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2852/2852 variables, and 3653 constraints, problems are : Problem set: 0 solved, 2 unsolved in 738 ms.
Refiners :[Domain max(s): 1551/1551 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1551/1551 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1537/1551 variables, 546/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1551 variables, 1537/2102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:43:09] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:43:09] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:43:09] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1551 variables, 3/2105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1551 variables, 0/2105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1301/2852 variables, 1551/3656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2852 variables, 2/3658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2852 variables, 0/3658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2852 variables, 0/3658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2852/2852 variables, and 3658 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1965 ms.
Refiners :[Domain max(s): 1551/1551 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1551/1551 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2720ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3440 ms.
Support contains 5 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Partial Free-agglomeration rule applied 445 times.
Drop transitions (Partial Free agglomeration) removed 445 transitions
Iterating global reduction 0 with 445 rules applied. Total rules applied 445 place count 1551 transition count 1301
Applied a total of 445 rules in 90 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1551/1551 places, 1301/1301 transitions.
RANDOM walk for 20967 steps (3 resets) in 315 ms. (66 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X (NOT p0)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p3 p0))), (F p0), (F (NOT (OR p1 p2 p3))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p3)), (F p1), (F (NOT (OR p3 (NOT p0))))]
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
[2025-06-07 06:43:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:43:17] [INFO ] [Real]Absence check using 551 positive place invariants in 724 ms returned sat
[2025-06-07 06:43:27] [INFO ] [Real]Absence check using state equation in 10278 ms returned sat
[2025-06-07 06:43:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:43:30] [INFO ] [Nat]Absence check using 551 positive place invariants in 874 ms returned sat
[2025-06-07 06:43:43] [INFO ] [Nat]Absence check using state equation in 13006 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 792 reset in 837 ms.
Product exploration explored 100000 steps with 802 reset in 1014 ms.
Built C files in :
/tmp/ltsmin8873880944846123151
[2025-06-07 06:43:45] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8873880944846123151
Running compilation step : cd /tmp/ltsmin8873880944846123151;'/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 2467 ms.
Running link step : cd /tmp/ltsmin8873880944846123151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8873880944846123151;'/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/stateBased5665794962263660792.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 33 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2025-06-07 06:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:44:01] [INFO ] Implicit Places using invariants in 737 ms returned []
[2025-06-07 06:44:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:44:02] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
Running 1300 sub problems to find dead transitions.
[2025-06-07 06:44:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)timeout
(s1279 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30028 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 1550/1550 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/2852 variables, and 1550 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 30020 ms.
Refiners :[Domain max(s): 1550/1551 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Finished structural reductions in LTL mode , in 1 iterations and 62742 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin10284358974198685902
[2025-06-07 06:45:03] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10284358974198685902
Running compilation step : cd /tmp/ltsmin10284358974198685902;'/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 2433 ms.
Running link step : cd /tmp/ltsmin10284358974198685902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10284358974198685902;'/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/stateBased13230951105759875882.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 06:45:18] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:45:18] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:45:18] [INFO ] Time to serialize gal into /tmp/LTL9012864355881433829.gal : 5 ms
[2025-06-07 06:45:18] [INFO ] Time to serialize properties into /tmp/LTL13772092886099442238.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/LTL9012864355881433829.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12071355746890738194.hoa' '-atoms' '/tmp/LTL13772092886099442238.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/LTL13772092886099442238.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12071355746890738194.hoa
Detected timeout of ITS tools.
[2025-06-07 06:45:33] [INFO ] Flatten gal took : 42 ms
[2025-06-07 06:45:33] [INFO ] Flatten gal took : 41 ms
[2025-06-07 06:45:33] [INFO ] Time to serialize gal into /tmp/LTL1356739311903212601.gal : 5 ms
[2025-06-07 06:45:33] [INFO ] Time to serialize properties into /tmp/LTL5718022322270357324.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/LTL1356739311903212601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5718022322270357324.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 : !((X(F(("((p1399==1)&&(p1420==1))")&&(X(("((p105==1)&&(p107==1))")||(("((p1399==0)||(p1420==0))")&&(F("(p393==0)")))))))))
Formula 0 simplified : XG(!"((p1399==1)&&(p1420==1))" | X(!"((p105==1)&&(p107==1))" & (!"((p1399==0)||(p1420==0))" | G!"(p393==0)")))
Detected timeout of ITS tools.
[2025-06-07 06:45:48] [INFO ] Flatten gal took : 54 ms
[2025-06-07 06:45:48] [INFO ] Applying decomposition
[2025-06-07 06:45:48] [INFO ] Flatten gal took : 44 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/graph18434926471311196559.txt' '-o' '/tmp/graph18434926471311196559.bin' '-w' '/tmp/graph18434926471311196559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18434926471311196559.bin' '-l' '-1' '-v' '-w' '/tmp/graph18434926471311196559.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:45:48] [INFO ] Decomposing Gal with order
[2025-06-07 06:45:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:45:48] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 06:45:48] [INFO ] Flatten gal took : 52 ms
[2025-06-07 06:45:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 54 ms.
[2025-06-07 06:45:48] [INFO ] Time to serialize gal into /tmp/LTL5713956119857356170.gal : 11 ms
[2025-06-07 06:45:48] [INFO ] Time to serialize properties into /tmp/LTL3083232823866122671.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/LTL5713956119857356170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3083232823866122671.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("((i45.i0.u496.p1399==1)&&(i45.i0.u504.p1420==1))")&&(X(("((i3.i1.u37.p105==1)&&(i3.i3.u38.p107==1))")||(("((i45.i0.u496.p1399...223
Formula 0 simplified : XG(!"((i45.i0.u496.p1399==1)&&(i45.i0.u504.p1420==1))" | X(!"((i3.i1.u37.p105==1)&&(i3.i3.u38.p107==1))" & (!"((i45.i0.u496.p1399==0...213
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-08 finished in 336168 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1||F(G(!p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2025-06-07 06:46:04] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12844213258477626140
[2025-06-07 06:46:04] [INFO ] Computing symmetric may disable matrix : 1303 transitions.
[2025-06-07 06:46:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:46:04] [INFO ] Computing symmetric may enable matrix : 1303 transitions.
[2025-06-07 06:46:04] [INFO ] Applying decomposition
[2025-06-07 06:46:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:46:04] [INFO ] Flatten gal took : 43 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/graph9503506849853394238.txt' '-o' '/tmp/graph9503506849853394238.bin' '-w' '/tmp/graph9503506849853394238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9503506849853394238.bin' '-l' '-1' '-v' '-w' '/tmp/graph9503506849853394238.weights' '-q' '0' '-e' '0.001'
[2025-06-07 06:46:04] [INFO ] Decomposing Gal with order
[2025-06-07 06:46:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 06:46:04] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 06:46:04] [INFO ] Computing Do-Not-Accords matrix : 1303 transitions.
[2025-06-07 06:46:04] [INFO ] Flatten gal took : 50 ms
[2025-06-07 06:46:04] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:46:04] [INFO ] Built C files in 300ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12844213258477626140
Running compilation step : cd /tmp/ltsmin12844213258477626140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-07 06:46:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 81 ms.
[2025-06-07 06:46:04] [INFO ] Time to serialize gal into /tmp/LTLFireability1301405070450066177.gal : 10 ms
[2025-06-07 06:46:04] [INFO ] Time to serialize properties into /tmp/LTLFireability15685508218081039206.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/LTLFireability1301405070450066177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15685508218081039206.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((X(X((X(X("((i38.u424.p1194==0)||(i38.u429.p1211==0))")))&&(F("(i9.u109.p307==1)"))))))
Formula 0 simplified : XX(XX!"((i38.u424.p1194==0)||(i38.u429.p1211==0))" | G!"(i9.u109.p307==1)")
Compilation finished in 4607 ms.
Running link step : cd /tmp/ltsmin12844213258477626140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin12844213258477626140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X(X((LTLAPp0==true)))&&<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12844213258477626140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X(X((LTLAPp0==true)))&&<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12844213258477626140;'/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(((LTLAPp3==true)||((LTLAPp4==true)&&<>((LTLAPp5==true)))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12844213258477626140;'/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(((LTLAPp3==true)||((LTLAPp4==true)&&<>((LTLAPp5==true)))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12844213258477626140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp6==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12844213258477626140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp6==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12844213258477626140;'/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' '([]((LTLAPp7==true)) U X(X(((LTLAPp8==true)||<>([](!(LTLAPp9==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12844213258477626140;'/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' '([]((LTLAPp7==true)) U X(X(((LTLAPp8==true)||<>([](!(LTLAPp9==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12844213258477626140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp10==true)))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-050A"
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 ShieldPPPs-PT-050A, 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 r198-tall-174894533300748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050A.tgz
mv ShieldPPPs-PT-050A 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 ;